POJ - 1850 Code 组合数+模拟

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.

Output

The output will contain the code of the given word, or 0 if the word can not be codified.

Sample Input

bf

Sample Output

55

题解：后面的一定要比前面的大，模拟一下就可以了

#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
using namespace std;
int n,ans,k;
int a[105];
char s[110];
long long C[27][27];
int main()
{
	C[0][0]=1;C[1][0]=1;C[1][1]=1;
	for(int i=1;i<=26;i++)
	{
		C[i][0]=1;
		for(int j=0;j<=i;j++)
			C[i][j]=C[i-1][j]+C[i-1][j-1];
	}	
	while(~scanf("%s",s))
	{
		int len=strlen(s);
		int flag=0;
		for(int i=0;i<len-1;i++)
		{
			if(s[i]>=s[i+1])
			{
				cout<<"0"<<endl;
				flag=1;
				break;	
			}
		}
		if(flag) continue;
		long long  ans=0;
		for(int i=1;i<len;i++)
			ans+=C[26][i];
		for(int i=0;i<len;i++)
		{
			char op=(i==0)?'a':s[i-1]+1;
			while(op<s[i])
			{
		//		cout<<op<<endl;
				ans+=C[25-(op-'a')][len-1-i];
				op++;
			}
		}
		cout<<ans+1<<endl;	
	}
		return 0;
}