Help Arjit Singh
All submissions for this problem are available.
As predicted by the great Gods, Little Arjit has got nothing to do this summer. (Are you surprised?) But, he's not one of those people to lose hope... not so easily. He decided to work hard this summer on the two things he wants the most, as of now: "Dual degree work", and "an internship!"
So, following the signs from the universe, he makes multiple chits like the one shown below, and folds them, and puts all of them in a jar.
DUAL DEGREE | INTERN
Now, he follows a certain algorithm to complete his planned hard work in the 60 days of vacations, he's got.
- Let's say, little Arjit has c number of chits.
- Every day, he picks up a chit from the jar.
- If it's a normal, proper complete chit, he prefers selecting "dual degree" as his first choice.
- He finishes off the work selected from the chit; tears that portion, and puts back the remaining half of the chit, back in the jar.
- Let's say, if he picks a remaining half of some chit, he does that work - and so that chit's work is finished; and that chit is discarded.
Given the total number of chits made by Little Arjit, in how many ways can he finish of all his work?
The first line contains an integer, t, denoting the number of test cases. The next t lines contain one integer, n, in every line, denoting the number of chits made by little Arjit.
Print the number of ways he can empty the jar.
- 1 <= t <= 700
- 1 <= n <= 30
Obvious fact: For completing 30 chits, he'll be needing 30*2=60 days.
Input: 2 1 3 Output: 1 5
Let's represent events happening on all those days as a string. How many different valid strings would be there that would empty the jar? Let's say that n = 3. D means dual degree. I means internships. So, there will be 5 different ways. They will be:
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.