【綜合練習】排程演算法：實作 1 - 問題副本 | 程式專案

{"id":1180794,"student_id":44333,"content":"{\"html\":\"\u003c!DOCTYPE html\u003e\\n\u003chtml\u003e\\n\u003chead\u003e\\n\\t\u003ctitle\u003eDocument\u003c/title\u003e\\n\u003c/head\u003e\\n\u003cbody\u003e\\n    \u003cdiv id=\\\"screenshot\\\"\u003e\\n        \u003cp\u003e題目：\u003c/p\u003e\\n        \u003cdiv id=\\\"log\\\"\u003eloading...\u003c/div\u003e\\n    \u003c/div\u003e\\n\u003c/body\u003e\\n\u003c/html\u003e\",\"css\":\"* {\\n    margin: 0;\\n    padding: 0;\\n    box-sizing: border-box;\\n    font-size: 16px;\\n}\\n\\nhtml, body {\\n    width: 100%;\\n    height: 100%;\\n    background-color: #333;\\n    padding: 10px;\\n}\\n\\np {\\n    color: white;\\n    margin-bottom: 10px;\\n}\\n\\n#log {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n}\\n\\n#code {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n    overflow-x: scroll;\\n}\\n\\n#question {\\n    height: 130px;\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\\n\\n#screenshot {\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\",\"js\":\"\\r\\nfunction cyclicScheduling(tasks, numWorkers) {\\r\\n    const schedule = [];\\r\\n    const workerTasks = new Array(numWorkers);\\r\\n        for (let i = 0; i \u003c numWorkers; i++) {\\r\\n        workerTasks[i] = [];\\r\\n    }\\r\\n    for (let i = 0; i \u003c tasks.length; i++) { \\r\\n        const task = tasks[i]; \\r\\n        const workerIndex = i % numWorkers; \\r\\n        workerTasks[workerIndex].push(task);\\r\\n    }\\r\\n    for (let i = 0; i \u003c numWorkers; i++) {\\r\\n        schedule.push(workerTasks[i]);\\r\\n    }\\r\\n    return schedule;\\r\\n}\\r\\n\\r\\nconst tasks = ['Task 1', 'Task 2', 'Task 3', 'Task 4', 'Task 5', 'Task 6'];\\r\\nconst numWorkers = 3;\\r\\n\\r\\nconst schedule = cyclicScheduling(tasks, numWorkers);\\r\\n\\r\\nconsole.log('循環排程結果：');\\r\\nfor (let i = 0; i \u003c schedule.length; i++) {\\r\\n    console.log(`Worker ${i + 1}: ${schedule[i].join(', ')}`);\\r\\n}\"}","created_at":"2025-12-07T10:39:17.173+08:00","updated_at":"2025-12-07T10:40:09.315+08:00","name":"【綜合練習】排程演算法：實作 1 - 問題 副本","language":"web","screenshot":{"url":null},"parent_id":576357,"plugin":"(function () {\n    if (!console) {\n        console = {};\n    }\n    var old = console.log;\n    var logger = document.getElementById('log');\n    console.log = function (message) {\n        if (typeof message == 'object') {\n            logger.innerHTML += (JSON \u0026\u0026 JSON.stringify ? JSON.stringify(message) : String(message)) + '\u003cbr /\u003e';\n        } else {\n            logger.innerHTML += message + '\u003cbr /\u003e';\n        }\n        old(message)\n    }\n})();","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":1,"hashid":"2pds39q43","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}