zoukankan      html  css  js  c++  java
  • poj-1146 ID codes

    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
    题目大意:
    一组字符全排列,如果有下一个全排列则则输出 若无,则输出NO;
    注意:
    在STL中有个next_permutation(const *str,int length);函数。若有下一个全排列则返回true并生成下一个全排列,
    反之返回false;
    <a href="www.baidu.com">这儿</a>
    #include<iostream>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int  permutation(char str[],int length)
    {   int j=0;
      //  sort(str,str+length);
    
            while(next_permutation(str,str+length))
                {
            for(int i=0;i<length;i++)
            cout<<str[i];
    
            cout<<endl;
            j++;
            break;
    
            }
            return j;
    }
    int main ()
    {
    while(1)
    {
    
    char str[100];
    cin>>str;
    if(str[0]=='#')break;
    int len=strlen(str);
    int q=permutation(str,len);
    if(!q)cout<<"No Successor"<<endl;
    }
    
    return 0;
    }
    

      

  • 相关阅读:
    优秀大数据GitHub项目一览
    自定义组件-BreadcrumbTreeView 的使用
    IOS中的属性列表----Property List
    即时通讯之smack客户端配置
    Android studio 使用问题汇总
    触摸事件UITouch的应用
    Android界面设计之对话框——定制Toast、AlertDialog
    android_orm框架之greenDAO(一)
    火速提升Android仿真器的运行速度 ——仿真器Genymotion
    Android 中的缓存机制与实现
  • 原文地址:https://www.cnblogs.com/jin-nuo/p/5380273.html
Copyright © 2011-2022 走看看