久久久久久久国产免费看,激情伊人五月天久久综合,AV无码久久久久不卡网站下载

HDU 2734 Quicksum ��单字�W�串处理

Vontroy — Sun, 03 Oct 2010 02:03:00 GMT

Quicksum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 492 Accepted Submission(s): 408

Problem Description

A checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum will also change, so checksums are often used for detecting transmission errors, validating document contents, and in many other situations where it is necessary to detect undesirable changes in data.

For this problem, you will implement a checksum algorithm called Quicksum. A Quicksum packet allows only uppercase letters and spaces. It always begins and ends with an uppercase letter. Otherwise, spaces and letters can occur in any combination, including consecutive spaces.

A Quicksum is the sum of the products of each character's position in the packet times the character's value. A space has a value of zero, while letters have a value equal to their position in the alphabet. So, A=1, B=2, etc., through Z=26. Here are example Quicksum calculations for the packets "ACM" and "MID CENTRAL":

ACM: 1*1 + 2*3 + 3*13 = 46MID CENTRAL: 1*13 + 2*9 + 3*4 + 4*0 + 5*3 + 6*5 + 7*14 + 8*20 + 9*18 + 10*1 + 11*12 = 650

Input

The input consists of one or more packets followed by a line containing only # that signals the end of the input. Each packet is on a line by itself, does not begin or end with a space, and contains from 1 to 255 characters.

Output

For each packet, output its Quicksum on a separate line in the output.

Sample Input

ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#

Sample Output

#include <iostream>
#include <cstdio>
#include <cstring>

int main()
{
    char str[260];
    int ans = 0;
    while( gets(str) && str[0] != '#' )
    {
        ans = 0;
        int len = strlen(str);
        for( int i = 0; i < len; i++ )
        {
            if( str[i] == ' ' )
                continue;
            else
                ans += ( str[i] - 64 ) * ( i + 1 );
        }
        std::cout << ans << std::endl;
    }
    return 0;
}

Vontroy 2010-10-03 10:03 发表评论

POJ 1007 DNA Sorting 字符串处理|�E�_��排序

Vontroy — Sat, 02 Oct 2010 13:23:00 GMT

/*****************
字符串处�?br />�E�_��排序
******************/

#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

struct DNA
{
    int pos;
    int cnt;
    string str;
};

bool cmp(const DNA &a, const DNA &b)
{
    if (a.cnt != b.cnt)
    {
        return a.cnt < b.cnt;
    }
    else
    {
        return a.pos < b.pos;
    }
}

int main()
{
    int n, m, count;
    DNA ans[110];
    string str;
    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        cin >> str;
        count = 0;

        for (int j = 0; j < n - 1; j++)
            for (int k = j + 1; k < n; k++)
                if (str[j] > str[k]) count++;

        ans[i].str = str;
        ans[i].cnt = count;
        ans[i].pos = i;
    }

    sort(ans, ans + m, cmp);

    for (int i = 0; i < m; i++)
        cout << ans[i].str << endl;

    return 0;
}

Vontroy 2010-10-02 21:23 发表评论

Vontroy — Sat, 02 Oct 2010 11:21:00 GMT

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>

const int maxn = 20000;
const int MAXN = 100000+10;

using std :: string;
using std :: cout;
using std :: endl;

int main()
{
    string ans[MAXN];
    char tel[maxn];
    char store[maxn];
    int n;
    bool ok;
   while(~ scanf("%d",&n))
    {
        ok = false;
        int count = 0;
        while(n--)
        {
            scanf("%s",tel);
            int j;
            for(int i = 0,j = 0; tel[i] != '\0'; i++)
            {
                if(tel[i]-'0'>=0&&tel[i]-'0'<=9)
                      store[j++] = tel[i];
                else if(tel[i] != '-' && j != 3 )
                {
                    //ans[count]+='2';
                    if(tel[i]=='A'||tel[i]=='B'||tel[i]=='C')
                            store[j++] = '2';
                    else if(tel[i]=='D'||tel[i]=='E'||tel[i]=='F')
                            store[j++] = '3';
                    else if(tel[i]=='G'||tel[i]=='H'||tel[i]=='I')
                            store[j++] = '4';
                    else if(tel[i]=='J'||tel[i]=='K'||tel[i]=='L')
                            store[j++] = '5';
                    else if(tel[i]=='M'||tel[i]=='N'||tel[i]=='O')
                            store[j++] = '6';
                    else if(tel[i]=='P'||tel[i]=='R'||tel[i]=='S')
                            store[j++] = '7';
                    else if(tel[i]=='T'||tel[i]=='U'||tel[i]=='V')
                            store[j++] = '8';
                    else if(tel[i]=='W'||tel[i]=='X'||tel[i]=='Y')
                            store[j++] = '9';
                }
                if( j==3 )  store[j++]='-';
            }
            ans[count++] = store;
        }
        std :: sort(ans,ans+count);
        int ans_count;
        for(int i = 0; i < count; i++)
        {
             ans_count = 1;
             for(int j = i + 1; j < count; j++)
             {
                 if(ans[j]==ans[i]) ans_count++;
                 else break;
             }
             if(ans_count > 1)
             {
                 ok = true;
                 cout << ans[i] << " " << ans_count << endl;
                 i+=(ans_count-1);
             }
        }
        if(!ok)  cout << "No duplicates." << endl;

        //for(int i = 0; i         //std :: cout << ans[i] << std :: endl;
    }
    return 0;
}

Vontroy 2010-10-02 19:21 发表评论

久久久久久久国产免费看,激情伊人五月天久久综合,AV无码久久久久不卡网站下载

HDU 2734 Quicksum ���单字�W�串处理

Quicksum

POJ 1007 DNA Sorting 字符串处理|�E�_��排序

HDU 2734 Quicksum ��单字�W�串处理