[ACM] poj 1146 ID Codes(字符串的下一个排列)
来源:互联网 发布:淘宝考试软件破解版 编辑:程序博客网 时间:2024/05/17 08:19
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:
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.
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
abaacbcbbaa#
Sample Output
ababacNo Successor
Source
思路:
采用了next_permutation(a,a+len);这一函数。
代码:
#include <iostream>#include <string.h>#include <algorithm>using namespace std;char a[52],b[52];int main(){ while(cin>>a&&a[0]!='#') { int len=strlen(a); next_permutation(a,a+len); strcpy(b,a); sort(b,b+len); int flag=0; for(int i=0;i<len;i++) if(a[i]!=b[i]) flag=1; if(flag==0) cout<<"No Successor"<<endl; else cout<<a<<endl; } return 0;}
1 0
- [ACM] poj 1146 ID Codes(字符串的下一个排列)
- 【POJ】1146 - ID Codes(字符串下一个字典序)
- UVA 146 ID Codes(下一个排列)
- 暴力--下一个排列--ID Codes
- ACM POJ 1146 ID Codes
- POJ 1146 字符串的下一个全排列
- POJ 1146 求字符串的下一个排列
- uva 146 ID Codes(求下一个排列)水水水
- POJ 1146 ID Codes (生成排列)
- uva 146 ID Codes (下一个排列)
- Poj 1146 ID Codes + Poj 1833 排列 (全排列库函数)
- POJ 1146 ID Codes 求下一个字典序
- ID Codes(poj 1146)
- uva 146 ID Codes(下一个排列,水了一大笔呀)
- poj 1146 ID Codes
- POJ 1146 ID Codes
- poj 1146 ID Codes
- poj 1146 ID Codes
- 非接触CPU卡与非接触IC卡的区别是什么?
- java clone()
- maven中的 dependencies 和 dependencyManagement 的区别
- maven 子项目如何使用父项目的jar包
- csdn傻逼一样的存在
- [ACM] poj 1146 ID Codes(字符串的下一个排列)
- SuppressMessage
- DEDECMS 二次开发
- 【java技术提高】(1)-- 详解java的四舍五入与保留位
- Android - Download(下载) 项目 详解
- 操作系统面试题的整理
- mybaties基础教程之四:SQL语句映射文件(2)
- 什么是IC卡、M1卡,有啥区别
- 使用Stream类型的Result实现Ajax