#include <iostream>
#include <iomanip>
#include <random>
#include <cmath>
using namespace std;
// Funkcja podcałkowa: 4 / (1 + x^2)
long double f(long double x) {
return 4.0L / (1.0L + x * x);
}
int main() {
long long n;
cout << "Podaj liczbe n: ";
cin >> n;
// ==========================
// 1. METODA MONTE CARLO
// ==========================
random_device rd;
mt19937_64 gen(rd());
uniform_real_distribution<long double> dist(-1.0L, 1.0L);
long long inside = 0;
for (long long i = 0; i < n; ++i) {
long double x = dist(gen);
long double y = dist(gen);
if (x * x + y * y <= 1.0L)
inside++;
}
long double pi_monte_carlo = 4.0L * inside / n;
// ==========================
// 2. METODA PROSTOKĄTÓW
// ==========================
long double h = 1.0L / n;
long double sum_rect = 0.0L;
for (long long i = 0; i < n; ++i) {
long double x = i * h;
sum_rect += f(x);
}
long double pi_rect = h * sum_rect;
// ==========================
// 3. METODA TRAPEZÓW
// ==========================
long double sum_trap = (f(0.0L) + f(1.0L)) / 2.0L;
for (long long i = 1; i < n; ++i) {
long double x = i * h;
sum_trap += f(x);
}
long double pi_trap = h * sum_trap;
// ==========================
// WYNIKI
// ==========================
cout << fixed << setprecision(20);
cout << "\nPrzyblizenie liczby pi:\n";
cout << "Monte Carlo : " << pi_monte_carlo << endl;
cout << "Prostokaty : " << pi_rect << endl;
cout << "Trapezy : " << pi_trap << endl;
return 0;
}