1
1
mirror of https://github.com/theoludwig/programming-challenges.git synced 2024-10-29 22:17:23 +01:00
programming-challenges/challenges/cakes-swerc-2020-2021
2023-08-27 15:09:31 +02:00
..
solutions feat(solutions): add cakes-swerc-2020-2021/c/function 2023-08-21 23:52:03 +02:00
test feat(challenges): add cakes-swerc-2020-2021 2022-04-23 20:51:38 +02:00
README.md docs(challenges): improvements to Constraints LaTeX/KaTeX syntax 2023-08-27 15:09:31 +02:00

cakes-swerc-2020-2021

Created by @theoludwig on 23 April 2022.

Instructions

This summer, you plan to organize a large party and invite many friends. They have a sweet tooth, so you plan to bake nice cakes for them. You know the recipe for a nice chocolate cake, and you want to cook as many of them as possible.

Given the N ingredients needed to make a single cake and the ingredients that you have in your kitchen, how many cakes can you make?

Input

  • Line 1: Single integer N for the number of ingredients.
  • N next lines: One for each ingredient. Each of these lines contains two positive integers: the first one is the required quantity of this ingredient per cake, the second one is the quantity of this ingredient you have in your kitchen.

Output

The output should contain a single integer: the maximum number of cakes you can make using the available ingredients.

Constraints

  • 1 \leq N \leq 10
  • All ingredient quantities will be integers between 1 and 10 000.

Source

SWERC 20202021 - Problem E: Cake

Examples

See the test folder for examples of input/output.

Example 1

Input

3
100 500
2 5
70 1000

Output

2

Example 2

Input

3
100 50
2 5
70 1000

Output

0