当前位置：Gxlcms > html代码 > CodeforcesRound#283(Div.2)--B.SecretCombination_html/css_WEB-ITnose

CodeforcesRound#283(Div.2)--B.SecretCombination_html/css_WEB-ITnose

时间：2021-07-01 10:21:17 帮助过：17人阅读

B. Secret Combination

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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.

Output

Print a single line containing n digits ? the desired state of the display containing the smallest possible number.

水题，把环展开成链，而且最多加9次，所以暴力就行

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;char str[3000];char ans[3000];int main(){	int n;	while (~scanf("%d", &n))	{		scanf("%s", str);		for (int i = n; i < 2 * n - 1; ++i)		{			str[i] = str[i - n];		}		str[2 * n - 1] = '\0';		for (int i = 0; i < n; ++i)		{			ans[i] = '9';		}		ans[n] = '\0';		int ret = 1;		while (ret <= 10)		{			for (int i = 0; i < n; ++i)			{				int cnt = 0;				bool flag = false;				while (ans[cnt] == '0')				{					cnt++;				}				int j = i;				while (str[j] == '0')				{					j++;				}				if (n - cnt > i + n - j)				{					flag = true;				}				else if (n - cnt == i + n - j)				{					for (int k = j; k < i + n; ++k)					{						if (ans[cnt] == str[k])						{							cnt++;						}						else if (ans[cnt] > str[k])						{							flag = true;							break;						}						else						{							break;						}					}				}				if (flag)				{					cnt = 0;					for (int k = i; k < i + n; ++k)					{						ans[cnt++] = str[k];					}				}				ans[n] = '\0';			}			for (int i = 0; i < 2 * n - 1; ++i)			{				int tmp = str[i] - '0';				tmp = (tmp + 1) % 10;				str[i] = tmp + '0';			}			str[2 * n - 1] = '\0';			ret++;		}		printf("%s\n", ans);	}	return 0;}

CodeforcesRound#283(Div.2)--B.SecretCombination_html/css_WEB-ITnose

人气教程排行