# PROBLEM LINK:

**Setter:** jeevanjyot

**Testers:** satyam_343, rivalq

**Editorialist:** hrishik85

# DIFFICULTY:

570

# PREREQUISITES:

None

# PROBLEM:

There are N children and Chef wants to give them 1 candy each. Chef already has X candies with him. He can buy packets containing exactly 4 candies each.

We have to determine the **minimum** number of candy packets Chef must buy so that he is able to give 1 candy to each of the N children.

# EXPLANATION:

Chef already has X candies with him.

Ideally, he needs (N - X) new candies.

Since he can only buy in packets of 4, he will end up buying (N-X)/4 packets rounded up to the nearest integer.

One caveat here is that if N \leq X, then the Chef doesnâ€™t need to buy anything.

# TIME COMPLEXITY:

Time complexity is O(1).

# SOLUTION:

## Editorialist's Solution

```
import math
t=int(input())
for _ in range(t):
N,X=map(int,input().split())
print(math.ceil((max((N-X),0)/4)))
```