Sphere Online Judge

SPOJ Problem Set (classical)

15627. Create Collections

Problem code: IITKWPCO

  Little Feluda likes to play very much. As you know he only plays with numbers. So he is given n numbers. Now tries to group the numbers into disjoint collections each containing two numbers. He can form the collection containing two numbers iff small number in the collection is exactly half of large number.

  Given n numbers, Find out how many maximum number of collections he can form ?


T: number of test cases. (1 <= T <= 100).

For each test case:

First line will contain n :  (1 <= n <= 100)

Then next line will contain n numbers single space seperated. Range of each number will be between 1 and 10^6.


For each test case, output maximum number of collections that can be formed.


1 2
1 2 4

Added by:praveen123
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Resource:IITK ACA CSE online judge

hide comments
2014-06-30 21:11:40 Diksha Jaiswal
AC in 1st attempt...5 mins code :D
2014-06-30 21:11:40 sarelfeniel
Very easy... plus it's on Cube so insanely fast!!
2014-06-30 21:11:40 salman
Range of each number will be between 1 and 10^7 .
2014-06-30 21:11:40 neer
woww!!! it means if you are using division your solution would directly rejected!!!! :( :/ finally accepted with same logic but with *
2014-06-30 21:11:40 NISHANT RAJ
simple brute force work here.
try http://www.spoj.com/problems/SPCJ/
2014-06-30 21:11:40 sawan mahajan
AC in first go...:)
check the test case
2 4 4 4 4 4
2014-06-30 21:11:40 Ayush Nigam
o(nlogn) and with much optimisation :D:D
2014-06-30 21:11:40 UnrealNinja
Test File is poorly created.
Integers are not single space separated. There may be more than one space between integers in the list.
2014-06-30 21:11:40 கைபுள்ள
don't divide. use multiplication cause 2 WA :(
2014-06-30 21:11:40 Bhavik
ac in 1st attempt:)
nothing new in this problem
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.