Connection Status:
Competition Arena > CharmingTicketsEasy

CharmingTicketsEasy

SRM 382 · 2007-12-11 · by dkorduban

SRM 382 · 2007-12-11 · by dkorduban · Dynamic Programming
Class Name: CharmingTicketsEasy
Return Type: int
Method Name: count
Arg Types: (int, string)
Problem Statement

Problem Statement

A ticket number that contains exactly 2*K digits is called charming if and only if at least one of the following conditions is satisfied:

  • The sum of the first K digits is equal to the sum of the last K digits.
  • The sum of all the digits at positions with odd indices is equal to the sum of all the digits at positions with even indices.

Also, you think that some digits are better than others, so a charming number must contain only digits that you consider to be good. These digits are given in the String good. Determine the number of different charming numbers containing exactly 2*K digits. Return this number modulo 999983. Remember that ticket numbers may contain leading zeroes.

Constraints

  • K will be between 1 and 50, inclusive.
  • good will contain between 1 and 10 characters, inclusive.
  • good will contain only digits ('0' - '9').
  • All characters in good will be distinct.
Examples
0)
1
"0123456789"
Returns: 10

Only "XX" numbers are charming.

1)
2
"21"
Returns: 8

Only 1111, 1122, 1212, 1221, 2112, 2121, 2211, 2222 are charming numbers.

2)
2
"0123456789"
Returns: 1240
3)
10
"731"
Returns: 207444
4)
50
"0123456789"
Returns: 367584

Submissions are judged against all 59 archived test cases, of which 5 are shown here. Case numbers match the judge’s.

Coding Area

Language: C++17 · define a public class CharmingTicketsEasy with a public method int count(int K, string good) · 59 test cases · 2 s / 256 MB per case

Submitting as anonymous