YTU OJ 1617: Quicksum

YTU OJ 1617: Quicksum

在这里插入图片描述

using System;
class Program
{
    
    
    static void Main(String[] agrs)
    {
    
    
        string num;
        method method = new method();
        while (String.IsNullOrEmpty(num = Console.ReadLine()) == false)
        {
    
    
            char[] str = num.ToCharArray();
            if (str[0] == '#')
                break;
            method.conp(num);
        }
    }
}
class method
{
    
    
    public void conp(string str)
    {
    
    
        char[] str1 = str.ToCharArray();
        var sum = 0;
        for (var i = 0; i < str1.Length; i++)
        {
    
    
            if (str1[i] == 'A')
            {
    
    
                sum += (i + 1) * 1;
            }
            if (str1[i] == 'B')
            {
    
    
                sum += (i + 1) * 2;
            }
            if (str1[i] == 'C')
            {
    
    
                sum += (i + 1) * 3;
            }
            if (str1[i] == 'D')
            {
    
    
                sum += (i + 1) * 4;
            }
            if (str1[i] == 'E')
            {
    
    
                sum += (i + 1) * 5;
            }
            if (str1[i] == 'F')
            {
    
    
                sum += (i + 1) * 6;
            }
            if (str1[i] == 'G')
            {
    
    
                sum += (i + 1) * 7;
            }
            if (str1[i] == 'H')
            {
    
    
                sum += (i + 1) * 8;
            }
            if (str1[i] == 'I')
            {
    
    
                sum += (i + 1) * 9;
            }
            if (str1[i] == 'J')
            {
    
    
                sum += (i + 1) * 10;
            }
            if (str1[i] == 'K')
            {
    
    
                sum += (i + 1) * 11;
            }
            if (str1[i] == 'L')
            {
    
    
                sum += (i + 1) * 12;
            }
            if (str1[i] == 'M')
            {
    
    
                sum += (i + 1) * 13;
            }
            if (str1[i] == 'N')
            {
    
    
                sum += (i + 1) * 14;
            }
            if (str1[i] == 'O')
            {
    
    
                sum += (i + 1) * 15;
            }
            if (str1[i] == 'P')
            {
    
    
                sum += (i + 1) * 16;
            }
            if (str1[i] == 'Q')
            {
    
    
                sum += (i + 1) * 17;
            }
            if (str1[i] == 'R')
            {
    
    
                sum += (i + 1) * 18;
            }
            if (str1[i] == 'S')
            {
    
    
                sum += (i + 1) * 19;
            }
            if (str1[i] == 'T')
            {
    
    
                sum += (i + 1) * 20;
            }
            if (str1[i] == 'U')
            {
    
    
                sum += (i + 1) * 21;
            }
            if (str1[i] == 'V')
            {
    
    
                sum += (i + 1) * 22;
            }
            if (str1[i] == 'W')
            {
    
    
                sum += (i + 1) * 23;
            }
            if (str1[i] == 'X')
            {
    
    
                sum += (i + 1) * 24;
            }
            if (str1[i] == 'Y')
            {
    
    
                sum += (i + 1) * 25;
            }
            if (str1[i] == 'Z')
            {
    
    
                sum += (i + 1) * 26;
            }
            if (str1[i] == ' ')
            {
    
    
                sum += (i + 1) * 0;
            }
        }
        Console.WriteLine(sum);
    }
}

猜你喜欢

转载自blog.csdn.net/henishu/article/details/115143479