Type: Default 1000ms 256MiB

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

题目描述

给出一个区间[l,r][l,r],如果一对(a,b)(a,b)满足la,b,a+brl\le a,b,a+b\le r,我们称之为完美对。

对于给出的区间,有多少个完美对?

输入格式

第一行两个正整数l,rl,r

输出格式

输出一个整数表示答案。

2 5
3
1289 198287
19151299905
37262 998830289
498756540558501261

说明/提示

样例11

(2,2),(2,3),(3,2)(2,2),(2,3),(3,2)都是完美对。

对于30%的数据:1lr10001\le l\le r\le 1000

对于60%的数据:1lr1061\le l\le r\le 10^6

对于全部数据:1lr1091\le l\le r\le 10^9

0307

Not Attended
Status
Done
Rule
IOI
Problem
5
Start at
2026-3-7 8:00
End at
2026-3-7 11:45
Duration
3.8 hour(s)
Host
Partic.
60