poj 1850----Code

这道题看了2天，还看了大牛的解题报告，现在才懂了，网上很多说数位dp可解，可咱学的渣，用数学知识才解出来。总结一下：

 

 

1，原来组合数得性质2就是杨辉三角，开始也就看了一样，直到作这题时才真正理解。

C(n,r)==C(n,n-r);

C(n,k)==C(n-1,k)+C(n-1,k-1);

2,先打表，把1-26的所有字母的组合数都打出来。

 

 

我觉得最难的是原来字符串和同等长度的字符串组合数的比较，很难理解，我也是看大牛的题解才写出来的

 

 

感想：老师之前说过一个题，很难！他却说：这就是水题的标准。现在才知道原来如此，本题我觉得很难，如果比赛的话，90%做不出来，10%做出来的可能是和这题类似，而我还没忘！而网上的那些大牛们直接说水体，简单组合数学！感谢小优姐，是看她的博客理解的！也是大牛！

Description

Transmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associated to a character sequence. It is considered that the words are made only of small characters of the English alphabet a,b,c, ..., z (26 characters). From all these words we consider only those whose letters are in lexigraphical order (each character is smaller than the next character).

The coding system works like this: 
• The words are arranged in the increasing order of their length.
• The words with the same length are arranged in lexicographical order (the order from the dictionary). 
• We codify these words by their numbering, starting with a, as follows:
a - 1   
b - 2
...
z - 26
ab - 27
...
az - 51
bc - 52
...
vwxyz - 83681
...

Specify for a given word if it can be codified according to this coding system. For the affirmative case specify its code. 

Input

The only line contains a word. There are some constraints:
• The word is maximum 10 letters length
• The English alphabet has 26 characters.

 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int zuhe[27][27];
void yh()
{
    for(int i=0;i<27;i++)
    {
        for(int j=0;j<=i;j++)
        {
            if(!i||i==j)
            zuhe[i][j]=1;
            else
            zuhe[i][j]=zuhe[i-1][j-1]+zuhe[i-1][j];
        }
    }
}
int main()
{
    yh();
    char str[15];
    int i;
    while(scanf("%s",str)!=EOF)
    {
        int sum=0;
        int len=strlen(str);
        for(i=1;i<len;i++)
        {
            if(str[i]<str[i-1])
            {
                printf("0\n");
                return 0;
            }
        }
        for(i=1;i<len;i++)
        {
            sum+=zuhe[26][i];
        }
        for(i=0;i<len;i++)
        {
            if(i==0)
            {
                char ch='a';
                while(ch<str[i])
                {
                    sum+=zuhe['z'-ch][len-1];
                    ch++;
                }
            }
            else
            {
                char ch=str[i-1]+1;
                while(ch<str[i])
                {
                    sum+=zuhe['z'-ch][len-1-i];
                    ch++;
                }
            }
        }
        printf("%d\n",sum+1);
    }
}