A11633 | Recursive Queries
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Let us define two functions $f$ and $g$ on positive integer numbers.
You need to process $Q$ queries. In each query, you will be given three integers $l$ , $r$ and $k$ . You need to print the number of integers $x$ between $l$ and $r$ inclusive, such that $g(x)=k$ .
You need to process $Q$ queries. In each query, you will be given three integers $l$ , $r$ and $k$ . You need to print the number of integers $x$ between $l$ and $r$ inclusive, such that $g(x)=k$ .
输入格式
The first line of the input contains an integer $Q$ ( $1<=Q<=2×10^{5}$ ) representing the number of queries.
$Q$ lines follow, each of which contains 3 integers $l$ , $r$ and $k$ $(1<=l<=r<=10^{6},1<=k<=9)$ .
$Q$ lines follow, each of which contains 3 integers $l$ , $r$ and $k$ $(1<=l<=r<=10^{6},1<=k<=9)$ .
输出格式
For each query, print a single line containing the answer for that query.
输入输出样例
输入 #1
4 22 73 9 45 64 6 47 55 7 2 62 4
输出 #1
1 4 0 8
输入 #2
4 82 94 6 56 67 4 28 59 9 39 74 4
输出 #2
3 1 1 5
In the first example:
- $g(33)=9$ as $g(33)=g(3×3)=g(9)=9$
- $g(47)=g(48)=g(60)=g(61)=6$
- There are no such integers between $47$ and $55$ .
- $g(4)=g(14)=g(22)=g(27)=g(39)=g(40)=g(41)=g(58)=4$
- $g(33)=9$ as $g(33)=g(3×3)=g(9)=9$
- $g(47)=g(48)=g(60)=g(61)=6$
- There are no such integers between $47$ and $55$ .
- $g(4)=g(14)=g(22)=g(27)=g(39)=g(40)=g(41)=g(58)=4$
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted