F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
 Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

正品的概率

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1    Accepted Submission(s): 1


Problem Description
袋中有m枚正品硬币，n枚次品硬币（次品硬币两面都有国徽），在袋中任取一枚，将它投掷k次，已知每次得到的都是国徽，那么这枚硬币是正品的概率是多少？
 

Input
输入包含多组数据，每组占一行包含3个正整m,n,k (1<=m,n,k<=50)。
 

Output
每组输出一行，包含一个最简分数，硬币为正品的概率。
 

Sample Input
1 1 1
 

Sample Output
1/3
 

Source
计算机学院大学生程序设计竞赛（2017新生赛）
 

Statistic | Submit | Discuss | Note
Home | Top Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.001000(s) query 1, Server time : 2025-03-29 19:49:10, Gzip enabled 		Administration