UVa 146 ID Codes (next_permutation函数)
来源:互联网 发布:提醒生日的软件 编辑:程序博客网 时间:2024/04/30 01:57
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
题目描述:生成一串字符的下一个字典序排列。使用<algorithm>中的next_permutation函数。
该函数返回true并把输入转化成下一字典序排列,如果这样的排列存在。否则返回false。
/*PROG: UVa146*/#include <string>#include <iostream>#include <algorithm>using namespace std;int main(void) {while (1) {string in; cin >> in;if (in == "#") break;if (!next_permutation(in.begin(), in.end()))cout << "No Successor\n";else cout << in << endl;}return 0;}
- UVa 146 ID Codes (next_permutation函数)
- UVa 146 ID Codes
- uva 146 - ID Codes
- UVa 146 ID Codes
- uva 146 - ID Codes
- UVa 146 - ID Codes
- uva-146 - ID Codes
- UVa 146 - ID Codes
- Uva 146 - ID Codes
- UVa 146 - ID Codes
- uva 146 ID Codes
- uva 146 ID Codes
- uva 146 ID Codes
- ID Codes UVA 146
- uva 146 ID Codes
- uva - 146 - ID Codes
- UVa 146 - ID Codes
- uva 146 - ID Codes
- 数据仓库技术中的MPP
- scrollview嵌套问题
- spark 安装配置记录
- 汇编速查-IA32寄存器组织
- CAS扩展——自定义查询数据库验证Handler
- UVa 146 ID Codes (next_permutation函数)
- pcap数据包转换成netflow
- 用Matlab画散点图
- JavaScript 里面数组下标可以是负值问题
- SSH问题集(一) spring和struts整合配置文件问题
- maven dao和service工程,spring 扫描jar中配置文件nullpointer的问题
- Linux常用Shell脚本珍藏
- [数论] 51Nod 1225 余数之和
- 源码方式安装postgresql