2 shunfurh shunfurh 于 2017.01.02 00:04 提问

Rock-Paper-Scissors Tournament
as

Description

Rock-Paper-Scissors is game for two players, A and B, who each choose, independently of the other, one of rock, paper, or scissors. A player chosing paper wins over a player chosing rock; a player chosing scissors wins over a player chosing paper; a player chosing rock wins over a player chosing scissors. A player chosing the same thing as the other player neither wins nor loses.
A tournament has been organized in which each of n players plays k rock-scissors-paper games with each of the other players - k*n*(n-1)/2 games in total. Your job is to compute the win average for each player, defined as w / (w + l) where w is the number of games won, and l is the number of games lost, by the player.
Input

Input consists of several test cases. The first line of input for each case contains 1 <= n <= 100 1 <= k <= 100 as defined above. For each game, a line follows containing p1, m1, p2, m2. 1 <= p1 <= n and 1 <= p2 <= n are distinct integers identifying two players; m1 and m2 are their respective moves ("rock", "scissors", or "paper"). A line containing 0 follows the last test case.
Output

Output one line each for player 1, player 2, and so on, through player n, giving the player's win average rounded to three decimal places. If the win average is undefined, output "-". Output an empty line between cases.
Sample Input

2 4
1 rock 2 paper
1 scissors 2 paper
1 rock 2 rock
2 rock 1 scissors
2 1
1 rock 2 paper
0
Sample Output

0.333
0.667

0.000
1.000

1个回答

caozhy
caozhy   Ds   Rxr 2017.01.02 00:05
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
HDU 1148 Rock-Paper-Scissors Tournament
Rock-Paper-Scissors Tournament Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 962    Accepted Submission(s): 305 Problem Description
HDU:1148 Rock-Paper-Scissors Tournament
Rock-Paper-Scissors Tournament Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2135    Accepted Submission(s): 672 Problem Description
poj 2654 Rock-Paper-Scissors Tournament
题目来源:http://poj.org/problem?id=2654 #include #include #include using namespace std; const int MAXN = 210; int main() { char m1[10], m2[10]; int iWin[MAXN], iLose[MAXN], p1, p2, i, n, m,
hdu 1148 Rock-Paper-Scissors Tournament
题目地址: http://acm.hdu.edu.cn/showproblem.php?pid=1148 题目描述:
HDU1148 Rock-Paper-Scissors Tournament
Rock-Paper-Scissors Tournament                                                       Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)                          
HDU 6088 Rikka with Rock-paper-scissors(莫比乌斯反演+组合数学+FFT)
Description两个人玩儿n局石头剪刀布,每局每个人出石头剪刀布的概率相同,玩nn局后假设第一个人赢aa局,第二个人赢bb局,那么得分就是gcd(a,b)gcd(a,b),设得分的期望为ss,求s×22ns\times 2^{2n},结果模modmodInput第一行一整数TT表示用例组数,每组用例输入两个整数nn和modmod表示游戏局数和模数(1≤T≤20,1≤n≤105,108≤mod≤
POJ 2654 Rock-Paper-Scissors Tournament(水~)
Description 有n个人玩儿k局剪刀石头布,给出每局两个人出的是什么,问每个人的胜率 Input 多组用例,每组用例第一行为两个整数n和k分别表示游戏人数和游戏局数,之后k行每行输入对局两人的动作(paper布,rock石头,scissors剪刀),以0结束输入 Output 对于每组用例,输出n个人的胜率,如果胜率不确定则输出’-‘,相邻两组用例用一空行隔开 Sample In
hdoj 1148 Rock-Paper-Scissors Tournament(模拟题)
思路:注意是两个测试输出之间有空行,而不是每测试后加一个空行,还有当w=l=0时会输出“-”; 代码如下: #include #include #include #include #include #include #include using namespace std; struct { int win; int lost; }p[110]; int main()
K - Yet Another Story of Rock-paper-scissors
Description Akihisa and Hideyoshi were lovers. They were sentenced to death by the FFF Inquisition. Ryou, the leader of the FFF Inquisition, promised that the winner of Rock-paper-scissors would be
Archery Tournament
题意:有n次操作,每次输入三个数x,y,z,若x为1,表示以(y,z)为圆心画一个与x轴相切的圆(保证画出来的圆一定不相交),若x为0,则问(y,z)这个点在哪个圆上,若不在任何圆上,输出-1;若在某个圆上,输出是第几次操作画的圆,并将圆删去 解题思路:线段树+set,因为圆都是不相交的,并且圆心都是整数,所以圆不会很多 #include #include #include #i