Give 100 points How many 58-digit numbers are there where the sum of the digits is 31, and each digit has a adjacent number different parity?

Given two integers ‘n’ and ‘sum’, find count of all n digit numbers with sum of digits as ‘sum’. Leading 0’s are not counted as digits.

1 <= n <= 100 and

1 <= sum <= 500

Example:

Input: n = 2, sum = 2

Output: 2

Explanation: Numbers are 11 and 20

Input: n = 2, sum = 5

Output: 5

Explanation: Numbers are 14, 23, 32, 41 and 50

Input: n = 3, sum = 6

Output: 21

segment bisector

step-by-step explanation:

line segment bisector. definition: a line, ray or segment which cuts another line segment into two equal parts. try this drag one of the orange dots at a or b and note the the line ab always divides the line pq into two equal parts.

mark brainliest!

not me

step-by-step explanation:

i wish i did i would like to get a desert ghost ball python