| Submit | All submissions | Best solutions | Back to list |
EICBNLOCK - Combination Lock |
Phuc as a combination block which is represented by n rotating disks with digits from 0 to 9 written on them. He has to turn some disks so that the combination of digits on the disks forms a secret combination. In one move, he can rotate one disk one digit forwards or backwards. In particular, in one move he can go from digit 0 to digit 9 and vice versa. What minimum number of actions does he need for that?
Input
Input description...
Output
Output description...
Example
Input: 5 82195 64723 Output: 13
| Added by: | Ha Minh Ngoc |
| Date: | 2022-05-23 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG FSHARP GO JAVA JS-MONKEY NODEJS PHP PYTHON PYPY PYPY3 PYTHON3 RUBY SQLITE SWIFT VB.NET |
RSS