305592: CF1060B. Maximum Sum of Digits
Memory Limit:512 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Maximum Sum of Digits
题意翻译
记 $S(x)=$ $x\text{的各个数位之和}$。 例如:$S(123)=1+2+3=6$,$S(0)=0$。 给定整数 $n\ \left(1 \le n \le 10^{12}\right)$ ,求一对自然数 $a, b\ (0 \le a, b \le n)$,使得 $S(a)+S(b)$ 最大。输出这个最大值。题目描述
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.输入输出格式
输入格式
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