CodeForces 540A Combination Lock
来源:互联网 发布:动态壁纸软件下载 编辑:程序博客网 时间:2024/06/06 20:24
Combination Lock
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:
题意是有一把环形密码锁,给一个错误密码,一个正确密码,问最少转动多少次可以解锁。
密码锁是10位循环0,1,2,3,4,5,6,7,8,9//0,1,2,3,4,5,6,7… …
此题唯一要考虑的是什么时候选择正序旋转,什么时候倒序旋转,可以得知5为分界点
AC
#include <cstdio>int main(){ int n; scanf("%d",&n); int a[n];//测试密码 int b[n];//正确密码 char s1[n]; char s2[n]; scanf("%s",s1); scanf("%s",s2); for(int i=0; i<n; i++) { a[i]=s1[i]-48; b[i]=s2[i]-48; } int sum=0; for(int i=0; i<n; i++) { if(a[i]>b[i]) { if(a[i]-b[i]<=5) sum+=a[i]-b[i]; else if(a[i]-b[i]>5) sum+=b[i]+10-a[i]; } else if(a[i]<b[i]) { if(b[i]-a[i]<=5) sum+=b[i]-a[i]; else if(b[i]-a[i]>5) sum+=a[i]+10-b[i]; } } printf("%d",sum);}
- CodeForces 540A Combination Lock
- CodeForces 540A Combination Lock
- CodeForces 540A Combination Lock
- CodeForces 540A Combination Lock
- codeforces A. Combination Lock 贪心
- codeforces——540A——Combination Lock
- CodeForces—301A—Combination Lock
- coderforce 540A Combination Lock
- Codeforces Combination Lock
- contest: Codeforces Round #301 (Div. 2), problem: (A) Combination Lock
- A. Combination Lock
- #301 (div.2) A. Combination Lock
- Combination Lock
- Combination Lock
- CodeForces-131A-cAPS lOCK
- CodeForces 131A cAPS lOCK
- CodeForces 131A cAPS lOCK
- codeforces 131A cAPS lOCK
- Glide框架使用笔记
- VirtualBox安装问题
- 云南IPTV机顶盒分公司测试用例
- 跳转至系统网络设置界面
- 前端构建之bower、gulp
- CodeForces 540A Combination Lock
- IPTV机顶盒测试方法
- linux文本处理 sort,grep,sed,awk,uniq 用法
- C++第一天,命令框编译源文件方法
- Android事件分发机制完全解析,带你从源码的角度彻底理解(下)
- hdu 4435 charge-station【暴力+Bfs】
- 机器学习算法比较
- 常用DOS命令
- POI操作Excel