306143: CF1153A. Serval and Bus

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Serval and Bus

题意翻译

#### 题意 NaCly_Fish 要去机房,但他只能乘公交去。 公交站有 $n$ 个线路,第 $i$ 个线路在 $s_i$ 时会来第一辆,然后每隔 $d_i$ 秒来一辆。 NaCly_Fish 在第 $t$ 秒会到公交站,请告诉他他最先能到哪辆公交车上。 如果有多种可能,输出任意一种。 #### 输入 第一行两个整数 $n,t(1\le n\le 100, 1\le t\le 10^5)$ 接下来 $n$ 行每行两个数 $s_i,d_i (1\le s_i,d_i\le 10^5)$ #### 输出 乘到的公交车的线路编号。

题目描述

It is raining heavily. But this is the first day for Serval, who just became 3 years old, to go to the kindergarten. Unfortunately, he lives far from kindergarten, and his father is too busy to drive him there. The only choice for this poor little boy is to wait for a bus on this rainy day. Under such circumstances, the poor boy will use the first bus he sees no matter where it goes. If several buses come at the same time, he will choose one randomly. Serval will go to the bus station at time $ t $ , and there are $ n $ bus routes which stop at this station. For the $ i $ -th bus route, the first bus arrives at time $ s_i $ minutes, and each bus of this route comes $ d_i $ minutes later than the previous one. As Serval's best friend, you wonder which bus route will he get on. If several buses arrive at the same time, you can print any of them.

输入输出格式

输入格式


The first line contains two space-separated integers $ n $ and $ t $ ( $ 1\leq n\leq 100 $ , $ 1\leq t\leq 10^5 $ ) — the number of bus routes and the time Serval goes to the station. Each of the next $ n $ lines contains two space-separated integers $ s_i $ and $ d_i $ ( $ 1\leq s_i,d_i\leq 10^5 $ ) — the time when the first bus of this route arrives and the interval between two buses of this route.

输出格式


Print one number — what bus route Serval will use. If there are several possible answers, you can print any of them.

输入输出样例

输入样例 #1

2 2
6 4
9 5

输出样例 #1

1

输入样例 #2

5 5
3 3
2 5
5 6
4 9
6 1

输出样例 #2

3

输入样例 #3

3 7
2 2
2 3
2 4

输出样例 #3

1

说明

In the first example, the first bus of the first route arrives at time $ 6 $ , and the first bus of the second route arrives at time $ 9 $ , so the first route is the answer. In the second example, a bus of the third route arrives at time $ 5 $ , so it is the answer. In the third example, buses of the first route come at times $ 2 $ , $ 4 $ , $ 6 $ , $ 8 $ , and so fourth, buses of the second route come at times $ 2 $ , $ 5 $ , $ 8 $ , and so fourth and buses of the third route come at times $ 2 $ , $ 6 $ , $ 10 $ , and so on, so $ 1 $ and $ 2 $ are both acceptable answers while $ 3 $ is not.

Input

题意翻译

#### 题意 NaCly_Fish 要去机房,但他只能乘公交去。 公交站有 $n$ 个线路,第 $i$ 个线路在 $s_i$ 时会来第一辆,然后每隔 $d_i$ 秒来一辆。 NaCly_Fish 在第 $t$ 秒会到公交站,请告诉他他最先能到哪辆公交车上。 如果有多种可能,输出任意一种。 #### 输入 第一行两个整数 $n,t(1\le n\le 100, 1\le t\le 10^5)$ 接下来 $n$ 行每行两个数 $s_i,d_i (1\le s_i,d_i\le 10^5)$ #### 输出 乘到的公交车的线路编号。

加入题单

上一题 下一题 算法标签: