CEN303_2016Questions |
Start: Oct.28.2016 at 05:00:00 PM
Finish: Nov.01.2016 at 05:00:00 AM
The contest is finished!
• Contest scoreboard
|
Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.
Number of Trees
Question:
You have X-by-Y rectangular field and you want to plant trees.
There are k parts in the field where you cannot plant anything.
And, every tree requires at least w-square-meter. Write a program,
that defines the maximum number of trees that you can plant.
Input specification:
You will be given four integers in the beginning,
- the width of the field (X)
- the length of the field (Y)
- the width required for every tree (w)
- the number of objects in the field (k)
where 1 ≤ (X,Y) ≤ 10, 2 ≤ w ≤ 7 and
0 ≤ k ≤ 100.
Then, each of the following k lines will have
two integers (x, y) coordinates of k objects.
Output specification:
Show one integer (the number of trees that
can be planted).
Sample Input I
6 5 2 3
1 1
3 2
4 5
|
Sample Input II
6 5 3 3
1 1
3 2
4 5
|
Sample Output I
5
|
Sample Output II
2
|
Для отправки решений необходимо выполнить вход.
|