1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <iostream>

using namespace std;

int main()
{
    unsigned long n, result = 0;
    int lastTwoDigitsOfN, currentDigit, correctCombinations = 0;
    cin >> n;

    lastTwoDigitsOfN = n % 10;
    n /= 10;

    do
    {
        currentDigit = n % 10;
        n /= 10;
        lastTwoDigitsOfN += currentDigit * 10;

        if (lastTwoDigitsOfN != 0)
        {
            result += lastTwoDigitsOfN + 1;
            ++correctCombinations;
        }

        lastTwoDigitsOfN = currentDigit;
    }while (n > 0);

    result *= correctCombinations;

    cout << result << endl;

    return 0;
}