A11111 | Luba And The Ticket
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Luba has a ticket consisting of $6$ digits. In one move she can choose digit in any position and replace it with arbitrary digit. She wants to know the minimum number of digits she needs to replace in order to make the ticket lucky.
The ticket is considered lucky if the sum of first three digits equals to the sum of last three digits.
The ticket is considered lucky if the sum of first three digits equals to the sum of last three digits.
输入格式
You are given a string consisting of $6$ characters (all characters are digits from $0$ to $9$ ) — this string denotes Luba's ticket. The ticket can start with the digit $0$ .
输出格式
Print one number — the minimum possible number of digits Luba needs to replace to make the ticket lucky.
输入输出样例
输入 #1
000000
输出 #1
0
输入 #2
123456
输出 #2
2
输入 #3
111000
输出 #3
1
In the first example the ticket is already lucky, so the answer is $0$ .
In the second example Luba can replace $4$ and $5$ with zeroes, and the ticket will become lucky. It's easy to see that at least two replacements are required.
In the third example Luba can replace any zero with $3$ . It's easy to see that at least one replacement is required.
In the second example Luba can replace $4$ and $5$ with zeroes, and the ticket will become lucky. It's easy to see that at least two replacements are required.
In the third example Luba can replace any zero with $3$ . It's easy to see that at least one replacement is required.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted