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 <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>

using namespace std;

#define vci vector<int>
#define vcs vector<string>
#define pb push_back
#define sz size()
#define mapii map<int, int>
#define mapci map<char, int>
#define mapsi map<string, int>
#define all(x) x.begin(), x.end()
#define minit(a, i) memset(a, i, sizeof(a));

#define for_(i, a, b) for (int i=(int)a; i<(int)b; i++)
#define for_d(i, a, b) for (int i=(int)a-1; i>=b; i--)
#define for_r(i, a, b, c) for (int i=(int)a; i<(int)b; i += c)
#define for_dr(i, a, b, c) for (int i=(int)a-1; i>=b; i -= c)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

typedef long long ll;
typedef double D;

const int iINF = 2147483647;
const ll lINF = 9223372036854775807;

template <class T> inline void dbg(T t) { cout << t << endl; }





int main() {
	D in, mini = (D)lINF, maxi = 0.0;
	while (cin>>in) { mini = min(mini, in); maxi = max(maxi, in); }
	cout << maxi-mini << endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#include<iomanip>
using namespace std;
int main(){
	double h,l,a;
	cin>>a;
	h=a;
	l=a;
	while(cin>>a){
		if(a>h)
			h=a;
		if(l>a)
			l=a;
	}
	cout<<fixed<<setprecision(5)<<h-l<<endl;
	return 0;
}

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

using namespace std;

void solve()
{
	vector<double> Vec;
	double height;
	while(cin >> height)
	{
		Vec.push_back(height);
	}
	sort(Vec.begin(), Vec.end());
	cout << Vec[Vec.size() - 1] - Vec[0] << endl;
}

int main()
{
	solve();
	return(0);
}

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

int main(){
    double n;
    vector<double>v;
    while(cin>>n){
        v.push_back(n);
    }   
    double a=v[0];
    double b=v[0];
    for(int i=0; i<v.size();i++){
        a=max(a,v[i]);
        b=min(b,v[i]);
    }   
}

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

#define N 5
int main(){
	double height[N];
	
	for(int i=0;i<N;i++){
		cin >> height[i];
	}
	
	sort(height,height+N);
	
	double heightd = height[N-1] - height[0];
	cout << heightd << endl;
	
	return 0;
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <iomanip>
#include <stack>
using namespace std;
int main(){
  double tall;
  vector<double> v;
  while(cin>>tall){
    if(cin.eof())break;
    if(!tall)break;
    v.push_back(tall);
  }
  sort(v.begin(),v.end());
  cout<<v[v.size()-1]-v[0]<<endl;
}

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<stdio.h>
#include<string>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<string.h>
#include<map>
#include<queue>

using namespace std;

typedef pair<int,int> pii;

#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<=k;i++)
#define in(i,j,k) ((i)>=(j)&&(i)<=(k))


int main(){
	double h,l,t;
	h=l=0;
	while(~scanf("%lf",&t)){
		if(l==0)l=t;
		h=max(h,t);
		l=min(l,t);
	}
	printf("%.1f\n",h-l);
	return 0;
}

C++: #include <iostream>
 
using namespace std;
 
int main(int argc, char **argv)
{
    double max, min, tmp;
     
    cin >> max;
    min = max;
     
    while(cin >> tmp){
        if(max < tmp){
            max = tmp;
        } else (tmp < min){
            min = tmp;
        }
    }
     
    cout << (double)(max - min) << endl;
     
    return 0;
}

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

using namespace std;

int main(void)
{
    ios::sync_with_stdio(false);
    double maxh = -1, minh = 114514810;
    double h;
    while(cin >> h) {
        maxh = max(maxh, h);
        minh = min(minh, h);
    } 
    cout << maxh - minh << endl;

    return 0;
}

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;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

double abs( double n )
{
	if ( n < 0 )
	{
		return -n;
	}
	else
	{
		return n;
	}
}

int main()
{
	vector<double> height;

	double input;

	while ( cin >> input )
	{
		height.push_back( input );
	}

	sort( height.begin(), height.end() );

	cout << abs( *height.begin() - *height.rbegin() ) << endl;

	return 0;
}

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

int main(){
    vector<double> height;
    double tmp;

    while(cin >> tmp){
        height.push_back(tmp);
    }

    sort(height.begin(), height.end());

    double min;
    double max;

    min = height[0];
    max = height[height.size()-1];

    cout << max - min << endl;

    return 0;
}

C++: #include <iostream>
#include <climits>
using namespace std;
int main( void )
{
	double height, max_height = INT_MIN, min_height = INT_MAX;
	while ( cin >> height )
	{
		max_height = height > max_height ? height : max_height;
		min_height = height < min_height ? height : min_height;
	}
	cout << max_height - min_height << endl;
	return 0;
}

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

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

C++: #include <iostream>
#include <cfloat>
using namespace std;
int main(){
	double n,max = 0,min = DBL_MAX;
	while(cin >> n){
		if(n>max) max = n;
		else if(n<min) min = n;
	}
	cout << (double)(max - min) << endl;
	return 0;
}

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

using namespace std;

int main()
{
  double mn = 1000000, mx = -1;
  double tmp;
  while (scanf("%lf ", &tmp) == 1) {
    mn = min(mn, tmp);
    mx = max(mx, tmp);
  }
  printf("%lf\n", mx - mn);
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

double abs( double n )
{
	if ( n < 0 )
	{
		return -n;
	}
	else
	{
		return n;
	}
}

int main()
{
	vector<double> height;

	double input;

	while ( cin >> input )
	{
		height.push_back( input );
	}

	sort( height.begin(), height.end() );

	cout << abs( *height.begin() - *height.rbegin() ) << endl;

	return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
	double n;
	vector<double>a;
	int i=0;	
        while(cin>>n){
		a.push_back(n);	             
	}
	double x=a[0];
        double y=a[0];
        for(int i=1;i<a.size();i++){
		x=max(x,a[i]);
		y=min(y,a[i]);
	}
	printf("%.1f\n",x-y);
	return 0;
}