摘要:Rikka with Parenthesis II Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math ta 阅读全文
posted @ 2016-08-13 09:53 MartinEden 阅读 (64) 评论 (0) 编辑
摘要:Ball Description ZZX has a sequence of boxes numbered 1,2,...,n. Each box can contain at most one ball. You are given the initial configuration of the 阅读全文
posted @ 2016-08-13 09:47 MartinEden 阅读 (72) 评论 (0) 编辑
摘要:题意是一个人做ACM题,这道题的数据的字节数和提问数已经给出,答案只有YES或NO。那个人做不来这道题,只能蒙,一开始一定蒙YES,数据会告诉你蒙对了没有,之后蒙的都是之前的正确答案,求蒙错的数据组数的期望数量。 因为字节数和提问数已经给出,所以立方程组可以算出来YES和NO的个数,设为X,Y。题目 阅读全文
posted @ 2016-08-07 17:04 MartinEden 阅读 (541) 评论 (0) 编辑
摘要:题意是给出一个有n面的色子,求要看见所有面所投掷的期望次数。 设F(i)为看见i面的期望值。 F(i) = F(i - 1) * ((i - 1) / n) + 1 + F(i) * ((n - (i - 1)) / n)。 解得F(i) = F(i - 1) + (n / (i - 1))。 阅读全文
posted @ 2016-08-07 16:43 MartinEden 阅读 (237) 评论 (1) 编辑
摘要:题意是给出一个由边长为1的立方体组成的长方体,每个小立方体中有一盏灯,每次操作随机选择两个立方体,以这两个立方体作为对角线顶点确定一个长方体,长方体中所有块的灯自己取反,就是亮着的关上,暗着的打开,求这样操作k次以后亮着的灯数的期望值。 设F(i)为操作i次以后对某灯奇数次取反的概率,G(i)为偶数 阅读全文
posted @ 2016-08-07 16:17 MartinEden 阅读 (80) 评论 (0) 编辑
摘要:NanoApe Loves Sequence Ⅱ Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 500 Accepted Submissio 阅读全文
posted @ 2016-08-07 10:54 MartinEden 阅读 (181) 评论 (0) 编辑
摘要:A Simple Nim Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 33 Accepted Submission(s): 18 Proble 阅读全文
posted @ 2016-08-04 17:46 MartinEden 阅读 (353) 评论 (0) 编辑
摘要:K-wolf Number Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 737 Accepted Submission(s): 265 Pro 阅读全文
posted @ 2016-08-04 10:08 MartinEden 阅读 (36) 评论 (0) 编辑
摘要:World is Exploding Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 540 Accepted Submission(s): 24 阅读全文
posted @ 2016-08-03 15:12 MartinEden 阅读 (38) 评论 (0) 编辑
摘要:Two Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 21 Accepted Submission(s): 10 Problem Descrip 阅读全文
posted @ 2016-08-02 17:23 MartinEden 阅读 (219) 评论 (0) 编辑