Coin Test
来源:互联网 发布:影视后期剪辑软件 编辑:程序博客网 时间:2024/06/10 02:18
Coin Test
- 描述
As is known to all,if you throw a coin up and let it droped on the desk there are usually three results. Yes,just believe what I say ~it can be the right side or the other side or standing on the desk, If you don't believe this,just try In the past there were some famous mathematicians working on this .They repeat the throwing job once again. But jacmy is a lazy boy.He is busy with dating or playing games.He have no time to throw a single coin for 100000 times. Here comes his idea,He just go bank and exchange thousands of dollars into coins and then throw then on the desk only once. The only job left for him is to count the number of coins with three conditions.
He will show you the coins on the desk to you one by one. Please tell him the possiblility of the coin on the right side as a fractional number if the possiblity between the result and 0.5 is no larger than 0.003. BE CAREFUL that even 1/2,50/100,33/66 are equal only 1/2 is accepted ! if the difference between the result and 0.5 is larger than 0.003,Please tell him "Fail".Or if you see one coin standing on the desk,just say "Bingo" any way.
- 输入
- Three will be two line as input.
The first line is a number N(1<N<65536)
telling you the number of coins on the desk.
The second line is the result with N litters.The letter are "U","D",or "S","U" means the coin is on the right side. "D" means the coin is on the other side ."S" means standing on the desk. - 输出
- If test successeded,just output the possibility of the coin on the right side.If the test failed please output "Fail",If there is one or more"S",please output "Bingo"
- 样例输入
6UUUDDD
- 样例输出
1/2
- 来源
- 郑州大学校赛题目
- 上传者
张云聪
思路 :如果实验成功,则用最简分数表示概率,所以要把分数约分,gcd应用
代码
#include<stdio.h>
#include<math.h>
int gcd(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n;
scanf("%d",&n);
getchar();
char s;int num=0;
for(int i=0;i<n;i++)
{
s=getchar();
if(s=='S')
{
printf("Bingo");
break;
}
if(s=='U') num++;
}
int c=gcd(n,num);
if(fabs(1.0*num/n-0.5)<=0.003) //
printf("%d/%d",num/c,n/c);
else
printf("Fail");
return 0;
}
- Coin Test
- Coin Test
- Coin test
- Coin Test
- coin test
- Coin Test
- Coin Test
- Coin Test
- Coin Test
- Coin Test
- Coin Test
- NYOJ - Coin Test
- nyoj-204Coin Test
- nyoj 204-Coin Test
- NYOJ 204 Coin Test
- nyoj-204Coin Test
- 204 Coin Test
- nyoj 204 Coin Test
- Redis 待续
- MySQL 中NULL和空值的区别
- Fragment碎片化的使用
- java中的堆、栈和常量池
- 10.MATLAB方差分析
- Coin Test
- 26、C++在 cmd 中给编译过的 mian 函数的可执行文件传入参数
- 使用javadoc工具生成API文档
- 倒直角
- c++primer读书笔记(6)
- Linux学习之:tmpfs简介及增加方式
- 【CodeForces 777D】Cloud of Hashtags (模拟+字符串处理)
- Makefile
- centos7 minimal安装tensorflow