nCr as a Service

Problem code: NCRAAS

All submissions for this problem are available.

To test a new cloud computing service, you decide to write a program that generates the Pascal Triangle in a distributed fashion.

You wish to estimate the amount of network traffic that would be expected between nodes. Since the nodes exchange the computed values in base 10, you want to know the number of digits in the base-10 representation of nth row and rth column of Pascal's triangle. Since your program internally represents these in base-2, you also wish to know the number of digits in the base-2 representation to get an idea of the memory usage involved.

Input Format

The first line contains a single integer t, followed by t lines each containing two numbers that indicate the row and column in Pascal's triangle respectively.

Output Format

For each test case output a single line containing two numbers each, the number of digits in the base 10 representation followed by the number of digits in base 2.

Example

Input:



20
5 2
3 3
5 4
2 2
4 1
5 5
2 1
4 4
3 1
3 0
1 1
2 0
3 2
5 3
4 2
4 0
5 1
4 3
1 0
5 0

Output:


2 4
1 1
1 3
1 1
1 3
1 1
1 2
1 1
1 2
1 1
1 1
1 1
1 2
2 4
1 3
1 1
1 3
1 3
1 1
1 1
Author: singh_sume
Date Added: 12-01-2012
Time Limit: 0.2 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC


Comments

limits on "t" "n" and "r" ???

sid_gup @ 21 Jan 2012 06:06 PM
limits on "t" "n" and "r" ???

Small enough that you won't

vikhyat @ 21 Jan 2012 06:18 PM
Small enough that you won't need a bigint implementation.

isn't the sample output of

dr_go_fast @ 21 Jan 2012 07:57 PM
isn't the sample output of first test case wrong??

isn't the output for 1st case

dr_go_fast @ 21 Jan 2012 08:19 PM
isn't the output for 1st case wrong??

dr_go_fast: sorry about the

vikhyat @ 21 Jan 2012 09:03 PM
dr_go_fast: sorry about the delay, looks like your comment was caught in a spam filter of some sort. 5c2 is 10, which is 1010 in binary. "2 4" looks right to me.

How to display output? cout<

amitkmr42 @ 21 Jan 2012 09:07 PM
How to display output? cout<

amitkmr42: std::cout should

vikhyat @ 21 Jan 2012 09:14 PM
amitkmr42: std::cout should work. make sure you include the spaces and newlines where required.

am getting evry result r8 for

kolechetan @ 21 Jan 2012 11:14 PM
am getting evry result r8 for given test data.... n some other data also..... bt its sayng o/p is wrng... is thre need to go beyond int limit???

the largest intermediate

vikhyat @ 21 Jan 2012 11:20 PM
the largest intermediate value in my code is 184756, and I am using a pretty naive implementation. If you are computing the factorial in the numerator and the denominator and then divide, you will probably exceed the int limit. try to avoid doing so.

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

CodeChef is a global programming communityCodeChef hosts online programming competitions