Задача "игла Бюффона на Си"

#include <stdio.h>
#include <omp.h>
#include<conio.h>
#include<stdlib.h>
#include<time.h>
#include<math.h>
#include<iostream>
 
int main()
{
    int a,l,n,m;
double p,val,pi,x,fi,eps;
double mp;
x=1;
l=1;
srand(time(NULL));
pi = 4 * ((double)atan(1.0));
for(int i = 0; i < 10; ++i)
{
mp = (double)(rand()%22)/7;
printf("%f \n",mp);
}
eps=0.01;a=1;l=1;
printf("dsds \n");
do
{
fi=(double)(rand()%22)/7;
n=n+1;
if (x<=l*sin(fi))
{
m=m+1;
p=(2*n/m);
}
printf("steps %d pi: %e \n",m,p);
}
while(fabs(p-pi)<eps);
 
 
getche();
}

const double      Pi = 3.14159265358979323846;

do
{
    k = (double)rand()/(RAND_MAX)*360;       // random angle
 
    x = (double)rand()/(RAND_MAX*2);         // random x (0 do 1)
n++;
if (x<=(l) * sin (k))
{
m++;
}
p=(2*n/m);
}
while(fabs(p-pi)<eps); 
printf("steps %d pi: %f \n",n,p);
printf("x: %f k: %f\n",x,k);

// FRAND.C - Public domain by Larry Hudson
 
#define TEN_PI    (31.41592653589793)
#define E         (2.718281828459045)
 
// Return random double between 0.0 and 1.0
// If n is negative it will randomize the seed, based on the
// current MSDOS time.
// If n is zero it will return the next random number.
// If n is positive it will set the seed to a value based on
// the value of n.
 
double FRrandom(int iNum)
{
   static double  fSeed = E;
 
   double   fDummy;
   time_t   TTime;
 
   if (iNum < 0)
   {
      time(&TTime);
 
      fSeed = (double)TTime;
   }
   else if (iNum > 0)
   {
      fSeed = (double)iNum * E;
   }
 
   fSeed = modf(fSeed * TEN_PI + E,&fDummy);
   
   return fSeed;
}