随笔分类 - 高斯消元
摘要:HIGH - Highways no tags no tags In some countries building highways takes a lot of time... Maybe that's because there are many possiblities to constru
阅读全文
摘要:给你一幅N*M的地图,地图中有不能到达的障碍物'#'与可以走的点'.',从(1,1)开始走到(N,M),其中每一次走动均等概率地向周围的可达的格子走去,求到达(N,M)的期望步数。(N,M<=10) 一开始根本不知道这题居然是用高斯消元来做的,感觉非常神奇,高斯消元作用就是你自己列出一系列关于期望的
阅读全文
摘要:Lanterns Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1945 Accepted Submission(s): 767 Proble
阅读全文
摘要:开关问题 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8714 Accepted: 3424 Description 有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关
阅读全文
摘要:Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 45691 Accepted: 19590 Description Flip game is played on a rectangular 4x4 field
阅读全文
摘要:EXTENDED LIGHTS OUT Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10835 Accepted: 6929 Description In an extended version of the game Lig
阅读全文