MathDB

Misha came to country with

n

cities, and every

2

cities are connected by the road. Misha want visit some cities, but he doesn`t visit one city two time. Every time, when Misha goes from city

A

to city

B

, president of country destroy

k

roads from city

B

(president can`t destroy road, where Misha goes). What maximal number of cities Misha can visit, no matter how president does?

Problem Statement