A8183 | Double Happiness
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
On the math lesson a teacher asked each pupil to come up with his own lucky numbers. As a fan of number theory Peter chose prime numbers. Bob was more original. He said that number $t$ is his lucky number, if it can be represented as:
$t=a^{2}+b^{2},$ where $a,b$ are arbitrary positive integers.Now, the boys decided to find out how many days of the interval $[l,r]$ ( $l<=r$ ) are suitable for pair programming. They decided that the day $i$ ( $l<=i<=r$ ) is suitable for pair programming if and only if the number $i$ is lucky for Peter and lucky for Bob at the same time. Help the boys to find the number of such days.
$t=a^{2}+b^{2},$ where $a,b$ are arbitrary positive integers.Now, the boys decided to find out how many days of the interval $[l,r]$ ( $l<=r$ ) are suitable for pair programming. They decided that the day $i$ ( $l<=i<=r$ ) is suitable for pair programming if and only if the number $i$ is lucky for Peter and lucky for Bob at the same time. Help the boys to find the number of such days.
输入格式
The first line of the input contains integer numbers $l,r$ ( $1<=l,r<=3·10^{8}$ ).
输出格式
In the only line print the number of days on the segment $[l,r]$ , which are lucky for Peter and Bob at the same time.
输入输出样例
输入 #1
3 5
输出 #1
1
输入 #2
6 66
输出 #2
7
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted