uva146(排序)
来源:互联网 发布:哪个网游用mac 编辑:程序博客网 时间:2024/05/22 23:39
http://vjudge.net/vjudge/problem/viewProblem.action?id=19158
[Submit] [Go Back] [Status]
Description
ID Codes
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 and Output
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 will consist of one line for each code read containing the successor code or the words `No Successor'.
Sample input
abaacbcbbaa#
Sample output
ababacNo Successor
#include <iostream>#include <cstring>using namespace std;int main(){ char str[60]; while(cin>>str,str[0]!='#') { int len=strlen(str); int f=0; for(int i=len-1; i>=0; i--) { for( j=i-1; j>=0; j--) if(str[i]>str[j]) { f=1; break; } if(f) break; } if(f==0) { cout<<"No Successor"<<endl; continue; } else { for(int k=0; k<j; k++) cout<<str[k]; cout<<str[i]; str[i]=126; int n=j; for(; j<len-1; j++) { char ch=126; int f=j,k; for( k=n; k<len; k++) if(ch>str[k]) { ch=str[k]; f=k; } str[f]=126; if(f!=i) cout<<ch; } cout<<endl; } } return 0;}
- uva146(排序)
- uva146
- uva146
- uva146
- uva146
- UVA146
- UVa146
- uva146
- UVa146 ID Codes (排列)
- uva146 ID Codes
- UVA146 ID Codes
- UVA146 ID codes
- uva146 ID codes
- uva146--求下一个排列
- uva146(简单题)-全排列
- UVA146生成可重集的下一个排列
- UVA146 POJ1146 ID Codes【全排列】
- 排序(希尔排序)
- Android利用Java对视频进行加密
- 二叉排序树的查找、插入、删除、建立
- hdu 1528 Card Game Cheater(二分图最大匹配)
- 字典树 HDU-1251统计难题
- Ubuntu下安装 JDK
- uva146(排序)
- Android中Cursor类(自己将网上搜索到的的整合再次编写了一下)
- OC中动态创建可变数组的问题.有一个数组,数组中有13个元素,先将该数组进行分组,每3个元素为一组,分为若干组,最后用一个数组统一管理这些分组.(要动态创建数组).两种方法
- CONVERGE v2.2.0 DateCode 16072014 Win64 1CD流体动力学(CFD)计算软件
- MicroSurvey FieldGenius v7.0.0.0 1CD高级测量勘测软件
- 这是一个起点
- mac 开发者常用工具
- Bentley Rail Track V8i 08.11.07.615 1CD三维铁路轨道设计软件
- Android程序调试–LogCat按照日志信息级别进行输出和过滤