1 #include 2 #include 3 using namespace std

1 #include 2 #include 3 using namespace std

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
#include <iostream>
#include <cmath>
using namespace std;
long factorial (long a)
{
if (a > 1)
return (a * factorial (a-1));
else return (1);
}
int main ()
{
long n;
cout << "Entrer le nombre n : ";
cin >> n;
long k;
cout << "Entrer le nombre k : ";
cin >> k;
double b(0);
b=factorial (n)/(factorial (k)*factorial (n-k));
double p(0);
double c(0),r(0),h(0);
cout << "Entrer le nombre p : ";
cin >> p;
c=(1-p);
r=n-k;
h=k;
double d (pow(c,r));
double y (pow(p,h));
cout << "La loi de Bernoulli vaut : " << b*d*y;
return 0;
}