CodeForces 312B Archer

思路:列一下式子发现是一个等比数列求和,求一下就可以了


#include<bits\stdc++.h>
using namespace std;

int main()
{
     int a,b,c,d;
	 scanf("%d%d%d%d",&a,&b,&c,&d);
	 double p1 = (double)a/b;
	 double p2 = (double)c/d;
	 double ans = 0;
	 double p = 1;
	 for (int i = 0;i<10000;i++)
	 {
		 ans+=p*(1-p1)*p2;
		 p = p*(1-p1)*(1-p2);
	 }
	 printf("%.12lf\n",1-ans);
}


Description

SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The probability of shooting the target each time is  for SmallR while  for Zanoes. The one who shoots in the target first should be the winner.

Output the probability that SmallR will win the match.

Input

A single line contains four integers .

Output

Print a single real number, the probability that SmallR will win the match.

The answer will be considered correct if the absolute or relative error doesn't exceed 10 - 6.

Sample Input

Input
1 2 1 2
Output
0.666666666667


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值