A12098 | Maximum Sum of Digits
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a positive integer $n$ .
Let $S(x)$ be sum of digits in base 10 representation of $x$ , for example, $S(123) = 1 + 2 + 3 = 6$ , $S(0) = 0$ .
Your task is to find two integers $a, b$ , such that $0 \leq a, b \leq n$ , $a + b = n$ and $S(a) + S(b)$ is the largest possible among all such pairs.
Let $S(x)$ be sum of digits in base 10 representation of $x$ , for example, $S(123) = 1 + 2 + 3 = 6$ , $S(0) = 0$ .
Your task is to find two integers $a, b$ , such that $0 \leq a, b \leq n$ , $a + b = n$ and $S(a) + S(b)$ is the largest possible among all such pairs.
输入格式
The only line of input contains an integer $n$ $(1 \leq n \leq 10^{12})$ .
输出格式
Print largest $S(a) + S(b)$ among all pairs of integers $a, b$ , such that $0 \leq a, b \leq n$ and $a + b = n$ .
输入输出样例
输入 #1
35
输出 #1
17
输入 #2
10000000000
输出 #2
91
In the first example, you can choose, for example, $a = 17$ and $b = 18$ , so that $S(17) + S(18) = 1 + 7 + 1 + 8 = 17$ . It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, $a = 5000000001$ and $b = 4999999999$ , with $S(5000000001) + S(4999999999) = 91$ . It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, $a = 5000000001$ and $b = 4999999999$ , with $S(5000000001) + S(4999999999) = 91$ . It can be shown that it is impossible to get a larger answer.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted