Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	max := 0.0
	min := 1000000.0
	for sc.Scan() {
		n, _ := strconv.ParseFloat(sc.Text(), 64)
		if max < n {
			max = n
		}
		if min > n {
			min = n
		}
	}
	fmt.Println(max - min)
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio( false );

	double high = 0;
	double low = DBL_MAX;

	double x;
	while( cin >> x ) {
		if( x > high ) { high = x; }
		if( x < low ) { low = x; }
	}

	cout << fixed << setprecision( 2 ) << (high - low) << endl;
	return 0;
}

C++: #include <iostream>
using namespace std ;

int main()
{
	double hei ;

	double high = 0 ;
	double low = 0 ;

	while( cin >> hei )
	{
		if( hei > high ) high = hei ;

		if( low == 0 ) low = hei ;
		else
		{
			if( hei < low ) low = hei ;
		}
	}

	high -= low ;
	printf("%.1f",high) ;

	return 0 ;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(){

  int i=0;
  double a[10000],max,min;

  while(cin >> a[i]){
    i++;
  }
  
  max=a[0];
  min=a[0];

  for(int j=1 ; j < i-1 ; j++){
    
    if( max < a[j] ){
      max=a[j];
    }
    if( min > a[j] ){
      min=a[j];
    }

  }

  printf("%.1f\n",max-min);

  return 0;

}

C++: #include <iostream>
using namespace std;

/** Problem0046 : Differential **/

int main()
{
	double max, min, input;
	cin >> max; min = max;
	
	while (cin >> input) {
		if (max < input)
			max = input;
		else if (min > input)
			min = input;
	}
	
	cout << max - min << endl;
	return 0;
}

C++: #include<iostream>
 using namespace std;int main(){double a,tans,hans;cin >> a;tans = a; hans = a;while(cin>>a) if(tans>a) tans = a; if(hans<a) hans = a;cout << hans - tans << endl;}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    double ma = -1, mi = 1e9;
    double d;
    while(cin >> d) {
        ma = max(ma, d);
        mi = min(mi, d);
    }
    cout << ma - mi << endl;
}

C++: #include<stdio.h>

int main ()
{
double H,max,min;
max=0;min=0;
while(scanf("%lf",&H)!=EOF)
{
	
if(H>max)max=H;
else if(H<min)min=H;
if(min==0)min=H;
}
printf("%lf",max-min);
return 0;
}

C++: #include <stdio.h>
#include <math.h>
#include <algorithm>

using namespace std;

int main(){
	double max = -1,min = 1000001,tmp;

	while(scanf("%lf",&tmp)!=EOF){
		max = (max >= tmp)?max:tmp;
		min = (min <= tmp)?min:tmp;
	}

	printf("%.1lf\n",max-min);

    return 0;
}

C++: #include <cstdio>
#include <algorithm>

using namespace std;

int main()
{
  double n, h = 0.0, l = 999999999.0;
  int i = 5;

  while (i--){
    scanf("%lf", &n);
    h = max(h, n);
    l = min(l, n);
  }

  printf("%.1lf\n", h - l);
}

C++: #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;


