Code
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 7475 | Accepted: 3495 |
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.
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.
• 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
Source
真心推不出来,详见大神博客链接。
点击打开链接
#include<stdio.h>
#include<string.h>
#define M 26
#include<iostream>
using namespace std;
int p[M+1][M+1]={0};
char s[17];
void init()
{
for(int i=0; i<=M; i++)
for(int j=0; j<=i; j++)
if(!j||i==j)
p[i][j]=1;
else p[i][j]=p[i-1][j-1]+p[i-1][j];
p[0][0]=0;
}
int main()
{
init();
while(cin>>s)
{
int len=strlen(s);
for(int i=1; i<len; i++)
if(s[i]<=s[i-1])
{
printf("0\n");
return 0;
}
int sum=0;
for(int i=1; i<len; i++)
sum+=p[26][i];
for(int i=0; i<len; i++)
{
char ch=(!i)?'a':s[i-1]+1;
while(ch<=s[i]-1)
{
sum+=p['z'-ch][len-1-i];
ch++;
}
}
printf("%d\n",sum+1);
}
return 0;
}