第三掷骰子获得更多价值的可能性

鉴于三个玩家在玩掷骰子游戏。玩家1掷出骰子得到A，而玩家2掷出骰子得到B。任务是确定玩家3赢得比赛的概率，如果玩家3获得大于两者的胜利，则获胜。

例子：

Input: A = 2, B = 3
Output: 1/2
Player3 wins if he gets 4 or 5 or 6

Input: A = 1, B = 2
Output: 2/3
Player3 wins if he gets 3 or 4 or 5 or 6 

方法：这个想法是找到A和B的最大值，然后6-max(A，B)给我们剩下的C数应该可以赢得比赛。因此，可以找到用这两个的GCD除以6-max(A，B)和6的答案。

C++

// CPP program to find probability to C win the match
#include 
using namespace std;
 
// function to find probability to C win the match
void Probability(int A, int B)
{
    int C = 6 - max(A, B);
 
    int gcd = __gcd(C, 6);
 
    cout << C / gcd << "/" << 6 / gcd;
}
 
// Driver code
int main()
{
    int A = 2, B = 4;
 
    // function call
    Probability(A, B);
 
    return 0;
}

Java

//  Java program to find probability to C win the match
 
import java.io.*;
 
class GFG {// Recursive function to return gcd of a and b
    static int __gcd(int a, int b)
    {
        // Everything divides 0 
        if (a == 0)
          return b;
        if (b == 0)
          return a;
        
        // base case
        if (a == b)
            return a;
        
        // a is greater
        if (a > b)
            return __gcd(a-b, b);
        return __gcd(a, b-a);
    }
     
   
// function to find probability to C win the match
static void Probability(int A, int B)
{
    int C = 6 - Math.max(A, B);
 
    int gcd = __gcd(C, 6);
 
    System.out.print( C / gcd + "/" + 6 / gcd);
}
 
// Driver code
 
    public static void main (String[] args) {
    int A = 2, B = 4;
 
    // function call
    Probability(A, B);
    }
}
// This code is contributed by shs..

Python 3

# Python 3 program to find probability
# to C win the match
 
# import gcd() from math lib.
from math import gcd
 
# function to find probability
# to C win the match
def Probability(A, B) :
    C = 6 - max(A, B)
     
    __gcd = gcd(C, 6)
     
    print(C // __gcd, "/", 6 // __gcd)
 
# Driver Code
if __name__ == "__main__" :
     
    A, B = 2, 4
 
    # function call
    Probability(A, B)
     
# This code is contributed by ANKITRAI1

C#

// C# program to find probability
// to C win the match
using System;
 
class GFG
{
     
// Recursive function to return
// gcd of a and b
static int __gcd(int a, int b)
{
    // Everything divides 0
    if (a == 0)
        return b;
    if (b == 0)
        return a;
     
    // base case
    if (a == b)
        return a;
     
    // a is greater
    if (a > b)
        return __gcd(a - b, b);
    return __gcd(a, b - a);
}
 
// function to find probability
// to C win the match
static void Probability(int A, int B)
{
    int C = 6 - Math.Max(A, B);
 
    int gcd = __gcd(C, 6);
 
    Console.Write(C / gcd + "/" + 6 / gcd);
}
 
// Driver code
static public void Main ()
{
    int A = 2, B = 4;
     
    // function call
    Probability(A, B);
}
}
 
// This code is contributed by ajit.

Javascript

    // Javascript program to find probability
    // to C win the match
     
    // Recursive function to return
    // gcd of a and b
    function __gcd(a, b)
    {
        // Everything divides 0
        if (a == 0)
            return b;
        if (b == 0)
            return a;
 
        // base case
        if (a == b)
            return a;
 
        // a is greater
        if (a > b)
            return __gcd(a - b, b);
        return __gcd(a, b - a);
    }
 
    // function to find probability
    // to C win the match
    function Probability(A, B)
    {
        let C = 6 - Math.max(A, B);
 
        let gcd = __gcd(C, 6);
 
        document.write(parseInt(C / gcd, 10) + "/" + parseInt(6 / gcd, 10));
    }
     
    let A = 2, B = 4;
       
    // function call
    Probability(A, B);
         

输出：

1/3

如果您希望与行业专家一起参加现场课程，请参阅《 Geeks现场课程》和《 Geeks现场课程美国》。