hbmy周赛1--E
2015-06-07 11:55
471 查看
E - Combination Lock
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
The combination lock is represented by n rotating disks with digits from 0 to 9 written on them. Scrooge McDuck 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
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of disks on the combination lock.
The second line contains a string of n digits — the original state of the disks.
The third line contains a string of n digits — Scrooge McDuck's combination that opens the lock.
Output
Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.
Sample Input
Input
Output
Hint
In the sample he needs 13 moves:
1 disk:
2 disk:
3 disk:
4 disk:
5 disk:
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Scrooge McDuck keeps his most treasured savings in a home safe with a combination lock. Each time he wants to put there the treasures that he's earned fair and square, he has to open the lock.
The combination lock is represented by n rotating disks with digits from 0 to 9 written on them. Scrooge McDuck 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
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of disks on the combination lock.
The second line contains a string of n digits — the original state of the disks.
The third line contains a string of n digits — Scrooge McDuck's combination that opens the lock.
Output
Print a single integer — the minimum number of moves Scrooge McDuck needs to open the lock.
Sample Input
Input
5 82195 64723
Output
13
Hint
In the sample he needs 13 moves:
1 disk:
2 disk:
3 disk:
4 disk:
5 disk:
#include <iostream> #include <cmath> using namespace std; int main() { int n; char a[1100]; char b[1100]; int flag= 0 ; cin >> n; for (int i=0; i<n; i++) cin >> a[i]; for (int j=0; j<n; j++) cin >> b[j]; int num = 0; for (int i=0; i<n; i++) { int p1 = (int)a[i]-48; int p2 = (int)b[i]-48; int p = p1-p2; flag = abs(p); if (flag>5) flag = 10-flag; num = num +flag; } cout << num << endl; return 0; }
相关文章推荐
- hbmy周赛1--E
- ActiveMQ入门实例
- PHPStorm常用快捷键
- GCC清除缓冲区
- WordPress Permissions Update Error [RESOLVED]
- 练习作品11:语音识别 准确度70%
- 偶然翻到大学时写的一篇论文
- Codeforces Round #306 (Div. 2) -- E. Brackets in Implications
- 多线程互斥,用到Synchronized
- Darwin流媒体服务器在windows下搭建
- 黑马程序员---java面向抽象/接口编程
- Storm入门之第8章事务性拓扑
- hbmy周赛1--D
- Storm入门之第8章事务性拓扑
- 我偏执,我要变
- android 调用系统界面
- hbmy周赛1--D
- HDU 3535 AreYouBusy
- oracle分页
- Storm入门之第8章事务性拓扑