binomialDist/binomial.cpp at master · bryanperez43/binomialDist · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <cmath>

using namespace std;


void factorial();


int main()
{
    int x;
    double factorialX = 1.0;

    cout << "Enter X: ";
    cin >> x;

    for(int i = 1; i <=x-1; ++i)
    {
        factorialX *= i;
    }

    int k;
    double factorialK = 1.0;

    cout << "Enter K: ";
    cin >> k;

    for(int i = 1; i <=k-1; ++i)
    {
        factorialK *= i;
    }

    double factorialDifference = 1.0;
    for(int i = 1; i <=x-k; ++i)
    {
        factorialDifference *= i;
    }


    double p=0;
    cout << "Enter P (in decimal form): ";
    cin >> p;

    double q=0;

    q = 1 - p;

    double divide=0.0;
    divide = (factorialX/(factorialK * factorialDifference));

	double solution=0.0;
	solution = divide * (pow(p,k) * pow(q,x-k));

	cout << "Your Solution is " << solution << endl;


    return 0;
}