int main(){
    double a=-1,b=-1,c;
    while(scanf("%lf",&c)!=EOF){
        if(a==-1){
            a=c;
            b=c;
        }
        if(c>a)a=c;
        if(c<b)b=c;
    }
    printf("%.10lf\n",a-b);
    return 0;
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8

static const double PI=6*asin(0.5);
typedef complex<double> P;
typedef long long ll;


double MIN,MAX;

int main(){
	double t;
	cin>>t;
	MAX=MIN=t;
	while(cin>>t){
		MAX=max(MAX,t);
		MIN=min(MIN,t);
	}
	cout<<MAX-MIN<<endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>

using namespace std;

vector<double> mt;
double a;
int main() {
	
	mt.clear();
	
	int b = 0;
	
	while( cin >> a)
	{
		mt.push_back(a);	
		b++;		
	}
	sort(mt.begin(), mt.end());
	cout << fixed << setprecision(6) << mt[b] - mt[0] << "\n";
	
	
	return 0;
}

C++: #include <iostream>
#include <string>
#include <math.h>
#include <map>
#include <stdio.h>
#include <ctype.h>
#include <algorithm>
#include <stdlib.h>
#include <stack>
#include <queue>
#include <bitset>
#include <memory.h>

using namespace std;



int main() {
    
    double x;
    
    cin>>x;

    double hig=x;
    double low=x;
    
    
    while(cin>>x){
        if(hig<x)hig=x;
        if(low>x)low=x;
    }
    cout<<hig-low<<endl;
    return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <climits>
#include <algorithm>

using namespace std;

double m,h,l;

int main()
{
    while(~scanf("%lf",&m)) {
        h=max(m,h);
        l=min(m,INT_MAX);
    }
    printf("%f\n",fabs(h-l));
    return 0;
}

C++: #include<stdio.h>
#include<iostream>

using namespace std;

int main(void) {
  double min, max, in;

  cin >> in;
  min = in;
  max = in;

  while(cin >> in) {
    if(min > in) {
     min = in;
    }

    if(max < in) {
      max = in;
    }
  }

  cout << (max - min) << endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <limits>
#include <cmath>
#include <cfloat>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define REP(i,b,n) for(i=b;i<n;i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))

using namespace std;

double ma = numeric_limits<double>::min(), mn = numeric_limits<double>::max();

int main()
{
	double a;
	
	while(cin >> a, !cin.eof())
	{
		ma = max(ma, a);
		mn = min(mn, a);
	}
	
	
	cout << ma - mn << endl;
	
	return 0;
}

C++: #include <cstdio>

using namespace std;

int main()
{
  double n, h = 0.0, l = 999999.0;

  while (scanf("%lf", &n)){
    h = max(h, n);
    l = min(l, n);
  }

  printf("%.1lf\n", h - l);
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int main(){
	double a[50];
	int n = 0;
	while(cin >> a[n]){n++;}
	sort(a, a+n);
	cout << a[n-1] - a[0] << endl;
	return 0;
}

/*
3776.0
1819.0
645.2
2004.1
1208.6
*/

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

int main(){
	vector<double> mts;
	double in;
	string str;
	while( getline(cin, str), str.size() ){
		sscanf( str.c_str(), "%lf", &in );
		mts.push_back(in);
	}
	sort( mts.begin(), mts.end() );
	double out = mts[mts.size()-1] - mts[0];
	cout << out << endl;
	return 0;
}

C++: #include<stdio.h>
int main(void)
{
		float o,m,n,i;
		m=0;
		n=10000000;
	while(scanf("%f",&o)!=EOF){
		if(m<o){
			m=o;
		}
		if(n>o){
			n=o;
		}
	}	
		printf("%.2f\n",m-n);
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
	vector<double> h;
	double n;
	while(cin >> n){
		h.push_back(n);
	}
	
	sort(h.begin(),h.end());
	
	double height = h.back() - h.front();
	cout << height << endl;
	
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;

int main(){
  double min=10000000,max=0;
  double h;
  
  while(cin>>h){
    if(max<h)max=h;
    if(min>h)min=h;
  }
  cout<<max-min<<endl;



  return 0;
}

C++: #include<cstdio>
#include<iostream>
using namespace std;
int main(){
double max=-1,min=-1,n;
while(scanf("%lf",&n)!=EOF){
if(n>max||max==-1){
max=n;
}
if(n<min||min==-1){
min=n;
}
}
cout<<max-min<<endl;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<double> ms;
int main() {
    double m;
    while (cin >> m) {
        ms.push_back(m);
    }
    cout << (*max_element(ms.begin(), ms.end()) - *min_element(ms.begin(), ms.end())) << endl;
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;

int main(){

  double a[11111]={0};
  int i=0;
  while(scanf("%lf",&a[i]) != EOF){
    i++;
  }
  
  sort(a,a+i);

  cout << fabs(a[0]-a[i-1]) << endl;

  return 0;
}