Przejdź do treści

Metoda Monte Carlo

Opis problemu

Implementacja

 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
#include <iostream>
#include <random>
#include <ctime>

using namespace std;

double monteCarloPi(int pointsCount) {
    int numPointsInCircle = 0;
    double centerX = 1;
    double centerY = 1;
    double radius = 1;
    double x, y, distance;

    for (int i = 0; i < pointsCount; i++) {
        x = (double) rand() / RAND_MAX * 2.0;
        y = (double) rand() / RAND_MAX * 2.0;
        distance = ((x - centerX) * (x - centerX)) + ((y - centerY) * (y - centerY));

        if (distance <= radius * radius) {
            numPointsInCircle += 1;
        }
    }

    return (4.0 * numPointsInCircle) / (double) pointsCount;
}

int main() {
    srand(time(NULL));

    int pointsCount = 10000;

    double estimatedPi = monteCarloPi(pointsCount);

    cout << "PI ~= " << estimatedPi << endl;

    return 0;
}