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 <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
double m,h,l;
int main()
{
    while(~scanf("%lf",&m)) {
        h=max(m,h);
        l=min(m,l);
    }
    printf("%f\n",fabs(h-l));
    return 0;
}

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

using namespace std;

int main() {
    double h, minh = 1e6, maxh = 0;
    while (cin >> h) {
        minh = min(minh, h);
        maxh = max(maxh, h);
    }
    cout << maxh - minh << endl;

    return 0;
}

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

int main(){
	istream_iterator<double> first(cin), last;
	vector<double> v(first, last);
	printf("%f", *max_element(v.begin(), v.end()) - *min_element(v.begin(), v.end()));
	puts("");
}

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

int main()
{
    double m;
    double min = 1000001.0, max = 0.0;

    while (cin >> m){
        if (max < m){
            max = m;
        }
        if (min > m){
            min = m;
        }
    }
    cout << max - min << endl;

    return 0;
}

C++: #include <stdio.h>

int main(){
	float a, MAX, min;
	scanf("%f", &a);
	MAX=a;
	min=a;
	while(scanf("%f", &a)!=EOF)
	{
		if(a>MAX)
		{
			MAX=a;
		}
		if(a<min)
		{
			min=a;
		}
	}
	printf("%f\n", MAX-min);
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  double mi = 100000000, ma, n;
  while(cin >> n) {
  ma = max(ma, n);
  mi = min(mi, n);
  }
  cout << ma - mi << endl;
  return 0;
}

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

int main() {
	double max = 0;
	double min = numeric_limits<double>::max();
	double now;
	while (cin >> now) {
		if (max < now) {
			max = now;
		}
		if (min > now) {
			min = now;
		}
	}
	cout << max - min << endl;
	
	return 0;
}

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

int main(void){
	double tmp,cmax,cmin;
	cin >> tmp;
	cmax=cmin=tmp;
	while(cin >> tmp){
		if(cin.eof())
			break;
		cmax=max(cmax,tmp);
		cmin=min(cmin,tmp);
	}
	cout  << cmax-cmin << endl;
	return 0;
}

C++: #include<iostream>
int main(){double l,m,n=1e5;for(;std::cin>>l;m<l?m=l:l,n>l?n=l:l);std::cout<<m-n<<"\n";}

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

using namespace std;

int main(void)
{
	double max,min;

	max = 0;
	min = 999999999;

	double data;
	while( cin >> data ){
		if( data > max ) max = data;
		if( data < min ) min = data;
	}

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

	return 0;
}

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

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

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

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

using namespace std;
#define rep2(x,from,to) for(int x = (from); x < (to); ++(x))
#define rep(x,to) rep2(x,0,to)

int main() {
	double h;
	double highest = 0;
	double lowest = INT_MAX;
	while(cin >> h) {
		if(highest < h) highest = h;
		if(lowest > h) lowest = h;
	}
	cout << highest - lowest << endl;
	return 0;
}

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

int main() {
  double h=0,l=999999999,m;
  while(cin >> m) {
	  if (m > h) h=m;
	  if (m < l) l=m;
  }
  printf("%f\n",h-l);
  return 0;
}

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

int main(){
	vector<double> yama;
	double j;
	while(cin>>j)yama.push_back(j);
	sort(yama.begin(),yama.end());
	//cout.precision(1);
	j = yama[yama.size()-1]-yama[0];
	printf("%.1f\n",j);
}

C++: #include<iostream>

using namespace std;

int main(){
double h;
double max=0,min=10000000;

while(cin>>h){
if(h>max)max=h;
if(h<min)min=h;
}
 cout << max-min <<endl;

 return 0;
}

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

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()

int main() {
  double h;
  vector<double> v;
  while(cin >> h) {
    v.push_back(h);
  }
  cout << *max_element(ALL(v)) - *min_element(ALL(v)) << endl;
}

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

using namespace std;

int main() {

	double i;
	deque<double> n;

	while(scanf("%f", &i)!=EOF)
		n.push_back(i);

	sort(n.begin(), n.end());
	printf("%.1f\n", *n.rbegin()-*n.begin());

	return 0;

}

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

int main(){
  double n;
  vector<double> vec;
  while (cin >> n){
    vec.push_back(n);
  }
  sort(vec.begin(), vec.end());
  double ans = vec.back() - vec.front();
  cout << fixed << setprecision(3) << ans << endl;
}

C++: #include<iostream>
int main(){
	double a=0,b=10000000000;
	double c;
	while(std::cin>>c){
		if(a<c)a=c;
		if(c<b)b=c;
	}
	std::cout<<a-b<<std::endl;
	return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;
int main(){
	double hight,max,min;
	cin >> hight;
	max=min=hight;
	while(cin >> hight){
		if(hight>max) max=hight;
		if(hight<min) min=hight;
	};
	cout << fixed << setprecision(1);
	cout << max-min << '\n' ;
}

C++: #include<stdio.h>

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

C++: #include<stdio.h>
#include<math.h>
int main()
{
	double h[50],r=0;
	int i=0;
	while(scanf("%lf",&h[i])!=EOF){
		i++;
	}
	i--;
	for(int j=0;j<i;j++){
		for(int k=0;k<i;k++){
			if(r<fabs(h[k]-h[j])){
				r=fabs(h[k]-h[j]);
			}
		}
	}
	printf("%f\n",r);
	return 0;
}

C++: #include <iostream>
#include<algorithm>
using namespace std;
int main(){
    double a[10000],max=-10000,min=100000000,b;
    int i=0;
    while(cin>>a[i]){
        i++;
    }
    for(int j=0;j<i;j++){
        if(a[j]>max){
            max=a[j];
        }
        if(a[j]<min){
            min=a[j];
        }
    }double ans=max-min;
    printf("%.2lf",ans);
    cout<<endl;
    return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
	double h, max = 0.0, min = 9999999.0;
	while (cin >> h)
	{
		if (cin.eof()) break;
		if (h > max) max = h;
		if (h < min) min = h;
	}
	printf("%.1lf\n", max - min);
	return 0;
}

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

int main(){
    double ma = 0, mi = 1e6, h;
    while(cin >> h){
        ma = max(ma, h);
        mi = min(mi, h);
    }
    cout << ma-mi << endl;
    return 0;
}

C++: #include<stdio.h>

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

C++: 3776.0
1819.0
645.2
2004.1
1208.6

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

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)

int main()
{
  int i;
  double a[100000];
  for (i = 0; cin >> a[i]; i++);
  sort(a, a + 1);
  cout << a[i - 1] - a[0] << endl;
}