[NWPU2018]第七次萌新课作业-数论

Begin: 1543066200000

[NWPU2018]第七次萌新课作业-数论

End: 1548250200000

Elapsed:

Remaining:

#	Origin	Title
A	LightOJ 1259	Goldbach`s Conjecture
B	LightOJ 1197	Help Hanzo
C	HDU 1215	七夕节
D	LightOJ 1236	Pairs Forming LCM
E	LightOJ 1341	Aladdin and the Flying Carpet
F	LightOJ 1336	Sigma Function
G	HDU 2669	Romantic
H	POJ 1061	青蛙的约会
I	POJ 2142	The Balance
J	LightOJ 1067	Combinations
K	HDU 5685	Problem A
L	POJ 1845	Sumdiv
M	HDU 1005	Number Sequence
N	HDU 4686	Arc of Dream
O	LightOJ 1070	Algebraic Problem
P	HDU 4565	So Easy!
Q	LightOJ 1132	Summing up Powers
R	HDU 3233	Download Manager
S	HDU 2157	How many ways??
T	CodeForces 821E	Okabe and El Psy Kongroo
U	HDU 5863	cjj's string game
V	HDU 5434	Peace small elephant

Status

My Status

Translate

PDF

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":272441,"title":"[NWPU2018]第七次萌新课作业-数论","type":0,"openness":0,"authStatus":1,"begin":1543066200000,"end":1548250200000,"createTime":1543065527000,"started":true,"ended":true,"managerId":184268,"managerName":"zhaoyiping","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":26969,"title":"Goldbach`s Conjecture","oj":"LightOJ","probNum":"1259","num":"A","publicDescId":3128353157118433,"publicDescVersion":1715611505000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26909,"title":"Help Hanzo","oj":"LightOJ","probNum":"1197","num":"B","publicDescId":3128164393121685,"publicDescVersion":1715941377000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":22310,"title":"七夕节","oj":"HDU","probNum":"1215","num":"C","publicDescId":3097754750889408,"publicDescVersion":1715588316000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 杭电ACM省赛集训队选拔赛之热身赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eIgnatius.L\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":26946,"title":"Pairs Forming LCM","oj":"LightOJ","probNum":"1236","num":"D","publicDescId":3128289217613556,"publicDescVersion":1715905641000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":27049,"title":"Aladdin and the Flying Carpet","oj":"LightOJ","probNum":"1341","num":"E","publicDescId":3129171420209649,"publicDescVersion":1715983809000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":27044,"title":"Sigma Function","oj":"LightOJ","probNum":"1336","num":"F","publicDescId":3129146853744750,"publicDescVersion":1715559717000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":34352,"title":"Romantic","oj":"HDU","probNum":"2669","num":"G","publicDescId":3205529267753024,"publicDescVersion":1715221465000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDU%C5%AE%C9%FA%D7%A8%B3%A1%B9%AB%BF%AA%C8%FC%A1%AA%A1%AA%CB%AD%CB%B5%C5%AE%D7%D3%B2%BB%C8%E7%C4%D0\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU女生专场公开赛——谁说女子不如男 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eyifenfei\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10755,"title":"青蛙的约会","oj":"POJ","probNum":"1061","num":"H","publicDescId":3158014367453028,"publicDescVersion":1715809499000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003d%E6%B5%99%E6%B1%9F\"\u003e浙江\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":21465,"title":"The Balance","oj":"POJ","probNum":"2142","num":"I","publicDescId":3113025605686035,"publicDescVersion":1715927666000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dJapan+2004\"\u003eJapan 2004\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":26784,"title":"Combinations","oj":"LightOJ","probNum":"1067","num":"J","publicDescId":3125598369139258,"publicDescVersion":1715945859000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":387700,"title":"Problem A","oj":"HDU","probNum":"5685","num":"K","publicDescId":3271575839084327,"publicDescVersion":1715708495000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2016%26quot%3B%B0%D9%B6%C8%D6%AE%D0%C7%26quot%3B+-+%D7%CA%B8%F1%C8%FC%A3%A8Astar+Round1%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2016\"百度之星\" - 资格赛（Astar Round1） \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":18406,"title":"Sumdiv","oj":"POJ","probNum":"1845","num":"L","publicDescId":3157236706117860,"publicDescVersion":1715656662000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"30000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dRomania+OI+2002\"\u003eRomania OI 2002\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":15516,"title":"Number Sequence","oj":"HDU","probNum":"1005","num":"M","publicDescId":3164404438572846,"publicDescVersion":1715621033000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dZJCPC2004\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e ZJCPC2004 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eCHEN, Shunbao\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":46252,"title":"Arc of Dream","oj":"HDU","probNum":"4686","num":"N","publicDescId":3171857626577531,"publicDescVersion":1715594262000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65535 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2013+Multi-University+Training+Contest+9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 Multi-University Training Contest 9 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eZejun Wu (watashi)\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":26787,"title":"Algebraic Problem","oj":"LightOJ","probNum":"1070","num":"O","publicDescId":3125590950229795,"publicDescVersion":1716090707000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":44687,"title":"So Easy!","oj":"HDU","probNum":"4565","num":"P","publicDescId":3168561173648707,"publicDescVersion":1715682439000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2013+ACM-ICPC%B3%A4%C9%B3%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM-ICPC长沙赛区全国邀请赛——题目重现 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":26846,"title":"Summing up Powers","oj":"LightOJ","probNum":"1132","num":"Q","publicDescId":3128533408284896,"publicDescVersion":1716001733000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":13083,"title":"Download Manager","oj":"HDU","probNum":"3233","num":"R","publicDescId":3163496355551159,"publicDescVersion":1716026916000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2009+Asia+Wuhan+Regional+Contest+Hosted+by+Wuhan+University\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Asia Wuhan Regional Contest Hosted by Wuhan University \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":40915,"title":"How many ways??","oj":"HDU","probNum":"2157","num":"S","publicDescId":3224675701741635,"publicDescVersion":1716032415000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2008%D0%C5%CF%A2%B9%A4%B3%CC%D1%A7%D4%BA%BC%AF%D1%B5%B6%D3%A1%AA%A1%AA%D1%A1%B0%CE%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008信息工程学院集训队——选拔赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e小黑\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":868328,"title":"Okabe and El Psy Kongroo","oj":"CodeForces","probNum":"821E","num":"T","publicDescId":3311641034691938,"publicDescVersion":1715970118000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/821\"\u003eCodeforces Round 420 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    matrices\r\n\n\r\n    *2100\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/52881\" title\u003d\"Announcement\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/52895\" title\u003d\"Tutorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":469274,"title":"cjj\u0027s string game","oj":"HDU","probNum":"5863","num":"U","publicDescId":3262233499833165,"publicDescVersion":1715668317000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2016+Multi-University+Training+Contest+10\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2016 Multi-University Training Contest 10 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eBUPT\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":241770,"title":"Peace small elephant","oj":"HDU","probNum":"5434","num":"V","publicDescId":3298133450863647,"publicDescVersion":1715344233000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dBestCoder+Round+%2355+%28%24%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #55 ($) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"c71a9957c9ccdafb6574c7bd585eb780","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}