补♂课第10场

Begin: 1511852400000

End: 1511859600000

Elapsed:

Remaining:

#	Origin	Title
A	OpenJ_Bailian 1000	凑十个题
B	OpenJ_Bailian 2707	求一元二次方程的根
C	OpenJ_Bailian 2708	平衡饮食
D	OpenJ_Bailian 2709	求出e的值
E	OpenJ_Bailian 2710	数制转换
F	OpenJ_Bailian 2711	合唱队形
G	OpenJ_Bailian 2712	细菌繁殖
H	OpenJ_Bailian 2713	肿瘤面积
I	OpenJ_Bailian 2714	求平均年龄
J	OpenJ_Bailian 2715	谁拿了最多奖学金

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":200979,"title":"补♂课第10场","type":0,"openness":0,"authStatus":1,"begin":1511852400000,"end":1511859600000,"createTime":1511494527000,"started":true,"ended":true,"managerId":162653,"managerName":"WuK","fav":false,"description":{"format":"MD","content":"来源：2005~2006北大医学部计算概论期末考试\n[题解](https://wu-kan.github.io/posts/22366/)"},"announcement":"友情♂提示：题目难度和顺序没有关系","problems":[{"pid":226792,"title":"凑十个题","oj":"OpenJ_Bailian","probNum":"1000","num":"A","publicDescId":2865033110514953,"publicDescVersion":1508227802000,"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":"POJ","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":534976,"title":"求一元二次方程的根","oj":"OpenJ_Bailian","probNum":"2707","num":"B","publicDescId":3359962115913417,"publicDescVersion":1713021911000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":534977,"title":"平衡饮食","oj":"OpenJ_Bailian","probNum":"2708","num":"C","publicDescId":3359965324750612,"publicDescVersion":1713039219000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":316439,"title":"求出e的值","oj":"OpenJ_Bailian","probNum":"2709","num":"D","publicDescId":3239753754107736,"publicDescVersion":1713011357000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":390969,"title":"数制转换","oj":"OpenJ_Bailian","probNum":"2710","num":"E","publicDescId":3271281315290731,"publicDescVersion":1713376225000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":390970,"title":"合唱队形","oj":"OpenJ_Bailian","probNum":"2711","num":"F","publicDescId":3271275599180982,"publicDescVersion":1713269955000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":338548,"title":"细菌繁殖","oj":"OpenJ_Bailian","probNum":"2712","num":"G","publicDescId":3244555489030860,"publicDescVersion":1713503922000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":338506,"title":"肿瘤面积","oj":"OpenJ_Bailian","probNum":"2713","num":"H","publicDescId":3244465482043706,"publicDescVersion":1713033005000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":338500,"title":"求平均年龄","oj":"OpenJ_Bailian","probNum":"2714","num":"I","publicDescId":3244440916103611,"publicDescVersion":1713043709000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":338501,"title":"谁拿了最多奖学金","oj":"OpenJ_Bailian","probNum":"2715","num":"J","publicDescId":3244435535007686,"publicDescVersion":1713221922000,"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":"2005~2006医学部计算概论期末考试","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]}],"problemsHash":"a7dd1eb4fbb2d8bdce6cded4fb99f59a","privatePeerContestIds":[],"enableTimeMachine":false,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}