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>
using namespace std;
int main(){
	int i = 0, h[50] = {0};
	double height;
	
	while(cin >> height){
		h[i] == height;
		i ++;
	}
	
	int N = sizeof(h);
	
	double max = h[0], min = h[0];
	for(int i = 1; i < N; i++){
		if(max < h[i]) max = h[i];
	}
	for(int i = 1; i < N; i++){
		if(min > h[i]) min = h[i];
	}
	
	double ans = max - min;
	cout << fixed << setprecision(1) << ans << endl;
}

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

int main(){
  int i = 0, n;
  double h[10000];

  while(cin >> h[i]){
    i++;
  }
  n = i;
  sort(h, h + n);

  cout << h[n - 1] - h[0] << endl;
}

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


int main(){
    double l;
    vector<double>a(100);
    for(int i=0;i<50;i++){
        cin>>a[i];
        if(cin.eof()){
            break;
        }
    }
    sort(a.begin(),a.end(),greater<>());
    for(int i=0;i<51;i++){
        if(a[i]==0){
            l=a[i-1];
            break;
        }
    }
    cout<<a[0]-l<<endl;
    return 0;
}

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

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

C++: #include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>

using namespace std;

int main()
{
  double h, mx, mn;

  cin >> h;
  mx = h;
  mn = h;

  while ( cin >> h )
    {
      mx = max( mx, h );
      mn = min( mn, h );
    }

  cout << mx - mn << endl;
  
  return 0;
}

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

int main()
{
int height, small=0, big=0;
bool x=1;
while(cin>>height)
{
 if(x)
 {
   small = height;
   big = height;
   x = 0;
  }
 else if ( height > big ) { big = height; }
 else if ( height < small) { small = height; }
}
 cout<<big-small<<endl;
return 0;
}

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

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

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 <algorithm>
using namespace std;
int main(){
	double data,high=0,low=1000000;
	while(cin>>data){
		if(high<data){
			high=data;
		}
		if(low>data){
			low=data;
		}
	}
	printf("%.1lf\n",high-low);
}

C++: #include <iostream>
using namespace std;
int main(){
  double m,M,yama;
  M = 0;m = 10000000;
  while( cin >> yama){
  if(M < yama)M = yama;
  if(m > yama)m = yama;
  }
  cout << M-m << endl;
  return 0;
}

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

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

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<double> hight;
  for(double n;cin >>n;) hight.push_back(n);
  sort(hight.begin(),hight.end());
  cout <<hight[hight.size()-1]-hight[0]<<endl;
  return 0;
}

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

using namespace std;

int main()
{
	vector<double> mt;
	double m;
	int cont = -1;

	while(cin >> m){
		mt.push_back(m);
		cont++;
	}

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

	cout << mt[cont] - mt[0] << endl;

	return 0;
}

C++: #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(void){
    double height;
    double min = 1000000;
    double max = 0;
    
    while(cin >> height){
        if(height > max) max = height;
        if(height < min) min = height;
    }

    cout << max - min << endl;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps=1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.answer"

bool isso(long long int a) {
	if (a == 1 || a == 0)return false;
	for (long long int i = 2; i*i <= a; ++i) {
		if ((a%i)) {
		}
		else {
			return false;
		}
	}
	return true;
}
int main() {
	
	int N;
	vector<ld>nums;
	while (cin>>N) {
		nums.emplace_back(N);
	}
	cout <<setprecision(22)<<fixed<< *max_element(nums.begin(), nums.end()) - *min_element(nums.begin(), nums.end()) << endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(void){
	double a, mx, mn;
	cin >> a;
	mx = mn = a;
	while(1){
		if(cin.eof() == -1){
			break;
		}
		cin >> a;
		mx = max(mx,a);
		mn = min(mn,a);
	}
	cout << mx - mn << endl;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
  vector<double> v1;
  double buf;
  while(cin >> buf) {
	v1.push_back(buf);
  }
  cout << *max_element(v1.begin(), v1.end()) - *min_element(v1.begin(), v1.end()) << endl;
  return 0;
}

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

int main(){
double a,small,big;
cin>>small;
big=small;
while(cin>>a){
if(a<small)small=a;
if(a>big)big=a;}
cout<<big-small;}

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

int main(){
  double maxh = -1, minh = 999999999;
  double h;

  while(cin >> h){
    maxh = max(maxh, h);
    minh = min(minh, h);
  }

  printf("%.10f\n", maxh - minh);
}

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

int main()
{
    double height, max=0, min=0;
 
    bool i=1;
 
    while (cin >> height)
    {
        if(i)
        {
            max=height;
 
            min=height;
 
            i=0;
        }
 
        if(height>max)
        {
            max = height;
        }
 
        if(height<min)
        {
            min = height;
        }
    }
 
    cout << max-min << endl;
}

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

using namespace std;

int main() {

	double i;
	deque<double> n;

	while(scanf("%lf", &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 ma = 0, mi = (1<<30), data;
  while( cin >> data ) {
    ma = max(data, ma);
    mi = min(data, mi);
  }

  cout << ma - mi << endl;
}

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

int main() {
  double h, max_h = -1, min_h = 1000001;
  while (cin >> h)
    max_h = max(h, max_h), min_h = min(h, min_h);
  cout << max_h - min_h << endl;
}

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

using namespace std;

int main() {
	double m, max_m=-1.0, min_m=1000000000;
	while (cin >> m) {
		min_m = min(min_m, m);
		max_m = max(max_m, m);
	}
	double ans = max_m - min_m;
	cout << ans << endl;
}