ShOrT CuT WaY
All submissions for this problem are available.
After having so much fun at the party, Hansa is very tired and wants to return home. She has been strictly warned by her parents to travel though the main streets only and not any alleys. The party was at the north-west top-most location of the town while her house is at the south-east end.
So the only ways she can travel is to the cross-roads in front of her or the one to her right. Both those cross-roads are equi-distant.
At every cross-roads she reaches, she again gets the same two options.
She wants to know in how many ways can she reach her home. Help her solve this problem so that she can reach home safely.
one m in each line
Output should contain an integer in each line corresponding to the number of ways possible,
Here, (0,0) corresponds to the top-left point of the grid and (m,m) corresponds to the bottom-right point of the grid.
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, 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