質因數 | JavaScript 程式專案

{"id":49512,"student_id":1407,"content":"var num1 = prompt(\"數1\")\nvar num2 = prompt(\"數2\")\nvar number1 = []\nvar number2 = []\nvar ne = []\nvar end = 0\nvar t = 0\nfor (var i = 1; i \u003c= num1; i++) {\n    var a = num1/i\n    var b = Math.floor(a)\n    if (a == b) {\n        number1.push(i)\n    }\n}\nfor (var i = 1; i \u003c= num2; i++) {\n    var a = num2/i\n    var b = Math.floor(a);\n    if (a == b) {\n        number2.push(i);\n    }\n}\nfor (var i = 0; i \u003c number1.length; i++) {\n    for (var j = 0; j \u003c number2.length; j++) {\n        if (number1[i] == number2[j]) {\n            ne.push(number1[i]);\n        }\n    }\n    end++\n}\n\nforever(function() {\n    if (t == 1) {\n        return\n    }\n    if (end == number1.length) {\n        if (ne.length \u003c 2) {\n            var bitch = ne[ne.length-1]\n            var de = num1/bitch\n            var dc = num2/bitch\n            var aaa = bitch*de*dc\n            alert(\"兩數互質\");\n            t = 1\n        } else {\n            var bitch1 = ne[ne.length-1]\n            var de1 = num1/bitch\n            var dc1 = num2/bitch\n            var aaa1 = bitch*de*dc\n            alert(\"兩數最大公因數為\"+ne[ne.length-1]);\n            alert(\"兩數最小公倍數為\"+aaa);\n            t = 1\n        }\n    }\n})","created_at":"2018-11-19T21:34:21.640+08:00","updated_at":"2019-11-09T18:10:00.559+08:00","name":"質因數","language":"javascript","screenshot":{"url":"https://cdn7.koding.school/uploads/project/screenshot/49512/fd1ac05835b665cf0d7e3c5532c7c2d7.jpg"},"parent_id":2,"plugin":"","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":270,"hashid":"rdvs3m3k","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}