zoukankan      html  css  js  c++  java
  • UVA 146 ID Codes(下一个排列)


    C - ID Codes
    Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu
    Appoint description: 

    Description

    Download as PDF


     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

    abaacb
    cbbaa
    #

    Sample output

    ababac
    No Successor

    #include<iostream>
    #include<algorithm>
    #include<stdio.h>
    #include<queue>
    #include<vector>
    #include<string.h>
    #include<map>
    using namespace std;
    int main()
    {
        //freopen("in.txt","r",stdin);
        char s[60];
        while(gets(s)!=NULL){
            if(!strcmp(s,"#"))return 0;
            int len=strlen(s);
            int solve=0;
            for(int i=len-2;!solve&&i>=0;i--)
            for(int j=len-1;j>i;j--)
            {
                if(s[j]>s[i]){
                    solve=1;
                    char t=s[i];
                    s[i]=s[j];
                    s[j]=t;
                    sort(s+i+1,s+len);
                    break;
                }
            }
            if(solve)puts(s);
            else puts("No Successor");
        }
        return 0;
    }

    STL

    #include<iostream>
    #include <algorithm>
    #include <cstdio>
    #include <cstring>
    using namespace std;
    char s[50];
    int main()
    {
    	while(gets(s) != NULL && s[0] != '#')
    	{
    		if(next_permutation(s, s + strlen(s)))
    			printf("%s
    ", s);
    		else
    			printf("No Successor
    ");
    	}
    	return 0;
    }
    







  • 相关阅读:
    [Golang学习笔记] 06 程序实体3 类型断言和类型转换
    [Golang学习笔记] 05 程序实体2 作用域访问权限和变量重声明
    [Golang学习笔记] 04 程序实体1 变量声明
    [Golang学习笔记] 03 库源码文件
    virgo-tomcat-server的生产环境线上配置与管理
    virgo-tomcat-server最大并发连接数的修改
    linux系统下kvm虚拟机的安装
    关于virgo-tomcat-server-3.6.0.RELEASE配置文件修改说明
    关于在Linux下apache-maven的安装
    H3C系列之三层交换机文件管理
  • 原文地址:https://www.cnblogs.com/yangykaifa/p/6744991.html
Copyright © 2011-2022 走看看