Problem #PRU-35795

Problems Combinatorics Partitions Covers Methods Pigeonhole principle Pigeonhole principle (angles and lengths)

Problem

A straight corridor of length 100 m is covered with 20 rugs that have a total length of 1 km. The width of each rug is equal to the width of the corridor. What is the longest possible total length of corridor that is not covered by a rug?