Number theory 前3章除nefu的题目

Begin: 1473569280000

Number theory 前3章除nefu的题目

End: 1478753280000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 2099	整除的尾数
B	HDU 2098	分拆素数和
C	POJ 2689	Prime Distance
D	POJ 2769	Reduced ID Numbers
E	HDU 1021	Fibonacci Again
F	HDU 2035	人见人爱A^B
G	POJ 2891	Strange Way to Express Integers
H	POJ 2115	C Looooops
I	HDU 1573	X问题
J	HDU 3579	Hello Kiki
K	POJ 3243	Clever Y
L	POJ 2417	Discrete Logging
M	HDU 2815	Mod Tree
N	POJ 3233	Matrix Power Series
O	POJ 1995	Raising Modulo Numbers
P	POJ 1006	Biorhythms
Q	HDU 1788	Chinese remainder theorem again

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":132006,"title":"Number theory 前3章 除nefu的题目","type":0,"openness":0,"authStatus":1,"begin":1473569280000,"end":1478753280000,"createTime":0,"started":true,"ended":true,"managerId":97462,"managerName":"851631204","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":23629,"title":"整除的尾数","oj":"HDU","probNum":"2099","num":"A","publicDescId":3098434585646758,"publicDescVersion":1713471487000,"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\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A82%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2007省赛集训队练习赛（2） \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":20454,"title":"分拆素数和","oj":"HDU","probNum":"2098","num":"B","publicDescId":3107413632113809,"publicDescVersion":1713434171000,"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\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A82%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2007省赛集训队练习赛（2） \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":10258,"title":"Prime Distance","oj":"POJ","probNum":"2689","num":"C","publicDescId":3159850113853060,"publicDescVersion":1713470992000,"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":17910,"title":"Reduced ID Numbers","oj":"POJ","probNum":"2769","num":"D","publicDescId":3155266119696331,"publicDescVersion":1713243356000,"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\u003dNorthwestern+Europe+2005\"\u003eNorthwestern Europe 2005\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":11547,"title":"Fibonacci Again","oj":"HDU","probNum":"1021","num":"E","publicDescId":3161360906739156,"publicDescVersion":1713478068000,"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\"\u003eLeojay\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":17489,"title":"人见人爱A^B","oj":"HDU","probNum":"2035","num":"F","publicDescId":3151810522273723,"publicDescVersion":1713454390000,"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\u003dACM%B3%CC%D0%F2%C9%E8%BC%C6%C6%DA%C4%A9%BF%BC%CA%D4%A3%A82006%2F06%2F07%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e ACM程序设计期末考试（2006/06/07） \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":10265,"title":"Strange Way to Express Integers","oj":"POJ","probNum":"2891","num":"G","publicDescId":3159889284315873,"publicDescVersion":1712981609000,"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+Monthly--2006.07.30\"\u003ePOJ Monthly--2006.07.30\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]},{"pid":21464,"title":"C Looooops","oj":"POJ","probNum":"2115","num":"H","publicDescId":3113022799493828,"publicDescVersion":1712990594000,"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\u003dCTU+Open+2004\"\u003eCTU Open 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":30571,"title":"X问题","oj":"HDU","probNum":"1573","num":"I","publicDescId":3120781616880737,"publicDescVersion":1713541972000,"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+2007-1+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2007-1 Programming Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elwg\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":13572,"title":"Hello Kiki","oj":"HDU","probNum":"3579","num":"J","publicDescId":3162492221928455,"publicDescVersion":1713215758000,"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\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A814%A3%A9%A1%AA%A1%AAHost+by+BJTU\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2010 ACM-ICPC Multi-University Training Contest（14）——Host by BJTU \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003edigiter (Special Thanks echo)\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":10308,"title":"Clever Y","oj":"POJ","probNum":"3243","num":"K","publicDescId":3159963781385281,"publicDescVersion":1713251573000,"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\u003dPOJ+Monthly--2007.07.08\"\u003ePOJ Monthly--2007.07.08\u003c/a\u003e, Guo, Huayang\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":11562,"title":"Discrete Logging","oj":"POJ","probNum":"2417","num":"L","publicDescId":3161968687943679,"publicDescVersion":1713473439000,"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\u003dWaterloo+Local+2002.01.26\"\u003eWaterloo Local 2002.01.26\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":17935,"title":"Mod Tree","oj":"HDU","probNum":"2815","num":"M","publicDescId":3153686298210473,"publicDescVersion":1713481333000,"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+1st+%A1%B0Old-Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 1st “Old-Vegetable-Birds Cup” Programming Open Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eAekdyCoin\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":10959,"title":"Matrix Power Series","oj":"POJ","probNum":"3233","num":"N","publicDescId":3158370273529864,"publicDescVersion":1713149273000,"properties":[{"title":"Time limit","content":"3000 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+Monthly--2007.06.03\"\u003ePOJ Monthly--2007.06.03\u003c/a\u003e, Huang, Jinsong\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":10799,"title":"Raising Modulo Numbers","oj":"POJ","probNum":"1995","num":"O","publicDescId":3158656970847213,"publicDescVersion":1713053608000,"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\u003dCTU+Open+1999\"\u003eCTU Open 1999\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":16391,"title":"Biorhythms","oj":"POJ","probNum":"1006","num":"P","publicDescId":3151027316338878,"publicDescVersion":1713534384000,"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\u003dEast+Central+North+America+1999\"\u003eEast Central North America 1999\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":30274,"title":"Chinese remainder theorem again","oj":"HDU","probNum":"1788","num":"Q","publicDescId":3121963863361426,"publicDescVersion":1713471580000,"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\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A810%A3%A9_%D2%D4%B4%CB%B8%D0%D0%BBDOOMIII\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2007省赛集训队练习赛（10）_以此感谢DOOMIII \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]}],"problemsHash":"69d8d0c81a574c0694cebd57491a1c90","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}

Number theory 前3章 除nefu的题目

Number theory 前3章除nefu的题目