关闭

2017 ACM-ICPC 亚洲区(西安赛区)网络赛 F.Trig Function(论文+组合数)

传送门 f(cos(x))=cos(n∗x)f(cos(x)) = cos(n*x) holds for all xx.Given two integers nn and mm, you need to calculate the coefficient of xmx^m in f(x)f(x), modulo 998244353998244353.Input FormatMultiple te...
阅读(569) 评论(0)

2017 ACM-ICPC 亚洲区(西安赛区)网络赛 B.Coin(基本概率+二项式展开)

传送门 Bob has a not even coin, every time he tosses the coin, the probability that the coin’s front face up is qp(qp≤12)\frac{q}{p}(\frac{q}{p} \le \frac{1}{2}).The question is, when Bob tosses the coi...
阅读(222) 评论(0)

HDU 4336 Card Collector(状态压缩+概率DP)

传送门In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin, you will win an ama...
阅读(380) 评论(0)

ZOJ 3380 Patchouli's Spell Cards(概率DP)

传送门 Patchouli Knowledge, the unmoving great library, is a magician who has settled down in the Scarlet Devil Mansion (紅魔館). Her specialty is elemental magic employing the seven elements fire, water...
阅读(232) 评论(0)

Codeforces 148D. Bag of mice(概率DP)

传送门The dragon and the princess are arguing about what to do on the New Year’s Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they...
阅读(163) 评论(0)

POJ 2151 Check the difficulty of problems(概率DP)

传送门 Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms: 1. All of the te...
阅读(294) 评论(0)

ZOJ 3329 One Person Game——(概率DP+待定系数求解方程)

传送门 There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces. Die2 has K2 faces. Die3 has K3 faces. All the dice are fair dice, so...
阅读(354) 评论(0)
    个人资料
    • 访问:467097次
    • 积分:10891
    • 等级:
    • 排名:第1623名
    • 原创:634篇
    • 转载:5篇
    • 译文:0篇
    • 评论:93条
    博客专栏