A12133. Vasya and Big Integers
编程题
普及/提高-
知识点
题目描述
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$ .