2022_GDUT_新生专题训练_数论

Begin: 1644154200000

2022_GDUT_新生专题训练_数论

End: 1647754200000

Elapsed:

Remaining:

#	Origin	Title
A	CodeForces 858A	k-rounding
B	CodeForces 456B	Fedya and Maths
C	CodeForces 300C	Beautiful Numbers
D	LibreOJ 2605	同余方程
E	POJ 2689	Prime Distance
F	LibreOJ 2314	小凯的疑惑
G	POJ 1061	青蛙的约会
H	POJ 1091	跳蚤
I	POJ 1306	Combinations
J	UVA 11806	Cheerleaders
K	POJ 3734	Blocks
L	POJ 2773	Happy 2006

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":479577,"title":"2022_GDUT_新生专题训练_数论","type":0,"openness":0,"authStatus":1,"begin":1644154200000,"end":1647754200000,"createTime":1644153124000,"started":true,"ended":true,"managerId":499966,"managerName":"qqricky","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":1077397,"title":"k-rounding","oj":"CodeForces","probNum":"858A","num":"A","publicDescId":2859450860532502,"publicDescVersion":1714810953000,"properties":[{"title":"Time limit","content":"1000 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/858\"\u003eТехнокубок 2018 - Отборочный Раунд 1\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    brute force\r\n\n\r\n    math\r\n\n\r\n    number theory\r\n\n\r\n    *1100\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/54580\" title\u003d\"54580\" 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/54604\" title\u003d\"Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial\" target\u003d\"_blank\"\u003eTutorial\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":59949,"title":"Fedya and Maths","oj":"CodeForces","probNum":"456B","num":"B","publicDescId":3283886526683495,"publicDescVersion":1714826131000,"properties":[{"title":"Time limit","content":"1000 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/456\"\u003eCodeforces Round 260 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    math\r\n\n\r\n    number theory\r\n\n\r\n    *1200\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/13336\" title\u003d\"Codeforces Round #260 — Editorial\" target\u003d\"_blank\"\u003eTutorial #1\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":38838,"title":"Beautiful Numbers","oj":"CodeForces","probNum":"300C","num":"C","publicDescId":3235716262194915,"publicDescVersion":1714712079000,"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/300\"\u003eCodeforces Round 181 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    brute force\r\n\n\r\n    combinatorics\r\n\n\r\n    *1800\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/7479\" title\u003d\"Codeforces Round #181 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/7497\" title\u003d\"Разбор задач Codeforces Round #181 (Div.2) \" target\u003d\"_blank\"\u003eTutorial #1 \u003cspan class\u003d\"resource-locale\"\u003e(ru)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/7497\" title\u003d\"English Tutorial\" target\u003d\"_blank\"\u003eEnglish Tutorial \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":3250875,"title":"同余方程","oj":"LibreOJ","probNum":"2605","num":"D","publicDescId":2891850364320926,"publicDescVersion":1714826591000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"NOIP2012","spoiler":true},{"title":"Tags","content":"扩展欧几里德算法; 2012; NOIP","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10258,"title":"Prime Distance","oj":"POJ","probNum":"2689","num":"E","publicDescId":3159850113853060,"publicDescVersion":1714740383000,"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+1998.10.17\"\u003eWaterloo local 1998.10.17\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":3299446,"title":"小凯的疑惑","oj":"LibreOJ","probNum":"2314","num":"F","publicDescId":2912170622504091,"publicDescVersion":1714399705000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"NOIP2017","spoiler":true},{"title":"Tags","content":"数学; 数论; 2017; NOIP","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":"G","publicDescId":2985529503006519,"publicDescVersion":1610959623000,"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":18407,"title":"跳蚤","oj":"POJ","probNum":"1091","num":"H","publicDescId":3157231324766515,"publicDescVersion":1714674165000,"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\u003dHNOI+2001\"\u003eHNOI 2001\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":18009,"title":"Combinations","oj":"POJ","probNum":"1306","num":"I","publicDescId":3153829277193214,"publicDescVersion":1714143014000,"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\u003dUVA+Volume+III+369\"\u003eUVA Volume III 369\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":31969,"title":"Cheerleaders","oj":"UVA","probNum":"11806","num":"J","publicDescId":3212774265891728,"publicDescVersion":1714485231000,"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":11319,"title":"Blocks","oj":"POJ","probNum":"3734","num":"K","publicDescId":3161626518599988,"publicDescVersion":1714792984000,"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\u003dPKU+Campus+2009+%28POJ+Monthly+Contest+%E2%80%93+2009.05.17%29\"\u003ePKU Campus 2009 (POJ Monthly Contest – 2009.05.17)\u003c/a\u003e, Simon\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":10260,"title":"Happy 2006","oj":"POJ","probNum":"2773","num":"L","publicDescId":3159873308570910,"publicDescVersion":1714392950000,"properties":[{"title":"Time limit","content":"3000 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\u003dPOJ+Monthly--2006.03.26\"\u003ePOJ Monthly--2006.03.26\u003c/a\u003e,static\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":"7b713aec0bcf90c741d56a5d562a6386","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}