1) graph G consists of n nodes and m edges 2) G is a directed acyclic graph 3) n<=300 & m<=400 4) Number of simple paths from vertex 1 to vertex n is equal to k.

then what is the maximum value for k for the given constraints.

There are thousands of people who were cheating in codeforces round and the way they were cheating is known to us. They put so many comments in the original code. So original code and this duplicate code were different. Codeforces should ban these accounts permanently