A14578 | Two Sorts
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Integers from $1$ to $n$ (inclusive) were sorted lexicographically (considering integers as strings). As a result, array $a_1, a_2, \dots, a_n$ was obtained.
Calculate value of $(\sum_{i = 1}^n ((i - a_i) \mod 998244353)) \mod 10^9 + 7$ .
$x \mod y$ here means the remainder after division $x$ by $y$ . This remainder is always non-negative and doesn't exceed $y - 1$ . For example, $5 \mod 3 = 2$ , $(-1) \mod 6 = 5$ .
Calculate value of $(\sum_{i = 1}^n ((i - a_i) \mod 998244353)) \mod 10^9 + 7$ .
$x \mod y$ here means the remainder after division $x$ by $y$ . This remainder is always non-negative and doesn't exceed $y - 1$ . For example, $5 \mod 3 = 2$ , $(-1) \mod 6 = 5$ .
输入格式
The first line contains the single integer $n$ ( $1 \leq n \leq 10^{12}$ ).
输出格式
Print one integer — the required sum.
输入输出样例
输入 #1
3
输出 #1
0
输入 #2
12
输出 #2
994733045
输入 #3
21
输出 #3
978932159
输入 #4
1000000000000
输出 #4
289817887
A string $a$ is lexicographically smaller than a string $b$ if and only if one of the following holds:
- $a$ is a prefix of $b$ , but $a \ne b$ ;
- in the first position where $a$ and $b$ differ, the string $a$ has a letter that appears earlier in the alphabet than the corresponding letter in $b$ .
For example, $42$ is lexicographically smaller than $6$ , because they differ in the first digit, and $4 < 6$ ; $42 < 420$ , because $42$ is a prefix of $420$ .
Let's denote $998244353$ as $M$ .
In the first example, array $a$ is equal to $[1, 2, 3]$ .
- $(1 - 1) \mod M = 0 \mod M = 0$
- $(2 - 2) \mod M = 0 \mod M = 0$
- $(3 - 3) \mod M = 0 \mod M = 0$
As a result, $(0 + 0 + 0) \mod 10^9 + 7 = 0$
In the second example, array $a$ is equal to $[1, 10, 11, 12, 2, 3, 4, 5, 6, 7, 8, 9]$ .
- $(1 - 1) \mod M = 0 \mod M = 0$
- $(2 - 10) \mod M = (-8) \mod M = 998244345$
- $(3 - 11) \mod M = (-8) \mod M = 998244345$
- $(4 - 12) \mod M = (-8) \mod M = 998244345$
- $(5 - 2) \mod M = 3 \mod M = 3$
- $(6 - 3) \mod M = 3 \mod M = 3$
- $(7 - 4) \mod M = 3 \mod M = 3$
- $(8 - 5) \mod M = 3 \mod M = 3$
- $(9 - 6) \mod M = 3 \mod M = 3$
- $(10 - 7) \mod M = 3 \mod M = 3$
- $(11 - 8) \mod M = 3 \mod M = 3$
- $(12 - 9) \mod M = 3 \mod M = 3$
As a result, $(0 + 998244345 + 998244345 + 998244345 + 3 + 3 + 3 + 3 + 3 + 3 + 3 + 3) \mod 10^9 + 7$ $=$ $2994733059 \mod 10^9 + 7$ $=$ $994733045$
- $a$ is a prefix of $b$ , but $a \ne b$ ;
- in the first position where $a$ and $b$ differ, the string $a$ has a letter that appears earlier in the alphabet than the corresponding letter in $b$ .
For example, $42$ is lexicographically smaller than $6$ , because they differ in the first digit, and $4 < 6$ ; $42 < 420$ , because $42$ is a prefix of $420$ .
Let's denote $998244353$ as $M$ .
In the first example, array $a$ is equal to $[1, 2, 3]$ .
- $(1 - 1) \mod M = 0 \mod M = 0$
- $(2 - 2) \mod M = 0 \mod M = 0$
- $(3 - 3) \mod M = 0 \mod M = 0$
As a result, $(0 + 0 + 0) \mod 10^9 + 7 = 0$
In the second example, array $a$ is equal to $[1, 10, 11, 12, 2, 3, 4, 5, 6, 7, 8, 9]$ .
- $(1 - 1) \mod M = 0 \mod M = 0$
- $(2 - 10) \mod M = (-8) \mod M = 998244345$
- $(3 - 11) \mod M = (-8) \mod M = 998244345$
- $(4 - 12) \mod M = (-8) \mod M = 998244345$
- $(5 - 2) \mod M = 3 \mod M = 3$
- $(6 - 3) \mod M = 3 \mod M = 3$
- $(7 - 4) \mod M = 3 \mod M = 3$
- $(8 - 5) \mod M = 3 \mod M = 3$
- $(9 - 6) \mod M = 3 \mod M = 3$
- $(10 - 7) \mod M = 3 \mod M = 3$
- $(11 - 8) \mod M = 3 \mod M = 3$
- $(12 - 9) \mod M = 3 \mod M = 3$
As a result, $(0 + 998244345 + 998244345 + 998244345 + 3 + 3 + 3 + 3 + 3 + 3 + 3 + 3) \mod 10^9 + 7$ $=$ $2994733059 \mod 10^9 + 7$ $=$ $994733045$
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted