zoukankan      html  css  js  c++  java
  • hdu Code 组合数学

    Problem 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. 
     
    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
    ***************************************************************************************************************************************************************************************************************
    组合数学
    详细解释
    数学推理
    *****************************************************************************************************************************************************************************************************************
     1 #include <iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 using namespace std;
     5 int c[27][27];
     6 void init()//初始化组合数
     7 {
     8    int i,j;
     9    for(i=0;i<=26;i++)
    10    {
    11        for(j=0;j<=i;j++)
    12        {
    13            if(!j||i==j)
    14            c[i][j]=1;
    15            else
    16            c[i][j]=c[i-1][j-1]+c[i-1][j];
    17        }
    18    }
    19    return;
    20 }
    21 int main()
    22 {
    23     init();
    24     char s[17];
    25     int i,j;
    26     scanf("%s",s);
    27     int len=strlen(s);
    28     for(i=1;i<len;i++)
    29     {
    30          if(s[i-1]>=s[i])//不满足条件
    31          {
    32              printf("0
    ");
    33              return 0;
    34          }
    35     }
    36     int sum=0;
    37     for(i=1;i<len;i++)//把前面不等长的加起来
    38     {
    39          sum+=c[26][i];
    40     }
    41    for(i=0;i<len;i++)//这时等长
    42    {
    43         char ch=(i==0?'a':s[i-1]+1);
    44         while(ch<=s[i]-1)//需要枚举相加
    45         {
    46              sum+=c['z'-ch][len-1-i];
    47             ch++;
    48         }
    49    }
    50       printf("%d
    ",sum+1);
    51     return 0;
    52 }
    View Code
  • 相关阅读:
    箭头函数1
    变量结构赋值
    警惕32位程序在MethodImplOptions.Synchronized在x64机器上的同步缺陷[z]
    ListView的BeginUpdate()和EndUpdate()作用[z]
    如何用命令将本地项目上传到git[z]
    C# 两个datatable中的数据快速比较返回交集或差集[z]
    C# DataTable抽取Distinct数据(不重复数据)[z]
    【Thread】CountdownEvent任务并行[z]
    C#多线程--信号量(Semaphore)[z]
    VS2015一新建项目就出现未将对象引用设置到对象的实例怎么办?[z]
  • 原文地址:https://www.cnblogs.com/sdau--codeants/p/3525947.html
Copyright © 2011-2022 走看看