ID Codes
Problem Description
It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, the Government decides on a radical measure–all citizens are to have a tiny microcomputer surgically implanted in their left wrists. This computer will contains all sorts of personal information as well as a transmitter which will allow people’s movements to be logged and monitored by a central computer. (A desirable side effect of this process is that it will shorten the dole queue for plastic surgeons.)
An essential component of each computer will be a unique identification code, consisting of up to 50 characters drawn from the 26 lower case letters. The set of characters for any given code is chosen somewhat haphazardly. The complicated way in which the code is imprinted into the chip makes it much easier for the manufacturer to produce codes which are rearrangements of other codes than to produce new codes with a different selection of letters. Thus, once a set of letters has been chosen all possible codes derivable from it are used before changing the set.
For example, suppose it is decided that a code will contain exactly 3 occurrences of a', 2 of
b’ and 1 of `c’, then three of the allowable 60 codes under these conditions are:
abaabc
abaacb
ababac
These three codes are listed from top to bottom in alphabetic order. Among all codes generated with this set of characters, these codes appear consecutively in this order.
Write a program to assist in the issuing of these identification codes. Your program will accept a sequence of no more than 50 lower case letters (which may contain repeated characters) and print the successor code if one exists or the message `No Successor’ if the given code is the last in the sequence for that set of characters.
Input
Input will consist of a series of lines each containing a string representing a code. The entire file will be terminated by a line consisting of a single #.
Output
Output will consist of one line for each code read containing the successor code or the words ‘No Successor’
Sample Input
abaacb
cbbaa
Sample Output
ababac
No Successor
**分析:**该题应用的为字典序,按照从小到大的顺序排列,其思路是,先从字符串的右端向左寻找,找到第一个左边比右边小的位置记为a,然后再次从左向右遍历字符串,找到第一个比a位置大的位置记为b,交换a,b的内容,然后把a位置右边的字符串按从小到大的顺序排列
示例代码:
#include<stdio.h>
#include<string.h>
void change(char *p,int a,int b)
{
char c = p[a];
p[a] = p[b];
p[b] = c;
return;
}
void pailie(char *p, int n)//将p[n]后面的按从小到大排序
{
int i, j;
int m = strlen(p);
char c;
for (j = 0; j < m - n; j++)//冒泡排序
{
for (i = n + 1; i < m - 1; i++)//位置n后面的排
if (p[i] > p[i + 1])
{
c = p[i];
p[i] = p[i + 1];
p[i + 1] = c;
}
}
return;
}
int main(void)
{
char in[50];
int a, b, i,n;
while(scanf("%s",in),in[0]!='#')
{
n = strlen(in);
for (i = n - 1; i > 0; i--)//从右向在找
if (in[i - 1] < in[i])//找到第一个左边比右边大的数
{
a = i - 1;//将这个小的位置记为a
break;
}
if (i == 0)
{
printf("No Successor\n");
continue;
}
for (i = n - 1; i > a; i--)//从右向左找
if (in[i] > in[a])//找到第一个比p[a]大的
{
b = i;//记为b
break;
}
change(in, a, b);//交换a,b
pailie(in, a);//a后面的按由小到大排
printf("%s", in);
}
return 0;
}