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 <cstdio>
#include <cmath>

const int price[7][7] = {
  {-1,300,500,600,700,1350,1650},
  {-1,-1,350,450,600,1150,1500},
  {-1,-1,-1,250,400,1000,1350},
  {-1,-1,-1,-1,250,850,1300},
  {-1,-1,-1,-1,-1,600,1150},
  {-1,-1,-1,-1,-1,-1,500}
};

const int dist[7][7] = {
  {-1,6,13,18,23,43,58},
  {-1,-1,7,12,17,37,52},
  {-1,-1,-1,5,10,30,45},
  {-1,-1,-1,-1,5,25,40},
  {-1,-1,-1,-1,-1,20,35},
  {-1,-1,-1,-1,-1,-1,15}
};

const int start = 17*60 + 30 , end = 19*60 + 30;

int main(){
  int sIC,sh,sm,tIC,th,tm;

  while(scanf("%d" ,&sIC) ,sIC){
    scanf("%d%d" ,&sh ,&sm);
    scanf("%d%d%d" ,&tIC ,&th ,&tm);

    sIC--; tIC--;
    bool ok1 = false,ok2 = false;
    int ssum = sh*60 + sm , tsum = th*60 + tm;

    if(!(ssum < start && tsum > end) && 
       ((ssum <= start && tsum >= start) ||
	(ssum > start && tsum >= end))) ok1 = true;

    if(dist[sIC][tIC] <= 40) ok2 = true;
 
    int ans = price[sIC][tIC];
    if(ok1 && ok2){
      ans = ans / 2 + 25;
    }
    
    printf("%d\n" ,ans);
  }

  return 0;
}

C++: #include<cmath>
#include<algorithm>
using namespace std;
int hyo[7][7]={
	{0,300,500,600,700,1350,1650},
	{6,0,350,450,600,1150,1500},
	{13,7,0,250,400,1000,1350},
	{18,12,5,0,250,850,1300},
	{23,17,10,5,0,600,1150},
	{43,37,30,25,20,0,500},
	{58,52,45,40,35,15,0}
};
int main(){
	int s,g, h,m,H,M, c;
	while(cin>>s,s){
		cin>>h>>m>>g>>H>>M;
		if(s>g)swap(s,g);
		c=hyo[s-1][g-1];
		if(hyo[g-1][s-1]<=40 &&( (1050<=h*60+m&&h*60+m<=1170)||(1050<=H*60+M&&H*60+M<=1170) ) )
		c=((int)ceil((c/2/50.0))*50;
		cout<<c<<endl;
	}
	return 0;
}

C++: #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int main(){
	int start,startt[2],end,endt[2];
	while(cin>>start){
		if(start==0)break;
		cin>>startt[0]>>startt[1];
		cin>>end>>endt[0]>>endt[1];
		int ans;
		if(start==1){
			if(end==2)ans=300;
			else if(end==3)ans=500;
			else if(end==4)ans=600;
			else if(end==5)ans=700;
			else if(end==6)ans=1350;
			else if(end==7)ans=1650;
		}else if(start==2){
			if(end==3)ans=350;
			else if(end==4)ans=450;
			else if(end==5)ans=600;
			else if(end==6)ans=1150;
			else if(end==7)ans==1500;
		}else if(start==3){
			if(end==4)ans=250;
			else if(end==5)ans=400;
			else if(end==6)ans=1000;
			else if(end==7)ans=1350;
		}else if(start==4){
			if(end==5)ans=250;
			else if(end==6)ans=850;
			else if(end==7)ans=1300;
		}else if(start==5){
			if(end==6)ans=600;
			else if(end==7)ans=1150;
		}else if(start==6){
			if(end==7)ans=500;
		}
		if(((startt[0]*60+startt[1])>=(17*60+30) && (startt[0]*60+startt[1])<=(19*60+30)) || ((endt[0]*60+endt[1])>=(17*60+30) && (endt[0]*60+endt[1])<=(19*60+30))){
			if((start==1 && end==6) || (end==7 &&(start>0 &&start<4))){	
				cout<<ans<<endl;
			}else{
				int reans=ans/2;
				int alt=reans%50;
				if(alt>0){
					reans+=(50-alt);
				}
				cout<<reans<<endl;
			}
		}else{
			cout<<ans<<endl;
		}
	}
	return 0;
}

C++: 
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ "<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;cout<<" ]"<<endl; }
}
ostream &operator<<(ostream &os, const pair<int,int> &p){return(os<<"("<<p.first<<","<<p.second<<")");}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

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

inline int ceil50(int n){ return (n+50-1)/50*50; }

int solve(int s, int t1, int g, int t2){
    int cost = tbl[MIN(s,g)-1][MAX(s,g)-1];
    int leng = tbl[MAX(s,g)-1][MIN(s,g)-1];
    if( ((17*60+30 <= t1 && t1 <= 19*60+30) || (17*60+30 <= t2 && t2 <= 19*60+30)) && leng <= 40){
        cost = ceil50(cost/2);
    }
    return cost;
}

int main(){
    int s, g;
    while(cin >> s && s){
        int h1,m1,h2,m2;
        cin >> h1 >> m1 >> g >> h2 >> m2;
        cout << solve(s,h1*60+m1,g,h2*60+m2) << endl;
    }
    return 0;
}