STL的next_permutation函数
来源:互联网 发布:图书数据加工公司招聘 编辑:程序博客网 时间:2024/06/03 11:18
【STL】next_permutation的原理和使用
使用STL的next_permutation函数生成全排列(C++)
A - ID Codes
POJ - 1146
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 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'.
abaacbcbbaa#
ababacNo Successor
题意就是:给一个字符串,求下一个字典序;
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int main(){char s[60];while(cin>>s&&s[0]!='#'){int len=strlen(s);if(next_permutation(s,s+len)){cout<<s<<endl;}elsecout<<"No Successor"<<endl;}return 0;}
0 0
- STL的next_permutation函数
- hdu1716 STL next_permutation函数的使用
- 【STL】next_permutation函数用法
- C++STL的next_permutation
- 使用stl的next_permutation
- 【STL】next_permutation的实现
- C++STL的next_permutation
- C++STL的next_permutation
- STL中的next_permutation函数用法
- STL/next_permutation()和prev_permutation()函数
- 《STL源码剖析》--next_permutation函数
- 使用STL的next_permutation函数生成全排列(C++)
- 使用STL的next_permutation函数生成全排列(C++)
- 使用STL的next_permutation函数生成全排列(C++)
- 使用STL的next_permutation函数生成全排列(C++)
- 使用STL的next_permutation函数生成全排列(C++)
- 使用STL的next_permutation函数生成全排列(C++)
- 使用STL的next_permutation函数生成全排列(C++)
- 利用jquery ui实现微信底部的二级下拉菜单
- CenOS7上网络组team的实现
- 系列:1到1000中包含8的个数
- Kubernetes1.6安装指南 (二进制文件方式)
- 二叉树的三种遍历(前序,中序,后序)
- STL的next_permutation函数
- Java基本数据类型转换
- vijos P1005 超长数字串 解题报告
- Mask RCNN in TensorFlow
- 关于js中两种定时器的设置及清除
- 系统监控利器-dstat命令(1)
- 面试准备
- HDU6027-Easy Summation-简单数学
- 银行家算法