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: Anonymous 2011-05-25 16:02

>>39
This is what >>8 solved. There are zero possible combinations for 9 oranges in 40 bowls.

Your "first possible sequence" is illegal. Consider, for example:
1101001000100001000001000000100000001000
   A      B          C      D
A and B are the same distance apart as C and D.

Name: Anonymous 2011-05-25 16:50

>>41
oh you faggot.

Name: Anonymous 2011-05-25 17:03

>>41
By distance between two oranges I meant the distance between oranges that are next to one another. You don't need to consider the distance between oranges A and B if there is an orange C that lies between them.

Name: Anonymous 2011-05-25 21:25

>>43

By what I said I mean something completely different.

Name: Anonymous 2011-05-26 1:26

>>44
No, I just forgot to mention the last part.

Can you solve it or not?

Name: Anonymous 2011-05-26 7:34

>>44
Are you butthurd? He just forgot to insert the word ``adjacent'' somewhere into >>39. Chill.

Name: Anonymous 2011-05-26 11:13

>>45
10c10
< typedef char t_dists[ORANGES][BOWLS];
---
typedef char t_dists[BOWLS];
27,28c27,28
<             if (distances[j][dist]) return;
<             distances[oranges][dist] = 1;
---
            if (distances[dist]) return;
            distances[dist] = 1; break;

This took literally less than 1 wall clock minute, including testing. I don't think you're a good enough programmer to gauge the difficulty of challenges.

FIXME: j does nothing; you could pass the last position to avoid scanning bowls[], and once you do that you could get rid of bowls[] completely. Now that might be an appropriate challenge for you.

Name: Anonymous 2011-05-26 17:28

>>47
EXPERT SHiiTCHAN diff failure

10c10
< typedef char t_dists[ORANGES][BOWLS];
---> typedef char t_dists[BOWLS];
27,28c27,28
<             if (distances[j][dist]) return;
<             distances[oranges][dist] = 1;
--->             if (distances[dist]) return;>             distances[dist] = 1; break;

Name: Anonymous 2011-05-26 17:30

>>48
Goddammit.

Name: Anonymous 2011-05-26 20:10

It's fast, portable and ubiquitous. It needs superseding but not replacing.

Name: Anonymous 2011-05-26 20:25

Still awaiting a general combinatorial closed-form solution.
/sci/ will be competing with you on that.

Name: Anonymous 2011-05-27 2:18

>>47
fuck you faggot my skillz get all the bitches, u jelly bro?

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.

Name: Anonymous 2011-05-27 5:55

>>53
Another half-wit thmat...

Name: Anonymous 2011-05-27 6:38

>>54
What's a thmat?

Name: Anonymous 2011-05-27 6:44

>>55
mathmatician, I presume

Name: Anonymous 2011-05-27 6:48

My other thmat is a thmdt

Name: Anonymous 2011-05-27 7:00

>>57
YOU JUST GOT CUDDERED!

Name: Anonymous 2011-05-27 7:05

>>55
Solution is based on Arithmatic Progression.

Name: Anonymous 2011-05-27 7:21

>>59
Why would you abbreviate that? I hate you everything you stand for.

Name: Anonymous 2011-05-27 9:54

>>60 Something tells me yo'ure a clueless thmat too.

Name: Anonymous 2011-05-27 11:31

>>61
fuck you faggot

Name: Anonymous 2011-05-28 18:26

DEVELOPERS DEVELOPERS DEVELOPERS
Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -