Created
January 27, 2018 01:47
-
-
Save Toru3/7c2fbb64b5a46d5e87273696c5d2e594 to your computer and use it in GitHub Desktop.
calc pi from gcd
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//gcc pi_gcd.c -O3 -march=native -lm -fopenmp | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <math.h> | |
inline int ctz(long x){ | |
// GCCの組み込み関数 | |
return __builtin_ctzl(x); | |
} | |
inline int min(int a, int b){ | |
return a<b ? a : b; | |
} | |
long gcd(long a, long b){ | |
if(a==0) return b; | |
if(b==0) return a; | |
a = labs(a); | |
b = labs(b); | |
int ta = ctz(a); | |
int tb = ctz(b); | |
int shift = min(ta,tb); | |
a >>= ta; | |
b >>= tb; | |
if(a<b){ | |
long t=a; | |
a=b; | |
b=t; | |
} | |
do{ | |
a-=b; | |
a >>= ctz(a); | |
if(a<b){ | |
long t=a; | |
a=b; | |
b=t; | |
} | |
}while(b!=0); | |
return a << shift; | |
} | |
double pi_gcd(long n){ | |
long count=0; | |
#pragma omp parallel for reduction(+:count) collapse(2) | |
for(long i=1; i<=n; i++){ | |
for(long j=1; j<=n; j++){ | |
if(gcd(i,j)==1){ | |
count++; | |
} | |
} | |
} | |
return sqrt(6.0*n*n/count); | |
} | |
int main(int argc, const char* argv[]){ | |
long n=20000; | |
if(argc>=2){ | |
n=atol(argv[1]); | |
} | |
printf("%.15f\n", pi_gcd(n)); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment