Probability of getting a sum on throwing 2 Dices N times in C++

We are given with the sum and the number of times the pair of dice is thrown as an input and the task is to determine the probability of getting the given sum on throwing a pair of dice N times.

Probability is the chances of getting the desired output from the set of data available. The range of probability lie between 0 and 1 where an integer 0 shows the chances of impossibility and 1 indicates certainty.

Example

Input-: sum = 12, N = 1
Output-: Probability = 1/36
Explanation-: if a pair of dice is thrown once then the combinations will be
(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 1), (2, 2), (2, 3), (2, 4),
(2, 5), (2, 6), (3, 1), (3, 2), (3, 3), (3, 4), (3, 5), (3, 6), (4, 1), (4, 2),
(4, 3), (4, 4), (4, 5), (4, 6), (5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6),
(6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6). Out of these combinations we can
get sum 12 at pair (6, 6) only therefore probability would be 1/36

Input-: sum = 4 and N = 6
Output-: probability is : 1/2985984

Approach used in the below program is as follows −

• Input the value of sum and N which indicates the number of times the dice is thrown
• For calculating the probability of occurring sum on throwing 2 dices N times apply this formula : (favorable/total) ^ N
• Now calculate the probability of occurring that sum on thrown of 2 dice 1 times which will be let’s sa 1
• for calculating the Probability of occurring that sum on thrown of 2 dice N times it will be −
• Probability2 = (Probability 1) ^ N. i.e Probability1 raise to power N

Algorithm

Start
Step 1-> declare function to calculate the probability
   int probability(int sum, int times)
   Declare and set float res = 0.0 and total = 36.0
   Declare and set long int probab = 0
   Loop For i = 1 and i <= 6 and i++
      Loop For j = 1 and j <= 6 and j++
         IF ((i + j) = sum)
            Set res++
         End
      End
   End
   Declare and set int gcd1 = __gcd((int)res, (int)total)
   Declare and set res = res / (float)gcd1
   Set total = total / (float)gcd1
   Set probab = pow(total, times)
   return probab
Step 2-> In main()
   Declare and set int sum = 4 and times = 6
   Call probability(sum, times)  
Stop

Example

 Live Demo

#include <bits/stdc++.h>
using namespace std;
// function that calculates the Probability of getting a sum on throwing 2 Dices N times
int probability(int sum, int times) {
   float res = 0.0, total = 36.0;
   long int probab = 0;
   for (int i = 1; i <= 6; i++) {
      for (int j = 1; j <= 6; j++) {
         if ((i + j) == sum)
         res++;
      }
   }
   int gcd1 = __gcd((int)res, (int)total);
   res = res / (float)gcd1;
   total = total / (float)gcd1;
   probab = pow(total, times);
   return probab;
}
int main() {
   int sum = 4, times = 6;
   cout<<"probability is : ";
   cout << "1" << "/" << probability(sum, times);
   return 0;
}

Output

probability is : 1/2985984

Sunidhi Bansal

Published on 23-Dec-2019 07:17:58

• Related Questions & Answers
• Maximum number of dots after throwing a dice N times in C++
• Probability of rain on N+1th day in C++
• How to create sample space of throwing two dices in R?
• Probability of getting at least K heads in N tosses of Coins in C++
• Sum of the series 2^0 + 2^1 + 2^2 +...+ 2^n in C++
• Sum of series 1^2 + 3^2 + 5^2 + . . . + (2*n - 1)^2 in C++
• Count pairs (a, b) whose sum of squares is N (a^2 + b^2 = N) in C++
• Sum of the digits of a number N written in all bases from 2 to N/2 in C++
• Sum of the series 1^1 + 2^2 + 3^3 + ... + n^n using recursion in C++
• Minimize the sum of squares of sum of N/2 paired formed by N numbers in C++
• Sum of the series 1.2.3 + 2.3.+ … + n(n+1)(n+2) in C
• Sum of series 1^2 + 3^2 + 5^2 + . . . + (2*n – 1)^2
• Probability of getting more value in third dice throw in C++
• C/C++ Program to Find sum of Series with n-th term as n power of 2 - (n-1) power of 2
• Program to find sum of series 1*2*3 + 2*3*4+ 3*4*5 + . . . + n*(n+1)*(n+2) in C++