hdu 5194

DZY Loves Balls

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 400    Accepted Submission(s): 224

Problem Description

There are  n  black balls and  m  white balls in the big box.

Now, DZY starts to randomly pick out the balls one by one. It forms a sequence  S . If at the  i -th operation, DZY takes out the black ball,  Si=1 , otherwise  Si=0 .

DZY wants to know the expected times that '01' occurs in  S .

 

Input

The input consists several test cases. ( TestCase≤150 )

The first line contains two integers,  n ,  m(1≤n,m≤12)

 

Output

For each case, output the corresponding result, the format is  p/q ( p  and  q  are coprime)

 

Sample Input

  
  

   
   1 1
2 3
  
  

 

Sample Output

  
  

   
   1/2
6/5
  
  
  
  


  
  
  
  

   
   分析：（1）可以dfs枚举出所有情况
  
  
  
  

   
   （2）也可以从期望的性质来考虑，期望的可加性
  
  
  
  

   
   
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
using namespace std;
int n,m;

int gcd(int a,int b)
{
   return b?gcd(b,a%b):a;
}

int main()
{
    while(cin>>n>>m)
    {
       int GCD=gcd(m*n,(n+m));
       printf("%d/%d\n",m*n/GCD,(n+m)/GCD);

    }
    return 0;
}