#include <stdio.h>
#include <omp.h>
#include <malloc.h>
#define N 10

int factorial(int x)
 {
  if (x == 0) return(1);
  return(x * factorial(x-1));
 }

void main(int argc, char **argv )
 {
  int i,j;
  int *a,*d;
  double *b,*c;

  a = malloc(N * sizeof(int));
  b = malloc(N * sizeof(double));
  c = malloc(N * sizeof(double));
  d = malloc(N * sizeof(int));

  for(i=1;i<=N;i++) { a[i-1] = factorial(i); d[i-1] = factorial(i); }

  #pragma omp parallel
   {
    #pragma omp for nowait
    for(i=1; i<N; i++)
     b[i] = (double)(a[i] + a[i-1])/2.0;
    #pragma omp for nowait
    for(i=0; i<N; i++)
     c[i] = sqrt((double)d[i]);
   }

 for(i=0;i<N;i++)
  printf("a[%d]=%d b[%d]=%0.3f c[%d]=%0.3f d[%d]=%d\n",i,a[i],i,b[i],i,c[i],i,d[i]);

 }