C#

var brain = (short) 3;
short damage = 222;

> ? ((short)1) << 2
4
> ? ((short)1) << 2 is short
false
> ? ((short)1) << 2 is int
true
> ? ((long)1) << 2
4
> ? ((long)1) << 2 is long
true
> ? ((long)1) << 2 is int
false
>  ? ((uint)1) << 2
4
>  ? ((uint)1) << 2 is uint
true
>  ? ((uint)1) << 2 is int
false
>

int main(int argc, char *argv[])
{
  int   i, i1, n, low, high, filter=2, ntime=20 ;
  double time[20]={20.0,48.0,42.3,39.9,39.0,41.4,44.0,52.0,53.1,49.7,42.0,40.1,100.0,45.0,50.0,47.0,43.1,41.0,39.0,42.2};
  double average[20]={0.0},difference[20]={0.0},averagedif[20]={0.0}, localaverage ;
  double timeresult[20], smoothing[20]={0.0};
 
 
  /* 
   * Calculation of moving average (on 5 values) and difference
   */
  for ( i = 0 ; i < ntime ; i++ ) {
    low = i - filter ;
    high = i + filter ;
 
    if ( low < 0 ) low = 0 ;
    if ( high >= ntime ) high = ntime ;
 
    n = 0 ;
    for ( i1 = low ; i1 < high ; i1++ ) {
      average[i] = average[i] + time[i1] ;
      n = n + 1 ;
    }
    average[i] = average[i] / (double)n ;
    difference[i] = average[i] - time[i] ;
  }
 
  /* 
   * Calculation of average of the differences and replacement of aberrant peaks */
  for ( i = 0 ; i < ntime ; i++ ) {
    low = i - filter ;
    high = i + filter ;
 
    if ( low < 0 ) low = 0 ;
    if ( high >= ntime ) high = ntime ;
 
    n = 0 ;
    for ( i1 = low ; i1 < high ; i1++ ) {
      averagedif[i] = averagedif[i] + difference[i1] ;
      n = n + 1 ;
    }
    averagedif[i] = averagedif[i] / (double)n ;
 
    /* Test in function of the distance between difference and difference's average */
    if ( fabs(difference[i]) < fabs(averagedif[i]) )
      timeresult[i] = time[i] ;
    else {
      /* New calculation of average without the central point */
      /* Only if the differences on one hand and on the other hand are in the same direction */
      if ( i != 0 && i != (ntime-1) ) {
	if ( (difference[i]*difference[i-1] < 0.0) && (difference[i-1]*difference[i+1] > 0.0)) {
	  localaverage = 0.0 ;
	  n = 0 ;
	  for ( i1 = low ; i1 < high ; i1++ ) {
	    if ( i1 != i ) {
	     localaverage = localaverage + time[i1] ;
	      n = n + 1 ;
	    }
	  }
	  localaverage = localaverage / (double)n ;
	  timeresult[i] = localaverage ;
	}
	else
	  timeresult[i] = time[i] ;
      }
      else
      timeresult[i] = time[i] ;
    }
  }
 
 
  /* 
   * Calculation of the final smoothing (on 3 values) after eliminating aberrant peaks */
  for ( i = 0 ; i < ntime ; i++ ) {
    low = i - filter ;
    high = i + filter ;
 
    if ( low < 0 ) low = 0 ;
    if ( high >= ntime ) high = ntime ;
 
    n = 0 ;
    for ( i1 = low ; i1 < high ; i1++ ) {
      smoothing[i] = smoothing[i] + timeresult[i1] ;
      n = n + 1 ;
    }
    smoothing[i] = smoothing[i] / (double)n ;
  }
 
  /* Print */
  fprintf ( stdout, "\n T\taverage\tdifference\taveragedif\tT result\tSmoothing\n");
  for ( i = 0 ; i < ntime ; i++ )
    fprintf ( stdout, "\n %g\t%g\t%g\t%g\t%g\t%g",time[i],average[i],difference[i],averagedif[i],timeresult[i],smoothing[i]);
 
  /* Print in file */
  writefich ( time, 20, "Input.dat" );
  writefich ( timeresult, 20, "Output.dat" );
  writefich ( smoothing, 20, "Smoothing.dat" );
 
 
  return 1 ;
}