There are some markets in a city.Some of them are joined by one-way streets,such that for any market,there are exactly two street to **leave out**.

The city can be partitioned into \(N\) districts such that streets join only markets from different districts,and by the same one-way for any two districts.(**either only from first to second,or vice-versa**)

If \(N\) is a multiple of 13 and less than 2000, find the value of \(N\).

×

Problem Loading...

Note Loading...

Set Loading...