diff options
| author | Syndamia <kamen.d.mladenov@protonmail.com> | 2021-09-15 15:53:59 +0300 |
|---|---|---|
| committer | Syndamia <kamen.d.mladenov@protonmail.com> | 2021-09-15 15:53:59 +0300 |
| commit | 4b88d354f628182beeb25ad76f57e8a616ff30c1 (patch) | |
| tree | f9419e4c72ecd2ffbf41c743031bc7e9cc4e2840 /C_C++/LeibnizPI.cpp | |
| parent | 65c04eaad8fbcce98c3c11054ee52b5277c82402 (diff) | |
| download | algorithms-4b88d354f628182beeb25ad76f57e8a616ff30c1.tar algorithms-4b88d354f628182beeb25ad76f57e8a616ff30c1.tar.gz algorithms-4b88d354f628182beeb25ad76f57e8a616ff30c1.zip | |
Renamed C++ folder to accomodate C files
Diffstat (limited to 'C_C++/LeibnizPI.cpp')
| -rw-r--r-- | C_C++/LeibnizPI.cpp | 26 |
1 files changed, 26 insertions, 0 deletions
diff --git a/C_C++/LeibnizPI.cpp b/C_C++/LeibnizPI.cpp new file mode 100644 index 0000000..2243f61 --- /dev/null +++ b/C_C++/LeibnizPI.cpp @@ -0,0 +1,26 @@ +#include <iostream> + +using namespace std; + +int main() +{ + cout << "n = "; + unsigned int n = 1; + cin >> n; + long double pid4 = 1; + + for(unsigned int i = 0, dvsr = 3; i < n; i++, dvsr += 2) { + pid4 += ((i % 2) ? 1.0 : -1.0) / dvsr; + } + + cout.precision(64); + cout << endl << pid4 * 4.0 << endl; + + return 0; +} + +/* This is a quick implementation of of the Leibniz formula for PI + * https://en.wikipedia.org/wiki/Leibniz_formula_for_%CF%80 + * + * Fun fact: you need around 100 million iterations for 7 correct decimal places + */ |
