HDU 1208 - Pascal's Travels
Problem : Given a DAG, find the number of the different path from source to destination.
Solution : DAG DP. f[u] means the number of the different path from source to u. Then f[u]=sum(f[v]), such that there is an edge from v to u. (Proof: Redunction)