Statistiques
| Révision :

root / Pi / C / Simple / Pi.c @ 125

Historique | Voir | Annoter | Télécharger (2,1 ko)

1 7 equemene
//
2 7 equemene
// Estimation of Pi using Monte Carlo exploration process
3 7 equemene
// gcc -std=c99 -O3 -o Pi Pi.c -lm
4 7 equemene
//
5 7 equemene
6 7 equemene
#include <math.h>
7 7 equemene
#include <stdio.h>
8 7 equemene
#include <stdlib.h>
9 30 equemene
#include <limits.h>
10 7 equemene
11 7 equemene
// Marsaglia RNG very simple implementation
12 7 equemene
#define znew  ((z=36969*(z&65535)+(z>>16))<<16)
13 7 equemene
#define wnew  ((w=18000*(w&65535)+(w>>16))&65535)
14 7 equemene
#define MWC   (znew+wnew)
15 7 equemene
#define SHR3  (jsr=(jsr=(jsr=jsr^(jsr<<17))^(jsr>>13))^(jsr<<5))
16 7 equemene
#define CONG  (jcong=69069*jcong+1234567)
17 7 equemene
#define KISS  ((MWC^CONG)+SHR3)
18 7 equemene
19 10 equemene
#define CONGfp CONG * 2.328306435454494e-10f
20 7 equemene
#define MWCfp MWC * 2.328306435454494e-10f
21 7 equemene
#define KISSfp KISS * 2.328306435454494e-10f
22 7 equemene
23 7 equemene
#define ITERATIONS 1000000000
24 7 equemene
25 7 equemene
#ifdef LONG
26 30 equemene
#define LENGTH long long
27 7 equemene
#else
28 30 equemene
#define LENGTH int
29 7 equemene
#endif
30 7 equemene
31 7 equemene
LENGTH MainLoopGlobal(LENGTH iterations,unsigned int seed_w,unsigned int seed_z)
32 7 equemene
{
33 7 equemene
   unsigned int z=seed_z;
34 7 equemene
   unsigned int w=seed_w;
35 7 equemene
36 30 equemene
   LENGTH total=0;
37 7 equemene
38 7 equemene
   for (LENGTH i=0;i<iterations;i++) {
39 7 equemene
40 7 equemene
      float x=MWCfp ;
41 7 equemene
      float y=MWCfp ;
42 7 equemene
43 7 equemene
      // Matching test
44 21 equemene
45 21 equemene
#ifdef IFSQRT
46 21 equemene
      if ( sqrt(x*x+y*y) < 1.0f ) {
47 21 equemene
        total+=1;
48 21 equemene
      }
49 21 equemene
#elif IFWOSQRT
50 21 equemene
      if ( (x*x+y*y) < 1.0f ) {
51 21 equemene
        total+=1;
52 21 equemene
      }
53 21 equemene
#else
54 7 equemene
      int inside=((x*x+y*y) < 1.0f) ? 1:0;
55 7 equemene
      total+=inside;
56 21 equemene
#endif
57 21 equemene
58 7 equemene
   }
59 7 equemene
60 7 equemene
   return(total);
61 7 equemene
62 7 equemene
}
63 7 equemene
64 7 equemene
int main(int argc, char *argv[]) {
65 7 equemene
66 7 equemene
  unsigned int seed_w=10,seed_z=10;
67 7 equemene
  LENGTH iterations=ITERATIONS;
68 7 equemene
69 7 equemene
  if (argc > 1) {
70 30 equemene
    iterations=(LENGTH)atoll(argv[1]);
71 7 equemene
  }
72 7 equemene
  else {
73 7 equemene
    printf("\n\tPi : Estimate Pi with Monte Carlo exploration\n\n\t\t#1 : number of iterations (default 1 billion)\n\n");
74 7 equemene
  }
75 7 equemene
76 30 equemene
  printf ("\n\tInformation about architecture:\n\n");
77 30 equemene
78 30 equemene
  printf ("\tSizeof int = %lld bytes.\n", (long long)sizeof(int));
79 30 equemene
  printf ("\tSizeof long = %lld bytes.\n", (long long)sizeof(long));
80 30 equemene
  printf ("\tSizeof long long = %lld bytes.\n\n", (long long)sizeof(long long));
81 30 equemene
82 30 equemene
  printf ("\tMax int = %u\n", INT_MAX);
83 30 equemene
  printf ("\tMax long = %ld\n", LONG_MAX);
84 30 equemene
  printf ("\tMax long long = %lld\n\n", LLONG_MAX);
85 30 equemene
86 7 equemene
  float pi=(float)MainLoopGlobal(iterations,seed_w,seed_z)/(float)iterations*4;
87 7 equemene
88 30 equemene
  printf("\tPi=%.40f\n\twith error %.40f\n\twith %lld iterations\n\n",pi,
89 30 equemene
         fabs(pi-4*atan(1))/pi,(long long)iterations);
90 7 equemene
91 7 equemene
}