Timeline for Code golf: Distributing the balls (I)
Current License: CC BY-SA 2.5
42 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2019 at 8:06 | answer | added | Kevin Cruijssen | timeline score: 1 | |
| May 28, 2019 at 23:51 | history | edited | jimmy23013 |
edited tags
|
|
| Mar 31, 2011 at 13:29 | answer | added | Dr. Pain | timeline score: 3 | |
| Mar 31, 2011 at 4:36 | answer | added | fR0DDY | timeline score: 2 | |
| Mar 30, 2011 at 15:24 | comment | added | Quixotic | @Peter Taylor:I didn't knew about exponential Riordan group,thanks for the update :-) | |
| Mar 30, 2011 at 14:42 | comment | added | Peter Taylor |
@Debanjan, I see your reference and raise you Mathworld (eqn. 5 says that S(n,0) is 1 if n=0 and 0 otherwise). If you want I can find a reference for the stronger statement that Stirling2 is in the associative subgroup of the exponential Riordan group.
|
|
| Mar 30, 2011 at 14:27 | comment | added | Quixotic | @Peter Taylor:I am changing the test case to make it more general,however I would like to add that the The basis cases of Stirling numbers of the second kind are a bit messy: $S(n,1)=1$, $S(n,n)=1$, and $S(n,m)=0$ if $n<m$ or $n=m=0$. (REFERENCE) | |
| Mar 30, 2011 at 14:21 | history | edited | Quixotic | CC BY-SA 2.5 |
edited body
|
| Mar 30, 2011 at 12:44 | comment | added | Peter Taylor |
@Debanjan: by doing nothing. Compare with binomial(0, 0) = 1, the number of ways of selecting 0 balls from 0 balls; or stirling2(0, 0) = 1 (the number of ways of distributing 0 distinguishable balls into 0 indistinguishable cells).
|
|
| Mar 30, 2011 at 12:35 | comment | added | Quixotic | @Peter Taylor:How can we distribute 0 balls into 0 cells in 1 way? | |
| Mar 30, 2011 at 12:33 | comment | added | Quixotic | @Eelvex:Added and No. | |
| Mar 30, 2011 at 12:32 | history | edited | Quixotic | CC BY-SA 2.5 |
added 52 characters in body; deleted 16 characters in body
|
| Mar 30, 2011 at 9:19 | answer | added | J B | timeline score: 3 | |
| Mar 30, 2011 at 9:03 | comment | added | Eelvex |
@Debanjan: Please add test cases for 0 0, 0 1 and 1 0. Also, is A > B always?
|
|
| Mar 30, 2011 at 8:57 | answer | added | Eelvex | timeline score: 3 | |
| Mar 30, 2011 at 1:25 | answer | added | aaaaaaaaaaaa | timeline score: 3 | |
| Mar 29, 2011 at 23:52 | answer | added | Peter Taylor | timeline score: 4 | |
| Mar 29, 2011 at 22:07 | answer | added | Peter Taylor | timeline score: 2 | |
| Mar 29, 2011 at 21:47 | comment | added | Quixotic | @fR0DDY:Now it's a completely different problem with different test cases. | |
| Mar 29, 2011 at 21:42 | history | edited | Quixotic | CC BY-SA 2.5 |
added 14 characters in body
|
| Mar 29, 2011 at 20:16 | comment | added | Peter Taylor |
You might want to add the test cases 0 0 gives 1, 1 0 gives 0, 0 1 gives 0.
|
|
| Mar 29, 2011 at 17:09 | answer | added | mellamokb | timeline score: 1 | |
| Mar 29, 2011 at 14:53 | history | tweeted | twitter.com/#!/StackCodeGolf/status/52745302771372032 | ||
| Mar 29, 2011 at 8:36 | comment | added | Quixotic | SIZECON is in challenge.I was a bit bored yesterday,so I wrote this problem in here ... and then thought of adding in SPOJ and other sites so that it might reach to larger audience.Anyways,I will move it to tutorial if SPOJ users wants that. | |
| Mar 29, 2011 at 7:57 | comment | added | fR0DDY | @Debanjan Even though it is your question, it is a challenge problem there. It is not a tutorial problem or from anagolf where answers are revealed. | |
| Mar 29, 2011 at 7:40 | history | edited | Quixotic | CC BY-SA 2.5 |
added 287 characters in body
|
| Mar 29, 2011 at 7:34 | comment | added | Quixotic | @fR0DDY:It's my problem and you can see similar instances here and here.Anyways,just remove the redundant newline in your submission in SPOJ,to set a new record :-) | |
| Mar 29, 2011 at 6:30 | history | edited | Nemo157 |
edited tags
|
|
| Mar 29, 2011 at 5:58 | comment | added | fR0DDY | @Debanjan I don't like the idea of pasting questions from SPOJ here. People submit their code for competing there and it would be unfair to them. | |
| Mar 28, 2011 at 23:58 | answer | added | gnibbler | timeline score: 3 | |
| Mar 28, 2011 at 22:10 | answer | added | Jesse Millikan | timeline score: 2 | |
| Mar 28, 2011 at 20:42 | comment | added | mellamokb | @Yonatan: I believe that is what is meant by "Every A and B can be distinguishable." That is the interpretation I used when developing my answer, which seems to at least agree with the examples given. | |
| Mar 28, 2011 at 19:46 | comment | added | Yonatan N | I take it that the balls are unique? That is, placing ball x1 in bin y1 and ball x2 in bin y2 is different than x1 in y2 and x2 in y1? | |
| Mar 28, 2011 at 15:13 | comment | added | Quixotic | @mellamokb:How about now? | |
| Mar 28, 2011 at 14:54 | comment | added | mellamokb | That link is invalid for me. | |
| Mar 28, 2011 at 14:50 | answer | added | mellamokb | timeline score: 4 | |
| Mar 28, 2011 at 14:46 | history | edited | Quixotic | CC BY-SA 2.5 |
deleted 18 characters in body
|
| Mar 28, 2011 at 14:20 | history | edited | Quixotic | CC BY-SA 2.5 |
deleted 23 characters in body; added 8 characters in body
|
| Mar 28, 2011 at 14:10 | history | edited | Quixotic | CC BY-SA 2.5 |
edited title
|
| Mar 28, 2011 at 13:59 | comment | added | Quixotic | @Tim Nordenfur:Updated :-) | |
| Mar 28, 2011 at 13:56 | comment | added | user475 | Are there time limits? | |
| Mar 28, 2011 at 13:54 | history | asked | Quixotic | CC BY-SA 2.5 |