A13251 | Yet Another Meme Problem
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Try guessing the statement from this picture <http://tiny.cc/ogyoiz>.
You are given two integers $A$ and $B$ , calculate the number of pairs $(a, b)$ such that $1 \le a \le A$ , $1 \le b \le B$ , and the equation $a \cdot b + a + b = conc(a, b)$ is true; $conc(a, b)$ is the concatenation of $a$ and $b$ (for example, $conc(12, 23) = 1223$ , $conc(100, 11) = 10011$ ). $a$ and $b$ should not contain leading zeroes.
You are given two integers $A$ and $B$ , calculate the number of pairs $(a, b)$ such that $1 \le a \le A$ , $1 \le b \le B$ , and the equation $a \cdot b + a + b = conc(a, b)$ is true; $conc(a, b)$ is the concatenation of $a$ and $b$ (for example, $conc(12, 23) = 1223$ , $conc(100, 11) = 10011$ ). $a$ and $b$ should not contain leading zeroes.
输入格式
The first line contains $t$ ( $1 \le t \le 100$ ) — the number of test cases.
Each test case contains two integers $A$ and $B$ $(1 \le A, B \le 10^9)$ .
Each test case contains two integers $A$ and $B$ $(1 \le A, B \le 10^9)$ .
输出格式
Print one integer — the number of pairs $(a, b)$ such that $1 \le a \le A$ , $1 \le b \le B$ , and the equation $a \cdot b + a + b = conc(a, b)$ is true.
输入输出样例
输入 #1
3 1 11 4 2 191 31415926
输出 #1
1 0 1337
There is only one suitable pair in the first test case: $a = 1$ , $b = 9$ ( $1 + 9 + 1 \cdot 9 = 19$ ).
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted