CF540D.Bad Luck Island

普及+/提高

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

The Bad Luck Island is inhabited by three kinds of species: r rocks, s scissors and p papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and if they belong to different species, then one individual kills the other one: a rock kills scissors, scissors kill paper, and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.

倒霉岛上有三种生物:rr 个石头、ss 个剪刀和 pp 个布。在某些时刻,两个随机个体相遇(所有个体对相遇的概率均等);若它们属于不同物种,则其中一个会杀死另一个:石头杀死剪刀,剪刀杀死布,布杀死石头。你的任务是:对每一种物种,求出经过足够长的时间后,该物种成为岛上唯一幸存物种的概率。

输入格式

The single line contains three integers r, s and p (1 ≤ r, s, p ≤ 100) — the original number of individuals in the species of rock, scissors and paper, respectively.

单行包含三个整数 rr、ss 和 pp(1 ≤ r, s, p ≤ 1001 ≤ r, s, p ≤ 100),分别表示石头、剪刀和布三种生物的初始个体数量。

输出格式

Print three space-separated real numbers: the probabilities, at which the rocks, the scissors and the paper will be the only surviving species, respectively. The answer will be considered correct if the relative or absolute error of each number doesn't exceed 10 - 9.

输出三个用空格分隔的实数:分别为石头、剪刀和布成为唯一幸存物种的概率。若每个数字的相对误差或绝对误差均不超过 10−910^{-9},则答案视为正确。

输入输出样例

  • 输入#1

    2 2 2

    输出#1

    0.333333333333 0.333333333333 0.333333333333
  • 输入#2

    2 1 2

    输出#2

    0.150000000000 0.300000000000 0.550000000000
  • 输入#3

    1 1 3

    输出#3

    0.057142857143 0.657142857143 0.285714285714

输入解题思路,AI测评打分。不知道怎么写?

首页