zoukankan      html  css  js  c++  java
  • poj1496——组合数学

    poj1496——组合数学

    Word Index
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 4740   Accepted: 2692

    Description

    Encoding schemes are often used in situations requiring encryption or information storage/transmission economy. Here, we develop a simple encoding scheme that encodes particular types of words with five or fewer (lower case) letters as integers. 

    Consider the English alphabet {a,b,c,...,z}. Using this alphabet, a set of valid words are to be formed that are in a strict lexicographic order. In this set of valid words, the successive letters of a word are in a strictly ascending order; that is, later letters in a valid word are always after previous letters with respect to their positions in the alphabet list {a,b,c,...,z}. For example, 

    abc aep gwz 

    are all valid three-letter words, whereas 

    aab are cat 

    are not. 

    For each valid word associate an integer which gives the position of the word in the alphabetized list of words. That is: 

    a -> 1
    b -> 2
    .
    .
    z -> 26
    ab -> 27
    ac -> 28
    .
    .
    az -> 51
    bc -> 52
    .
    .
    vwxyz -> 83681

    Your program is to read a series of input lines. Each input line will have a single word on it, that will be from one to five letters long. For each word read, if the word is invalid give the number 0. If the word read is valid, give the word's position index in the above alphabetical list. 

    Input

    The input consists of a series of single words, one per line. The words are at least one letter long and no more that five letters. Only the lower case alphabetic {a,b,...,z} characters will be used as input. The first letter of a word will appear as the first character on an input line. 

    The input will be terminated by end-of-file.

    Output

    The output is a single integer, greater than or equal to zero (0) and less than or equal 83681. The first digit of an output value should be the first character on a line. There is one line of output for each input line.

    Sample Input

    z
    a
    cat
    vwxyz

    Sample Output

    26
    1
    0
    83681
    和1850一样的题。。。
    #include<iostream>
    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    #include<algorithm>
    
    using namespace std;
    
    const int maxn=1000100;
    const int INF=(1<<28);
    
    string str;
    int code;
    int C[30][30];
    
    void creat_C()
    {
        memset(C,0,sizeof(C));
        for(int i=0;i<=28;i++){
            for(int j=0;j<=i;j++){
                if(j==0||j==i) C[i][j]=1;
                else C[i][j]=C[i-1][j-1]+C[i-1][j];
            }
        }
    }
    
    int main()
    {
        creat_C();
        while(cin>>str){
            bool flag=1;
            for(int i=0;i<str.length()-1;i++){
                if(str[i]>=str[i+1]){
                    cout<<0<<endl;
                    flag=0;
                }
            }
            if(!flag) continue;
            code=0;
            int len=str.length();
            for(int i=1;i<=len-1;i++){
                code+=C[26][i];
            }
            for(int i=0;i<len;i++){
                char ch=i?str[i-1]+1:'a';//ch至少要比前一个大
                for(;ch<str[i];ch++){
                    code+=C['z'-ch][len-i-1];
                }
            }
            cout<<code+1<<endl;
        }
        return 0;
    }
    View Code
    没有AC不了的题,只有不努力的ACMER!
  • 相关阅读:
    洛谷 P1048 采药
    一本通 1267:【例9.11】01背包问题
    一本通 1265:【例9.9】最长公共子序列
    一本通 1282:最大子矩阵
    一本通 1285:最大上升子序列和
    一本通 1284:摘花生
    一本通 1283:登山
    一本通 1264:【例9.8】合唱队形
    洛谷 P1126 机器人搬重物
    洛谷P1522 牛的旅行 Cow Tours
  • 原文地址:https://www.cnblogs.com/--560/p/4361323.html
Copyright © 2011-2022 走看看