Codeforces Round 412 (rated, Div. 2, base on VK Cup 2017 Round 3)
B
T-Shirt Hunt
Codeforces
1300
原题
← AC →
翻译中…

Not so long ago the Codecraft-17 contest was held on Codeforces. The top 25 participants, and additionally random 25 participants out of those who got into top 500, will receive a Codeforces T-shirt.

翻译中…

Unfortunately, you didn't manage to get into top 25, but you got into top 500, taking place $*p*$.

翻译中…

Now the elimination round of 8VC Venture Cup 2017 is being held. It has been announced that the Codecraft-17 T-shirt winners will be chosen as follows. Let $*s*$ be the number of points of the winner of the elimination round of 8VC Venture Cup 2017. Then the following pseudocode will be executed:

翻译中…

i := (s div 50) mod 475
repeat 25 times:
    i := (i * 96 + 42) mod 475
    print (26 + i)

翻译中…

Here "div" is the integer division operator, "mod" is the modulo (the remainder of division) operator.

翻译中…

As the result of pseudocode execution, 25 integers between 26 and 500, inclusive, will be printed. These will be the numbers of places of the participants who get the Codecraft-17 T-shirts. It is guaranteed that the 25 printed integers will be pairwise distinct for any value of $*s*$.

翻译中…

You're in the lead of the elimination round of 8VC Venture Cup 2017, having $*x*$ points. You believe that having at least $*y*$ points in the current round will be enough for victory.

翻译中…

To change your final score, you can make any number of successful and unsuccessful hacks. A successful hack brings you 100 points, an unsuccessful one takes 50 points from you. It's difficult to do successful hacks, though.

翻译中…

You want to win the current round and, at the same time, ensure getting a Codecraft-17 T-shirt. What is the smallest number of successful hacks you have to do to achieve that?

翻译中…

Input

翻译中…

The only line contains three integers $*p*$, $*x*$ and $*y*$ ($26 ≤ *p* ≤ 500$; $1 ≤ *y* ≤ *x* ≤ 20000$) — your place in Codecraft-17, your current score in the elimination round of 8VC Venture Cup 2017, and the smallest number of points you consider sufficient for winning the current round.

翻译中…

Output

翻译中…

Output a single integer — the smallest number of successful hacks you have to do in order to both win the elimination round of 8VC Venture Cup 2017 and ensure getting a Codecraft-17 T-shirt.

翻译中…

It's guaranteed that your goal is achievable for any valid input data.

翻译中…

Note

翻译中…

In the first example, there is no need to do any hacks since 10880 points already bring the T-shirt to the 239-th place of Codecraft-17 (that is, you). In this case, according to the pseudocode, the T-shirts will be given to the participants at the following places:

翻译中…

475 422 84 411 453 210 157 294 146 188 420 367 29 356 398 155 102 239 91 133 365 312 449 301 343

翻译中…

In the second example, you have to do two successful and one unsuccessful hack to make your score equal to 7408.

翻译中…

In the third example, you need to do as many as 24 successful hacks to make your score equal to 10400.

翻译中…

In the fourth example, it's sufficient to do 6 unsuccessful hacks (and no successful ones) to make your score equal to 6500, which is just enough for winning the current round and also getting the T-shirt.

翻译中…

样例

Input #1
239 10880 9889
Output #1
0
InputCopy OutputCopy
Input #2
26 7258 6123
Output #2
2
InputCopy OutputCopy
Input #3
493 8000 8000
Output #3
24
InputCopy OutputCopy
Input #4
101 6800 6500
Output #4
0
InputCopy OutputCopy
Input #5
329 19913 19900
Output #5
8
InputCopy OutputCopy
题目信息
题号
807B
时间限制
2 s
内存限制
256 MB
标签
暴力
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。