Polycarp has n dice d1,?d2,?...,?dn.
The i-th dice shows numbers from 1 to di.
Polycarp rolled all the dice and the sum of numbers they showed is A. Agrippina didn't see which dice showed what num...
分类：
其他好文 时间：
2015-04-18 20:37:46
阅读次数：
171
在每个位置讨论一下最大值最小值的取值范围就行 1 #include 2 #include 3 #define maxn 200003 4 using namespace std; 5 typedef long long LL; 6 LL a[maxn],b[maxn]; 7 8 int main(....
分类：
其他好文 时间：
2015-04-15 21:22:22
阅读次数：
129
Problem Description:
There is a dice with n sides, which are numbered from 1,2,...,n and have the equal possibility to show up when one rolls a dice. Each side has an integer ai on it. Now here is a ...
分类：
其他好文 时间：
2015-04-14 16:38:23
阅读次数：
121
题意：给你n个筛子，第 i 个筛子有 可以表示范围 1-a[i]的数，给你最后筛子和，问你每个筛子不可能的值有多少个。解题思路：得到每个筛子的取值范围。解题代码： 1 // File Name: c.cpp 2 // Author: darkdream 3 // Created Time: 2015...
分类：
其他好文 时间：
2015-04-13 20:29:45
阅读次数：
132
def score(dices_input): count = {}.fromkeys(range(1, 7), 0) points = 0 for dice_side in dices_input: count[dice_side] += 1 # print ...
分类：
其他好文 时间：
2015-03-31 19:27:20
阅读次数：
114
13907. Dice Game
Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
Gunnar and Emma play a lot of board games at home, so they own many dice that are not normal 6- side...
分类：
其他好文 时间：
2015-03-31 09:09:29
阅读次数：
169
1000. Dice Game
总提交数量：
100
通过数量：
59
时间限制：1秒 内存限制：256兆
题目描述
Gunnar and Emma play a lot of b...
分类：
其他好文 时间：
2015-03-30 09:35:56
阅读次数：
193
传送门TautologyTime Limit:1000MSMemory Limit:65536KTotal Submissions:10107Accepted:3850DescriptionWFF 'N PROOF is a logic game played with dice. Each die...
分类：
其他好文 时间：
2015-03-21 18:36:03
阅读次数：
182
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 the prob...
分类：
其他好文 时间：
2015-03-18 18:08:58
阅读次数：
159
DiceTime Limit:1000MS Memory Limit:65536KBDescriptionThere are 2 special dices on the table. On each face of the dice, a distinct number was written. ...
分类：
编程语言 时间：
2015-03-03 22:01:14
阅读次数：
196
