Submit | All submissions | Best solutions | Back to list |
APPROB - GETTING AN AP |
Little John has been learning about sequences of numbers and he is very excited about arithmetic progressions.
He takes three boxes and puts some chits in each of them. For deciding the number of chits, he randomly chooses a number n, and places n chits in first box, 2*n chits in the second box and 3*n chits in the third box. If a box contains x chits then the chits are numbered from 1 to x.
Now he randomly chooses a chit from each of the three boxes, and places them in order. (Chit from first box first, then the chit from second box and then the chit from third box). He wants to determine if the sequence so obtained form an arithmetic progression.
Given the number n that he chooses, find the probability that the chits he draws form an arithmetic progression.
Input
The input consists of a number of test cases. The first line of input contains T ,the number of test cases.
Then T lines follow , each containing the number n that Little John has chosen.
1<=T<=100000
1<=n<=100000
Output
The output for each test case should be of the form p/q , where p/q is an irreducible fraction denoting the probability of forming an arithmetic progression from the chits he picks.
Example
Input:
2
1
2
Output:
1/3
1/8
Added by: | Sarvesh Mahajan |
Date: | 2014-06-01 |
Time limit: | 1s-2s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
hide comments
|
||||||||
2014-07-01 11:46:03 abhay srinivas
Omg..!!that was one heck of a problem...all the gifs and flower braces sure confused me a lot.. |
||||||||
2014-06-21 14:04:48 kaushal yadav
some tricky test cases please!!! got AC, was doing a silly mistake..:) Last edit: 2014-06-22 00:02:10 |
||||||||
2014-06-16 17:38:41 simararorarox9
Admin can you help why i am getting WA .. My submission id is 11769637 . thanks .. Edit:such a silly mistake .. AC now.. :) Last edit: 2014-06-16 17:49:02 |
||||||||
2014-06-11 00:25:56 :|
@Sarvesh: may you please check submission id: 11702735 ! |
||||||||
2014-06-04 20:37:10 Tanmay
Can you tell me what's wrong with my code? It seems to be working for the cases which I can solve by hand. Submission ID: 11704711 Edit: for n > 2, are (3, 2, 1) and the likes considered as arithmetic progressions? Edit: AC. Yes, they are. Last edit: 2014-06-05 10:38:10 |