A12133 | Vasya and Big Integers
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
The first line contains a single integer $a~(1 \le a \le 10^{1000000})$ .
The second line contains a single integer $l~(0 \le l \le 10^{1000000})$ .
The third line contains a single integer $r~(0 \le r \le 10^{1000000})$ .
It is guaranteed that $l \le r$ .
It is also guaranteed that numbers $a, l, r$ contain no leading zeros.
The second line contains a single integer $l~(0 \le l \le 10^{1000000})$ .
The third line contains a single integer $r~(0 \le r \le 10^{1000000})$ .
It is guaranteed that $l \le r$ .
It is also guaranteed that numbers $a, l, r$ contain no leading zeros.
输入格式
Print a single integer — the amount of partitions of number $a$ such that they match all the given requirements modulo $998244353$ .
输出格式
In the first test case, there are two good partitions $13+5$ and $1+3+5$ .
In the second test case, there is one good partition $1+0+0+0+0$ .
In the second test case, there is one good partition $1+0+0+0+0$ .
输入输出样例
输入 #1
135 1 15
输出 #1
2
输入 #2
10000 0 9
输出 #2
1
In the first test case, there are two good partitions $13+5$ and $1+3+5$ .
In the second test case, there is one good partition $1+0+0+0+0$ .
In the second test case, there is one good partition $1+0+0+0+0$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted