Alice and Bob are playing a game. At the beginning of the game, they write down 10 digits from 0 to 9, then they take turn (Alice first) to choose one and erase it.
After that, Alice will have a set of digital, and we call it set A. Now there are N gifts labeled from 0 to N-1, Alice will get the gift satisfying the requirement below: the label is consisting of m numbers which are in A set and m is a odd number.
Now, Alice and Bob want to get more gift and they are smart enough. Alice want to know the maximum number of gift she can get.
2 1 10
1
5
Hint
If set A is {1,2,3,4,5}, Alice will get gift whose label are 10,123,112,134, and not get gift whose label are 110,120,220.