CQUPT 2018 暑假招新第五周简单数学

Begin: 1534694400000

CQUPT 2018 暑假招新第五周简单数学

End: 1535299200000

Elapsed:

Remaining:

#	Origin	Title
A	LightOJ 1197	Help Hanzo
B	HDU 2012	素数判定
C	OpenJ_Bailian 1995	Raising Modulo Numbers
D	UVA 10692	Huge Mods
E	UVA 10693	Traffic Volume
F	HDU 1061	Rightmost Digit
G	LightOJ 1095	Arrange the Numbers
H	POJ 2689	Prime Distance
I	OpenJ_Bailian 1595	Prime Cuts
J	LightOJ 1282	Leading and Trailing
K	LightOJ 1341	Aladdin and the Flying Carpet
L	LightOJ 1138	Trailing Zeroes (III)

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":240113,"title":"CQUPT 2018 暑假招新 第五周 简单数学","type":0,"openness":1,"authStatus":1,"begin":1534694400000,"end":1535299200000,"createTime":1532184358000,"started":true,"ended":true,"managerId":44245,"managerName":"cqupt","fav":false,"description":{"format":"MD","content":"![megumi](https://upload-images.jianshu.io/upload_images/13252077-0576313755a0f6b3.png?imageMogr2/auto-orient/strip%7CimageView2/2/w/1240)"},"announcement":"![megumi](https://upload-images.jianshu.io/upload_images/13252077-52bb0dbde55a9100.jpg?imageMogr2/auto-orient/strip%7CimageView2/2/w/700)","problems":[{"pid":26909,"title":"Help Hanzo","oj":"LightOJ","probNum":"1197","num":"A","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":20453,"title":"素数判定","oj":"HDU","probNum":"2012","num":"B","publicDescId":3107418879239746,"publicDescVersion":1716193364000,"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\u003dC%D3%EF%D1%D4%B3%CC%D0%F2%C9%E8%BC%C6%C1%B7%CF%B0%A3%A8%B6%FE%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e C语言程序设计练习（二） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elcy\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":1081184,"title":"Raising Modulo Numbers","oj":"OpenJ_Bailian","probNum":"1995","num":"C","publicDescId":2862443778674996,"publicDescVersion":1715245512000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"CTU Open 1999","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":36625,"title":"Huge Mods","oj":"UVA","probNum":"10692","num":"D","publicDescId":3228475654272637,"publicDescVersion":1716265040000,"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":28313,"title":"Traffic Volume","oj":"UVA","probNum":"10693","num":"E","publicDescId":3115124303382952,"publicDescVersion":1715949988000,"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":15708,"title":"Rightmost Digit","oj":"HDU","probNum":"1061","num":"F","publicDescId":3164659737751154,"publicDescVersion":1716091226000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"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":25954,"title":"Arrange the Numbers","oj":"LightOJ","probNum":"1095","num":"G","publicDescId":3123476366366675,"publicDescVersion":1716037434000,"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":10258,"title":"Prime Distance","oj":"POJ","probNum":"2689","num":"H","publicDescId":3159850113853060,"publicDescVersion":1715954030000,"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":434409,"title":"Prime Cuts","oj":"OpenJ_Bailian","probNum":"1595","num":"I","publicDescId":3260419036070645,"publicDescVersion":1715291130000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"South Central USA 1996","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":26992,"title":"Leading and Trailing","oj":"LightOJ","probNum":"1282","num":"J","publicDescId":3129000868554890,"publicDescVersion":1715829965000,"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":27049,"title":"Aladdin and the Flying Carpet","oj":"LightOJ","probNum":"1341","num":"K","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":26852,"title":"Trailing Zeroes (III)","oj":"LightOJ","probNum":"1138","num":"L","publicDescId":3128552187215534,"publicDescVersion":1716210878000,"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]}],"problemsHash":"2828196ab62b0cf426f0b16c4ca81925","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}

CQUPT 2018 暑假招新 第五周 简单数学

CQUPT 2018 暑假招新第五周简单数学