Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	distance_table := [][]int{
		{0, 6, 13, 18, 23, 43, 58},
		{6, 0, 7, 12, 17, 37, 52},
		{13, 7, 0, 5, 10, 30, 45},
		{18, 12, 5, 0, 5, 25, 40},
		{23, 17, 10, 5, 0, 20, 35},
		{43, 37, 30, 25, 20, 0, 15},
		{58, 52, 45, 40, 35, 15, 0},
	}
	toll_table := [][]int{
		{0, 300, 500, 600, 700, 1350, 1650},
		{300, 0, 350, 450, 600, 1150, 1500},
		{500, 350, 0, 250, 400, 1000, 1350},
		{600, 450, 250, 0, 250, 850, 1300},
		{700, 600, 400, 250, 0, 600, 1150},
		{1350, 1150, 1000, 850, 600, 0, 500},
		{1650, 1500, 1350, 1300, 1150, 500, 0},
	}
	for scanner.Scan() {
		d, _ := strconv.Atoi(scanner.Text())
		if d == 0 {
			break
		}
		d--
		scanner.Scan()
		dbuf := strings.Split(scanner.Text(), " ")
		dh, _ := strconv.Atoi(dbuf[0])
		dm, _ := strconv.Atoi(dbuf[1])
		dtime := 100*dh+dm
		scanner.Scan()
		a, _ := strconv.Atoi(scanner.Text())
		a--
		scanner.Scan()
		abuf := strings.Split(scanner.Text(), " ")
		ah, _ := strconv.Atoi(abuf[0])
		am, _ := strconv.Atoi(abuf[1])
		atime := 100*ah+am
		toll := toll_table[d][a]
		if distance_table[d][a] <= 40 &&
			1730 <= dtime && dtime <= 1930 ||
			1730 <= atime && atime <= 1930 {
				toll = ((toll/2-1)/50+1)*50
		}
		fmt.Println(toll)
	}
}

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

