B. Secret Combination
来源:互联网 发布:mac地址可以监控手机 编辑:程序博客网 时间:2024/04/28 02:40
You got a box with a combination lock. The lock has a display showing n digits. There are two buttons on the box, each button changes digits on the display. You have quickly discovered that the first button adds 1 to all the digits (all digits 9 become digits 0), and the second button shifts all the digits on the display one position to the right (the last digit becomes the first one). For example, if the display is currently showing number 579, then if we push the first button, the display will show 680, and if after that we push the second button, the display will show 068.
You know that the lock will open if the display is showing the smallest possible number that can be obtained by pushing the buttons in some order. The leading zeros are ignored while comparing numbers. Now your task is to find the desired number.
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of digits on the display.
The second line contains n digits — the initial state of the display.
Print a single line containing n digits — the desired state of the display containing the smallest possible number.
3579
024
42014
0142
/*题目大意:给一整数,有两种方式、1、每位加1,其中9变为0,但不进位。2、整体向后移动一位、最后一位移动到首位 *问经过若干操作1与2后得到的最小数是多少 *算法分析:可将环问题转换为链进行解决。然后每位累加,加10次依次进行比较即可,暴力完成 */#include <bits/stdc++.h>using namespace std;char a[2200];char b[2200], ans[2200];int main() {int n;scanf("%d ",&n);memset(a, 0, sizeof(a));memset(b, 0, sizeof(b));memset(ans, 0, sizeof(ans));for (int i = 0; i<n; i++)scanf("%c",&a[i]);strcpy(ans, a);//cout << ans << endl;for (int i = 0; i<n; i++)a[n+i] = a[i];int t = 0;while (t <= 9) {for (int i = 0; i<2*n; i++){int tmp = a[i] - 48;tmp = (tmp+1) % 10;a[i] ='0' + tmp;}//cout << a << endl;t ++ ;for (int i = 0; i<n; i++) {int flag = 0;for (int j = i; j<i+n; j++) b[flag++] = a[j];if (strcmp(ans, b) > 0)strcpy(ans, b);//cout << b << endl;}//cout << ans << endl;}cout << ans << endl;return 0;}
- B. Secret Combination
- B. Secret Combination
- CodeForces 496B Secret Combination
- CodeForces-496B Secret Combination
- codeforces 496B Secret Combination
- B. Secret Combination codeforces-problem-496B
- Codeforces Round #283 (Div. 2)---B. Secret Combination (暴力)
- 【CF-496B】Secret Combination(最小字符串表示法)
- Codeforces Round #283 (Div. 2)——B. Secret Combination
- Codeforces Round #283 (Div. 2) B. Secret Combination 构造+枚举
- Codeforces 496B Secret Combination(最小表示法)
- Code Forces 496 B. Secret Combination(水~)
- Codeforces Round #283 (Div. 2) A. Minimum Difficulty B. Secret Combination C. Removing Columns
- B. Combination
- Codeforces 155B Combination
- codeforces B. Combination(贪心)
- Secret
- Secret
- android - Dialog(未完待续)
- unserialize(),serialize(),__wakeup(),__sleep()函数
- Linux(Centos)之安装tomcat并且部署Java Web项目
- Intent传递URL参数
- 大话设计模式_职责链模式
- B. Secret Combination
- Chrome浏览器自动填充的表单如何去掉淡黄色背景???
- 【特征匹配】RANSAC算法原理与源码解析
- Linux Coredump信息收集
- hadoop起步之环境安装
- ProgressBar(进度条)
- 网页设计心得报告(4) by wrh
- tar.xz
- C++动态库获取自身路径