Cops And thief devu

[rahul14042000]

can anyone help me in this problem?would i require any other algo to do this?please help m just a beginner

[ssjgz]

COPS - Editorial

PROBLEM LINK: Practice Contest Author: Devendra Agarwal Tester: Surya Kiran Editorialist: Amit Pandey DIFFICULTY: Cakewalk PREREQUISITES: None PROBLEM: There are 100 houses in a lane, numbered from 1 to 100. N cops are positioned in some houses. A cop’s running speed is h houses per second and he can run for at max t secs. Find number of houses where a thief can hide such that he won’t be caught by any of the cops. QUICK EXPLANATION: For each house and each cop, we can check whether the …