Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

DEVELOPERS

Name: Anonymous 2011-05-24 11:59

http://www.bittorrent.com/company/about/developer_challenge

Name: Ivar 2011-05-27 5:20

i + ((k-1)*k)/2 <= 40, where i is the possible first orange location. and k is the number of oranges to be placed. assuming that all the oranges are same and you cannot differentiate between oranges and k=9, four different possible combinations.

Solution is based on Arithmatic Progression.

Newer Posts

DEVELOPERS

1 Name: Anonymous 2011-05-24 11:59

53 Name: Ivar 2011-05-27 5:20

Name: Anonymous 2011-05-24 11:59

Name: Ivar 2011-05-27 5:20