安装 Steam
登录
|
语言
繁體中文(繁体中文)
日本語(日语)
한국어(韩语)
ไทย(泰语)
български(保加利亚语)
Čeština(捷克语)
Dansk(丹麦语)
Deutsch(德语)
English(英语)
Español-España(西班牙语 - 西班牙)
Español - Latinoamérica(西班牙语 - 拉丁美洲)
Ελληνικά(希腊语)
Français(法语)
Italiano(意大利语)
Bahasa Indonesia(印度尼西亚语)
Magyar(匈牙利语)
Nederlands(荷兰语)
Norsk(挪威语)
Polski(波兰语)
Português(葡萄牙语 - 葡萄牙)
Português-Brasil(葡萄牙语 - 巴西)
Română(罗马尼亚语)
Русский(俄语)
Suomi(芬兰语)
Svenska(瑞典语)
Türkçe(土耳其语)
Tiếng Việt(越南语)
Українська(乌克兰语)
报告翻译问题









The Prime Factor Calculator can be improved by focusing on the fact the only primes which need to be tested are 2, 3, 5, and 7. If the last value for an N can't be factored by any of those four primes then that current value of N is the last prime factor. So, output it and then a zero. For example, Test 1 uses an N of 69 with the answer being "3, 23, 0". Testing with 2 fails cuz it's odd, of course, 3 gives the 23, and then 3, 5, and 7 all fail with 23, so then output the 23 and a 0 and it's done.
I wasn't able to make a compact looking version like yours, however, the screenshot shows a solution which is both fast and has some parallelization. Perhaps, armed with this knowledge, you could produce a better version than mine.
https://psteamcommunity.yuanyoumao.com/sharedfiles/filedetails/?id=2925118360