gold_Flight_Routes — USACO December_Contest
Task type: batch | Time limit: 2 s | Memory limit: 256 MB | Difficulty: 15
Algorithms: directed acyclic graph, graph theory, dynamic programming

Bessie recently discovered that her favorite pop artist, Elsie Swift, is
performing in her new Eras Tour! Unfortunately, tickets are selling out fast, so
Bessie is thinking of flying to another city to attend the concert. The Eras
tour is happening in $N$ ($2\le N\le 750$) cities labeled $1\dots N$, and for
each pair of cities $(i,j)$ with $i<j$ there either exists a single direct
flight from $i$ to $j$ or not.
A
flight route
from city $a$ to city $b$ ($a<b$) is a sequence of $k\ge 2$ cities
$a=c_1<c_2<\dots<c_k=b$ such that for each $1\le i<k$, there is a direct flight
from city $c_i$ to city $c_{i+1}$. For every pair of cities $(i,j)$ with $i<j$,
you are given the parity of the number of flight routes between them (0 for
even, 1 for odd).
While planning her travel itinerary, Bessie got distracted and now wants to know
how many pairs of cities have direct flights between them. It can be  shown that
the answer is uniquely determined.
INPUT FORMAT (input arrives from the terminal / stdin):
The first line contains $N$.
Then follow $N-1$ lines. The $i$th line contains $N-i$ integers. The $j$th 
integer of the $i$th line is equal to the parity of the number of flight routes
from $i$ to $i+j$.
OUTPUT FORMAT (print output to the terminal / stdout):
Output the number of pairs of cities with direct flights between them.
SAMPLE INPUT:
3
11
1
SAMPLE OUTPUT:
2
There are two direct flights: $1\to 2$ and $2\to 3$. There is one flight route
from $1$ to $2$ and $2$ to $3$, each consisting of a single direct flight. There
is one flight route from $1$ to $3$ ($1\to 2\to 3$).
SAMPLE INPUT:
5
1111
101
01
1
SAMPLE OUTPUT:
6
There are six direct flights $1\to 2, 1\to 4, 1\to 5, 2\to 3, 3\to 5, 4\to 5$.
These result in the following numbers of flight routes:
Flight Route Counts:

            dest
          1 2 3 4 5

       1  0 1 1 1 3 
       2  0 0 1 0 1 
source 3  0 0 0 0 1 
       4  0 0 0 0 1 
       5  0 0 0 0 0
which is equivalent to the sample input after taking all the numbers $\pmod{2}$.
SCORING:
Inputs 3-4: $N\le 6$
Inputs 5-12: $N\le 100$
Inputs 13-22: No additional constraints.
Problem credits: Benjamin Qi

Starter code: