2020SCUACM 专题·数论

Begin: 1583121600000

2020SCUACM 专题·数论

End: 1583985600000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1554	Pairs of integers
B	UVA 10791	Minimum Sum LCM
C	UVA 10375	Choose and divide
D	UVA 10820	Send a Table
E	UVA 10214	Trees in a Wood.
F	UVA 11754	Code Feat
G	HDU 4474	Yet Another Multiple Problem
H	UVA 10837	A Research Problem
I	POJ 3292	Semi-prime H-numbers
J	UVA 294	Divisors
K	POJ 1730	Perfect Pth Powers
L	UVA 10539	Almost Prime Numbers
M	Gym 101150A	Sum of Consecutive Prime Numbers

Status

My Status

Translate

PDF

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

{"id":360106,"title":"2020SCUACM 专题·数论","type":0,"openness":0,"authStatus":1,"begin":1583121600000,"end":1583985600000,"createTime":1583069680000,"started":true,"ended":true,"managerId":355279,"managerName":"SCUACM2020","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":31158,"title":"Pairs of integers","oj":"HDU","probNum":"1554","num":"A","enabledDescKeys":[3212317539666560],"descBriefs":[{"key":3212317539666560,"updateDate":"2024-09-19","version":1726718422000,"author":"0","remarks":"Initialization."}],"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\u003d2001-2002+ACM+Northeastern+European+Regional+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2001-2002 ACM Northeastern European Regional Programming Contest \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":19594,"title":"Minimum Sum LCM","oj":"UVA","probNum":"10791","num":"B","enabledDescKeys":[3105212008640159],"descBriefs":[{"key":3105212008640159,"updateDate":"2024-09-13","version":1726188998000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":19601,"title":"Choose and divide","oj":"UVA","probNum":"10375","num":"C","enabledDescKeys":[3105259966751480],"descBriefs":[{"key":3105259966751480,"updateDate":"2024-09-19","version":1726742462000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":19595,"title":"Send a Table","oj":"UVA","probNum":"10820","num":"D","enabledDescKeys":[3105241117837098],"descBriefs":[{"key":3105241117837098,"updateDate":"2024-09-13","version":1726217639000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":22935,"title":"Trees in a Wood.","oj":"UVA","probNum":"10214","num":"E","enabledDescKeys":[3097106776497073],"descBriefs":[{"key":3097106776497073,"updateDate":"2024-09-12","version":1726092790000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":33956,"title":"Code Feat","oj":"UVA","probNum":"11754","num":"F","enabledDescKeys":[3202063620936290],"descBriefs":[{"key":3202063620936290,"updateDate":"2024-09-19","version":1726743411000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":34427,"title":"Yet Another Multiple Problem","oj":"HDU","probNum":"4474","num":"G","enabledDescKeys":[3205221481836459],"descBriefs":[{"key":3205221481836459,"updateDate":"2024-09-15","version":1726357744000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"20000 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\u003d2012+Asia+Chengdu+Regional+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 Asia Chengdu Regional Contest \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":34761,"title":"A Research Problem","oj":"UVA","probNum":"10837","num":"H","enabledDescKeys":[3204063161062945],"descBriefs":[{"key":3204063161062945,"updateDate":"2024-09-19","version":1726719437000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":17347,"title":"Semi-prime H-numbers","oj":"POJ","probNum":"3292","num":"I","enabledDescKeys":[3151423203872149],"descBriefs":[{"key":3151423203872149,"updateDate":"2024-09-19","version":1726713915000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 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\u003dWaterloo+Local+Contest\"\u003eWaterloo Local Contest\u003c/a\u003e, 2006.9.30\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":19892,"title":"Divisors","oj":"UVA","probNum":"294","num":"J","enabledDescKeys":[3108725595320949],"descBriefs":[{"key":3108725595320949,"updateDate":"2024-09-19","version":1726743492000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":18592,"title":"Perfect Pth Powers","oj":"POJ","probNum":"1730","num":"K","enabledDescKeys":[3157279112326129],"descBriefs":[{"key":3157279112326129,"updateDate":"2024-09-19","version":1726701584000,"author":"0","remarks":"Initialization."}],"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\u003dWaterloo+local+2004.01.31\"\u003eWaterloo local 2004.01.31\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":28310,"title":"Almost Prime Numbers","oj":"UVA","probNum":"10539","num":"L","enabledDescKeys":[3115137775920756],"descBriefs":[{"key":3115137775920756,"updateDate":"2024-09-13","version":1726184621000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":548523,"title":"Sum of Consecutive Prime Numbers","oj":"Gym","probNum":"101150A","num":"M","enabledDescKeys":[3344059536133106],"descBriefs":[{"key":3344059536133106,"updateDate":"2024-09-15","version":1726402920000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003ca href\u003d\u0027https://codeforces.com/gym/101150\u0027 target\u003d\u0027_blank\u0027\u003e2016-2017 CT S03E08: Codeforces Trainings Season 3 Episode 8 - 2005-2006 ACM-ICPC, Tokyo Regional Contest + 2010 Google Code Jam Qualification Round (CGJ 10, Q)\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","91":"GNU G++23 14.2 (64 bit, msys2)","70":"PyPy 3.10 (7.3.15, 64bit)","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]}],"problemsHash":"53322a1707d06f06af1f21fa83a76480","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}