anchor.diff:      T(0:n+1 , n+1)   = 1.0D0
       T(n+1   , 0:n+1) = 2.0D0
   
  -    quote = n/nr_threads
  +    ratio = n/nr_threads
   
       do i=0,nr_threads-2
  -        start_it(i) = (i*quote)+1
  -        stop_it(i) = (i+1)*quote
  +        start_it(i) = (i*ratio)+1
  +        stop_it(i) = (i+1)*ratio
       end do
  -    start_it(nr_threads-1) = ((nr_threads-1)*quote)+1
  +    start_it(nr_threads-1) = ((nr_threads-1)*ratio)+1
       stop_it(nr_threads-1) = n
   
       call omp_set_num_threads(nr_threads)
  
positive.code:     ! Uncomment the next part if you want to write the whole solution
      ! to a file. Useful for plotting.
  
      open(unit=7,action='write',file='result.dat',status='unknown')
      write(unit=str,fmt='(a,i6,a)') '(',N,'F10.6)'
      do i=0,n+1
        write (unit=7,fmt=str) T(i,0:n+1)
      end do
      close(unit=7)
  
  end program laplsolv
  
negative.code:     ! on a square using the Jacobi method.
      ! Written by Fredrik Berntsson (frber@math.liu.se) March 2003
      ! Modified by Berkant Savas (besav@math.liu.se) April 2006
      ! Parallelized for openmp by Hans-Filip Elo and Frida Sundberg May 2016
      !-----------------------------------------------------------------------
      integer, parameter                      :: n=1000, maxiter=1000, nr_threads=16
      double precision,parameter              :: tol=1.0E-3
  