contest.view.begin
:
1592727060000
组合博弈 [Cloned]
contest.view.end
:
1597907460000
contest.view.elapsed
:
(
contest.frozen
)
contest.view.remaining
:
Status
My Status
PDF
contest.view.statement_selection_label
:
ID
status.list.username
status.list.prob
status.list.result
status.list.time
(ms)
status.list.mem
(MB)
status.list.length
status.list.lang
C
C++
C#
D
Go
Haskell
Java
JavaScript
Kotlin
Lua
Objective-C
Pascal
Perl
PHP
Python
Ruby
Rust
Scala
Swift
Other
status.list.submit_time
{"id":379290,"title":"组合博弈 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1592727060000,"end":1597907460000,"freezeTime":1597907460000,"unfreezeTime":1597907460000,"enableFreeze":false,"createTime":1592727032000,"version":"c58","started":true,"ended":true,"managerId":249463,"managerName":"syffffffffff","fav":false,"description":{"format":"HTML","content":"multi-nim extension：\nBZOJ 2940\nBZOJ 1188\n洛谷 3235"},"announcement":"","problems":[{"pid":17688,"title":"无限取多堆nim博弈","oj":"POJ","probNum":"2234","num":"A","enabledDescKeys":[316040550327813],"descBriefs":[{"key":316040550327813,"updateDate":"2025-05-01","version":1746062769000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dPOJ+Monthly\"\u003ePOJ Monthly\u003c/a\u003e,readchild\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":10639,"title":"无限取多堆nim博弈的单步必胜策略计数","oj":"POJ","probNum":"2975","num":"B","enabledDescKeys":[312262253552570],"descBriefs":[{"key":312262253552570,"updateDate":"2025-04-27","version":1745752561000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dStanford+Local+2005\"\u003eStanford Local 2005\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":21520,"title":"搜索/找规律","oj":"POJ","probNum":"2505","num":"C","enabledDescKeys":[314910232937740],"descBriefs":[{"key":314910232937740,"updateDate":"2025-05-01","version":1746062810000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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+2001.09.22\"\u003eWaterloo local 2001.09.22\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":19697,"title":"威佐夫博弈/betty序列","oj":"POJ","probNum":"1067","num":"D","enabledDescKeys":[315452980477781],"descBriefs":[{"key":315452980477781,"updateDate":"2025-08-04","version":1754308704000,"author":"System","authorKey":"main","type":"main","lang":"zh","langDisplay":"中文","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dNOI\"\u003eNOI\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":30664,"title":"对称","oj":"POJ","probNum":"2484","num":"E","enabledDescKeys":[312185439096053],"descBriefs":[{"key":312185439096053,"updateDate":"2025-04-29","version":1745942169000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dPOJ+Contest\"\u003ePOJ Contest\u003c/a\u003e,Author:Mathematica@ZSU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":17243,"title":"DAG上求拓扑序求SG","oj":"POJ","probNum":"2425","num":"F","enabledDescKeys":[315626762950229],"descBriefs":[{"key":315626762950229,"updateDate":"2025-04-30","version":1746017727000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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\u003dPKU+Monthly\"\u003ePKU Monthly\u003c/a\u003e,CHEN Shixi(xreborner)\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":12411,"title":"限制取石子数的nim游戏","oj":"POJ","probNum":"2960","num":"G","enabledDescKeys":[312603517045296],"descBriefs":[{"key":312603517045296,"updateDate":"2025-05-07","version":1746606447000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"2000 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\u003dSvenskt+M%C3%A4sterskap+i+Programmering%2FNorgesmesterskapet+2004\"\u003eSvenskt Mästerskap i Programmering/Norgesmesterskapet 2004\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":16361,"title":"阶梯博弈","oj":"POJ","probNum":"1704","num":"H","enabledDescKeys":[316431876405976],"descBriefs":[{"key":316431876405976,"updateDate":"2026-07-09","version":1783559810000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dPOJ+Monthly--2004.07.18\"\u003ePOJ Monthly--2004.07.18\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":17244,"title":"对称","oj":"POJ","probNum":"1740","num":"I","enabledDescKeys":[315625911879668],"descBriefs":[{"key":315625911879668,"updateDate":"2025-05-05","version":1746421905000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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\u003dLouTiancheng%40POJ\"\u003eLouTiancheng@POJ\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":30663,"title":"SG顺推","oj":"POJ","probNum":"2068","num":"J","enabledDescKeys":[312186039030614],"descBriefs":[{"key":312186039030614,"updateDate":"2025-04-27","version":1745753009000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"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\u003dJapan+2001\"\u003eJapan 2001\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":15083,"title":"anti-nim","oj":"POJ","probNum":"3480","num":"K","enabledDescKeys":[316654354440902],"descBriefs":[{"key":316654354440902,"updateDate":"2025-05-03","version":1746243027000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dSoutheastern+Europe+2007\"\u003eSoutheastern Europe 2007\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":17245,"title":"欧几里得博弈推后继状态","oj":"POJ","probNum":"2348","num":"L","enabledDescKeys":[315626149507227],"descBriefs":[{"key":315626149507227,"updateDate":"2026-03-23","version":1774278583000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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+2002.09.28\"\u003eWaterloo local 2002.09.28\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":18610,"title":"树上类NIM组合博弈，树上dp求SG值，延长1即SG+1，环分奇偶分为别1，0","oj":"POJ","probNum":"3710","num":"M","enabledDescKeys":[315205257611454],"descBriefs":[{"key":315205257611454,"updateDate":"2026-04-22","version":1776839583000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.12.28\"\u003ePOJ Founder Monthly Contest – 2008.12.28\u003c/a\u003e, Yaojinyu\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":31552,"title":"multi-SG 分二进制位数1的奇偶个数的奇偶性讨论找规律","oj":"HDU","probNum":"4388","num":"N","enabledDescKeys":[288608796455044],"descBriefs":[{"key":288608796455044,"updateDate":"2018-03-28","version":1522221565000,"author":"cjyl","authorKey":"user:147491","authorUserId":147491,"type":"user","lang":"en","langDisplay":"English","official":false,"mainOfficial":false,"publicVisible":true,"avatarUrl":"https://cn.cravatar.com/avatar/fe4234af81067b2c00e4c3ae994caddb?d\u003dretro","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\u003d2012+Multi-University+Training+Contest+9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2012 Multi-University Training Contest 9 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003eWHU\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":14720,"title":"三堆威佐夫博弈；必败态稀疏，递推求解必胜态","oj":"ZOJ","probNum":"3057","num":"O","enabledDescKeys":[316139108562235],"descBriefs":[{"key":316139108562235,"updateDate":"2025-05-03","version":1746267201000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"5000 ms","spoiler":false},{"title":"mem_limit","content":"32768 kB","spoiler":false},{"title":"os","content":"Linux","spoiler":false},{"title":"author","content":"JIANG, Guangran","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.remote_oj_unavailable","submitMethods":[false,false,true]},{"pid":22651,"title":"拆分multi-nim","oj":"HDU","probNum":"3032","num":"P","enabledDescKeys":[309711610369271],"descBriefs":[{"key":309711610369271,"updateDate":"2026-04-02","version":1775127455000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003d2009+Multi-University+Training+Contest+13+-+Host+by+HIT\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 13 - Host by HIT \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":17242,"title":"multi-SG修改边界","oj":"POJ","probNum":"2311","num":"Q","enabledDescKeys":[315627359758006],"descBriefs":[{"key":315627359758006,"updateDate":"2025-05-08","version":1746716137000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"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\u003dPOJ+Monthly\"\u003ePOJ Monthly\u003c/a\u003e,CHEN Shixi(xreborner)\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":14696,"title":"2D-NIM积","oj":"HDU","probNum":"3404","num":"R","enabledDescKeys":[316139487646965],"descBriefs":[{"key":316139487646965,"updateDate":"2025-08-26","version":1756153380000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"3000 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\u003dHDOJ+Monthly+Contest+%A8C+2010.05.01\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest �C 2010.05.01 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"author","content":"\u003cdiv class\u003d\"panel_content\"\u003elxhgww\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]},{"pid":10642,"title":"3D-NIM积","oj":"POJ","probNum":"3533","num":"S","enabledDescKeys":[312277981351160],"descBriefs":[{"key":312277981351160,"updateDate":"2025-05-03","version":1746255117000,"author":"System","authorKey":"main","type":"main","lang":"en","langDisplay":"English","official":true,"mainOfficial":true,"publicVisible":true,"remarks":"Initialization."}],"properties":[{"title":"time_limit","content":"1000 ms","spoiler":false},{"title":"mem_limit","content":"131072 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+Founder+Monthly+Contest+%E2%80%93+2008.03.16\"\u003ePOJ Founder Monthly Contest – 2008.03.16\u003c/a\u003e, g201513\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"contest.view.problem_submit_tip.out_of_contest_ancient","submitMethods":[true,true,true]}],"problemsHash":"c586b7fd6200cbb40f8d9a4a6ad38fa5","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"oneShot":false,"customizedWeight":false,"showPeers":false,"participantMode":0,"excludedFromRank":false,"participation":{"enabled":false,"canChange":false,"options":[]},"clonedFromId":0}
