Problem:
Score : 200 points

Problem Statement

Takahashi has two positive integers A and B.

It is known that A plus B equals N.
Find the minimum possible value of "the sum of the digits of A" plus "the sum of the digits of B" (in base 10).

Constraints

2 ≤ N ≤ 10^5

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the minimum possible value of "the sum of the digits of A" plus "the sum of the digits of B".

Sample Input 1

15

Sample Output 1

6

When A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.

Sample Input 2

100000

Sample Output 2

10

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main()
{
    long long n, a, b, k;
    long long red, blue, green;
    long long cnt = 0, cnt2 = 0;
    
    scanf("%lld %lld %lld %lld", &n, &a, &b, &k);
    
    for (red = 0; red <= n; ++red)
    {
        for (blue = 0; blue <= n - red; ++blue)
        {
            for (green = 0; green <= n - red - blue; ++green)
            {
                if ((red + green) * a + (blue + green) * b == k)
                {
                    ++cnt;
                    cnt %= 998244353;
                }
            }
        }
    }
    
    printf("%lld\n", cnt);
    
    return 0;
}