Tasks:
 
Task DescriptionDiscussion (0)
Task :: SuperClimber
This time Little Draganče started practicing free climbing. The wall he is practicing on is N + 1 squares tall and 2*K+1 squares wide. The bottom left square is at (-K, 0) and the top right is at (K, N)

Little Draganče starts from the block (0,0). At each step Little Draganče climbs one block and either moves left one block, right one block or stays in the same line of climbing. So from (a, b), Little Draganče can go to (a-1, b+1), (a, b+1) and (a+1, b+1), as long as the destination square exists.

The question is: In how many ways can Little Draganče climb to the top level.

INPUT:
The first line of the standard input will contain two numbers N and K. 1 N ; 0 K 25.

OUTPUT:
To one line of the standard output write one integer representing the number of ways Little Draganče can climb to the top level (N-th level) modulo 321555123

Input:
6 9

Output:
729



Input:
12 9

Output:
531233


Submit Solution
:
:
Available Languages
Task info
Name:SuperClimber
Time:1 sec.
Memory:16 MB
#Tests:50
AddedBy: boba5551
Source:Tajna Komisija
Task Ratings
Difficulty:

4.3 (20 votes)
Quality:

4.5 (18 votes)
Acceptance Rate
Recent Submissions
Fastest Solutions
UserTime
zuzic 0.052 s.
Amtrix 0.109 s.
RobertGerbicz 0.175 s.
crusader 0.184 s.
turgond 0.184 s.
goran_f2 0.19 s.
ilfenomeno 0.194 s.
OuyangJialin 0.218 s.
vrucajanjetina 0.221 s.
nemanja1990 0.231 s.
Solved By