ACM: 一题组合数学题 poj1850 (头…
来源:互联网 发布:淘宝网店加盟哪家好 编辑:程序博客网 时间:2024/05/19 02:05
Description
Transmitting and memorizing information is a task that requiresdifferent coding systems for the best use of the available space. Awell known system is that one where a number is associated to acharacter sequence. It is considered that the words are made onlyof small characters of the English alphabet a,b,c, ..., z (26characters). From all these words we consider only those whoseletters are in lexigraphical order (each character is smaller thanthe next character).
The coding system works like this:
• The words are arranged in the increasing order of theirlength.
• The words with the same length are arranged in lexicographicalorder (the order from the dictionary).
• We codify these words by their numbering, starting with a, asfollows:
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 thiscoding 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 theword can not be codified.
Sample Input
bf
Sample Output
55
题意: 给出一段字符串,计算相应的合法组合.(定义在上文给出:规定后面的字母都比前面的大)
个人思路:
代码:
#include <cstdio>
#include <iostream>
#include <string.h>
using namespace std;
#define MAX 27
int c[MAX][MAX];
void zuhe()
{
}
int main()
{