Submit solution

Points:
7 (partial)

Time limit:
1.0s

Memory limit:
256M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Mimi has just won two raffle tickets for the Polar Express! Unfortunately, there is just one obstacle in the way — the skill testing question!

Let us define to be the sum of digits of . Given two positive integers, and , compute the

number of distinct valuesof , for .

Mimi has agreed to give you the other ticket if you help her solve this problem. Can you do it?

#### Constraints

##### Subtask 1 [10%]

##### Subtask 2 [90%]

#### Input Specification

The first and only line of input will contain two space separated integers, and .

#### Output Specification

A single integer, the number of distinct values of .

#### Sample Input

`19 28`

#### Sample Output

`9`

## Comments