- 博客(7)
- 收藏
- 关注
原创 codeforces 779 E. Bitwise Formula
E. Bitwise Formulatime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputBob recently read about bitwise operatio
2017-02-27 10:17:24 631
原创 codeforces 779 D. String Game
D. String Gametime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputLittle Nastya has a hobby, she likes to remo
2017-02-27 10:13:43 419
原创 codeforces 779 C. Dishonest Sellers
C. Dishonest Sellerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIgor found out discounts in a shop and
2017-02-27 08:47:50 291
原创 codeforces 779B Weird Rounding
B. Weird Roundingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp is crazy about round numbers. He
2017-02-27 08:43:41 361
原创 bzoj1385: [Baltic2000]Division expression
1385: [Baltic2000]Division expressionTime Limit: 5 Sec Memory Limit: 64 MBSubmit: 255 Solved: 185[Submit][Status][Discuss]Description除法表达式有如下的形式: X1/X2/X3.../Xk 其中Xi是正整数且XiInput先给出
2017-02-22 20:57:03 400
原创 UVALive - 7527 Funfair (动态规划)
题目链接:uva live 或 vjudge题目大意: 给出n场比赛,其中第i场获胜的概率是 pi,获胜所得金钱为Ai,失败损失当前已拥有的金钱的Li/100最初有x0的金钱,现在要在n场比赛中选择k场比赛,求问如何选择比赛及安排比赛顺序使得最终剩余的期望金钱最多。 题目分析: 两个问题: 1.选择比赛 2.安排比赛顺序艾神一说推公式
2017-02-17 20:22:18 603
原创 poj3233Matrix Power Series (等比矩阵求和)
对于整数的等比数列求和,有:设S[n]=a+a^2+a^3+...a^n(n==0)S[n]=1(n为偶数)S[n]=( a^(n/2)+1 )*S[n/2](n为奇数)S[n]=( a^(n/2+1) )*S[n/2]+( a^(n/2+1) )类比上式,对于等比矩阵:设S[n]=A+A^2+A^3+...A^n,I为单位矩阵(n==0)S[n]=In
2017-02-16 11:20:36 790
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人