CF988E.Divisibility by 25
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given an integer n from 1 to 1018 without leading zeroes.
In one move you can swap any two adjacent digits in the given number in such a way that the resulting number will not contain leading zeroes. In other words, after each move the number you have cannot contain any leading zeroes.
What is the minimum number of moves you have to make to obtain a number that is divisible by 25 ? Print -1 if it is impossible to obtain a number that is divisible by 25 .
输入格式
The first line contains an integer n ( 1≤n≤1018 ). It is guaranteed that the first (left) digit of the number n is not a zero.
输出格式
If it is impossible to obtain a number that is divisible by 25 , print -1. Otherwise print the minimum number of moves required to obtain such number.
Note that you can swap only adjacent digits in the given number.
输入输出样例
输入#1
5071
输出#1
4
输入#2
705
输出#2
1
输入#3
1241367
输出#3
-1
说明/提示
In the first example one of the possible sequences of moves is 5071 → 5701 → 7501 → 7510 → 7150.