int main(){
  int sic,sh,sm,eic,eh,em,st,et,S,E,flag,ans;
  int d[8][8];
  d[1][2]=d[2][1]=300;
  d[1][3]=d[3][1]=500;
  d[1][4]=d[4][1]=600;
  d[1][5]=d[5][1]=700;
  d[1][6]=d[6][1]=1350;
  d[1][7]=d[7][1]=1650;
  d[2][3]=d[3][2]=350;
  d[2][4]=d[4][2]=450;
  d[2][5]=d[5][2]=600;
  d[2][6]=d[6][2]=1150;
  d[2][7]=d[7][2]=1500;
  d[3][4]=d[4][3]=250;
  d[3][5]=d[5][3]=400;
  d[3][6]=d[6][3]=1000;
  d[3][7]=d[7][3]=1350;
  d[4][5]=d[5][4]=250;
  d[4][6]=d[6][4]=850;
  d[4][7]=d[7][4]=1300;
  d[5][6]=d[6][5]=600;
  d[5][7]=d[7][5]=1150;
  d[6][7]=d[7][6]=500;
  S=17*3600+30*60;
  E=19*3600+30*60;
  while(1){
    /*cin>>sic>>sh>>sm>>eic>>eh>>em;
    if(!sic) break;
    st=sh*3600+sm*60;
    et=eh*3600+em*60;
    flag=0;
    if((S<=st&&st<=E)||(S<=et&&et<=E)) flag=1;
    ans=d[sic][eic];*/
    //if(flag){
    int c;
    cin>>c;
    ans=c;
      int cal;
      ans/=2;
      cal=ans%100;
      if(cal%50){
	ans/=100;
	ans*=100;
	if(cal<50) ans+=50;
	else ans+=100;
      }
      //    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>

using namespace std;

int main()
{
	int distance[][7] =
	{
		{ 0, 6, 13, 18, 23, 43, 58 },
		{ 0, 0, 7, 12, 17, 37, 52 },
		{ 0, 0, 0, 5, 10, 30, 45 },
		{ 0, 0, 0, 0, 5, 25, 40 },
		{ 0, 0, 0, 0, 0, 20, 35 },
		{ 0, 0, 0, 0, 0, 0, 15 }
	};
	int charge[][7] = 
	{
		{ 0, 300, 500, 600, 700, 1350, 1650 },
		{ 0, 0, 350, 450, 600, 1150, 1500 },
		{ 0, 0, 0, 250, 400, 1000, 1350, },
		{ 0, 0, 0, 0, 250, 850, 1300 },
		{ 0, 0, 0, 0, 0, 600, 1150 },
		{ 0, 0, 0, 0, 0, 0, 500 }
	};

	int n, m, s, e;
	while (scanf("%d", &n), n)
	{
		int a, b;
		scanf("%d %d", &a, &b);
		s = 60*a + b;
		scanf("%d %d %d", &m, &a, &b);
		e = 60*a + b;
		--n;
		--m;
		if (n > m)
			swap(n, m);

		int d = distance[n][m];
		int c = charge[n][m];
		const int S = 60*17 + 30;
		const int E = 60*19 + 30;
		if (d <= 40 && (S <= s && s <= E || S <= e && e <= E))
			c = (c+50)/100*50;
		printf("%d\n", c);
	}

	return 0;
}

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

int charge(int in, int out);
int dist(int in, int out);
int checkhalf(int ih, int im, int oh, int om, int dis);
int half(int y);

int main(){
	int inic, inh, inm, outic, outh, outm, yen, kyori;
	while(1){
		cin >>inic;
		if(inic == 0) break;
		cin >>inh >>inm >>outic >>outh >>outm;
		
		yen = charge(inic, outic);
		kyori = dist(inic, outic);
		if(checkhalf(inh, inm, outh, outm, kyori)) yen = half(yen);
		
		cout <<yen <<endl;
	}
	return 0;
}

int charge(int in, int out){
	if(in == 1){
		if(out == 2) return 300;
		if(out == 3) return 500;
		if(out == 4) return 600;
		if(out == 5) return 700;
		if(out == 6) return 1350;
		if(out == 7) return 1650;
	} else if(in == 2){
		if(out == 1) return 300;
		if(out == 3) return 350;
		if(out == 4) return 450;
		if(out == 5) return 600;
		if(out == 6) return 1150;
		if(out == 7) return 1500;
	} else if(in == 3){
		if(out == 1) return 500;
		if(out == 2) return 350;
		if(out == 4) return 250;
		if(out == 5) return 400;
		if(out == 6) return 1000;
		if(out == 7) return 1350;
	} else if(in == 4){
		if(out == 1) return 600;
		if(out == 2) return 450;
		if(out == 3) return 250;
		if(out == 5) return 250;
		if(out == 6) return 850;
		if(out == 7) return 1300;
	} else if(in == 5){
		if(out == 1) return 700;
		if(out == 2) return 600;
		if(out == 3) return 400;
		if(out == 4) return 250;
		if(out == 6) return 600;
		if(out == 7) return 1150;
	} else if(in == 6){
		if(out == 1) return 1350;
		if(out == 2) return 1150;
		if(out == 3) return 1000;
		if(out == 4) return 850;
		if(out == 5) return 600;
		if(out == 7) return 500;
	} else if(in == 7){
		if(out == 1) return 1650;
		if(out == 2) return 1500;
		if(out == 3) return 1350;
		if(out == 4) return 1300;
		if(out == 5) return 1150;
		if(out == 6) return 500;
	}
}

int dist(int in, int out){
	if(in == 1){
		if(out == 2) return 6;
		if(out == 3) return 13;
		if(out == 4) return 18;
		if(out == 5) return 23;
		if(out == 6) return 43;
		if(out == 7) return 58;
	} else if(in == 2){
		if(out == 3) return 7;
		if(out == 4) return 12;
		if(out == 5) return 17;
		if(out == 6) return 37;
		if(out == 7) return 52;
	} else if(in == 3){
		if(out == 4) return 5;
		if(out == 5) return 10;
		if(out == 6) return 30;
		if(out == 7) return 45;
	} else if(in == 4){
		if(out == 5) return 5;
		if(out == 6) return 25;
		if(out == 7) return 40;
	} else if(in == 5){
		if(out == 6) return 20;
		if(out == 7) return 35;
	} else if(in == 6){
		if(out == 7) return 15;
	}
}

int checkhalf(int ih, int im, int oh, int om, int dis){
	int flag1 = 0, flag2 = 0, flag3 = 0;
	if(dis > 40) return 0;
	
	if(ih < 17 || (ih == 17 && im <= 30)){
		if((oh == 19 && om < 30) || oh < 19){
			flag1 = 1;
		}
	}
	
	if(ih > 17 || (ih == 17 && im > 30)){
		if((oh == 19 && om >= 30) || oh > 19){
			flag2 = 1;
		}
	}
	
	if((ih > 17 || (ih == 17 && im > 30)) && ((oh == 19 && om < 30) || oh < 19)){
		flag3 = 1;
	}
	
	if((flag1 && flag2) || (!flag1 && !flag2) || flag3) return 0;
	else return 1;
}

int half(int y){
	int temp = y;
	
	temp /= 2;
	if(temp % 50 != 0){
		temp = temp + abs((temp % 50) - 50);
	}
	
	return temp;
}

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

int dist[] = {0, 6, 13, 18, 23, 43, 58};
int cost[][7] = {
	{   0,  300,  500,  600,  700, 1350, 1650},
	{ 300,    0,  350,  450,  600, 1150, 1500},
	{ 500,  350,    0,  250,  400, 1000, 1350},
	{ 600,  450,  250,    0,  250,  850, 1300},
	{ 700,  600,  400,  250,    0,  600, 1150},
	{1350, 1150, 1000,  850,  600,    0,  500},
	{1650, 1500, 1350, 1300, 1150,  500,    0},};

int main() {
	int s, g;
	while(cin >> s, s) {
		int h, m;
		bool half = false;
		cin >> h >> m;
		if(17 * 60 + 30 <= h * 60 + m && h * 60 + m <= 18 * 60 + 30)
			half = true;
		cin >> g >> h >> m;
		if(17 * 60 + 30 <= h * 60 + m && h * 60 + m <= 18 * 60 + 30)
			half = true;

		half &= abs(s - g) <= 40;

		if(half)
			cout << ((cost[s-1][g-1] / 50) + 1) / 2 * 50 << endl;
		else
			cout << cost[s-1][g-1] << endl;
	}
}