7-128 4011 检验和

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

i32 get_value(char a)
{
    if (a == ' ')
    {
        return 0;
    }
    return a - 'A' + 1;
}

i32 get_single_quick_sum(char a, i32 pos)
{
    return get_value(a) * pos;
}

i32 get_quick_sum(const std::string &str)
{
    i32 res = 0;
    i32 pos = 0;
    for (auto &item : str)
    {
        res += get_single_quick_sum(item, ++pos);
    }
    return res;
}

void solve()
{
    bool endl = false;
    std::string str;
    while (std::getline(std::cin, str))
    {
        if (str == "#")
        {
            return;
        }
        if (endl)
        {
            std::cout << '\n';
        }
        std::cout << get_quick_sum(str);
        endl = true;
    }
}