**
Winner Guy Shechter
**
(j11)

Date | Submission | Comment |
---|---|---|

2003-11-04 11:58:37 UTC |
...may be by AP Aneiros |
I cannot prove but...may be
by AP Aneiros |

2003-11-04 11:58:26 UTC |
j2.1.1 by Niilo Sirola |
This should do it.
by Niilo Sirola |

2003-11-04 11:57:57 UTC |
seqfreq by Scott Norin |
Randomly determines if there is any elements that are similar to the nearest neighbor.
by Scott Norin |

2003-11-04 11:57:48 UTC |
j1234 by ben mitch |
this reallly shouldn't be allowed
by ben mitch |

2003-11-04 11:57:08 UTC |
j123 by ben mitch |
this reallly shouldn't be allowed
by ben mitch |

2003-11-04 11:56:26 UTC |
hole1spvg by Pierre Bellec |
tricky M(:)
by Pierre Bellec |

2003-11-04 11:56:25 UTC |
j1-- by Jason Friedman |
one character less . . . .BUT this shouldn't really pass (because it assumes that there are no repeated adjacent elements in a)
by Jason Friedman |

2003-11-04 11:55:35 UTC |
j2 by coldtortuga |
I can't BELIEVE Julian's "j1" passes the test suite!!!
by coldtortuga |

2003-11-04 11:55:02 UTC |
j by Claudio |
Shorter?
by Claudio |

2003-11-04 11:54:13 UTC |
j1-tweak by Nicke |
Cheap tweak...
by Nicke |

2003-11-04 11:52:30 UTC |
paradox by gord drewitt |
% According to the wording of the question, one only needs % b(max(b)) number of a(max(b)) to satisfy the first criterion. % Its is very easy to suggest vectors where not removing % excess points results in the impossibility of meeting the % by gord drewitt |

2003-11-04 11:52:30 UTC |
paradox by gord drewitt |
second criterion. For example, the following a and b.
% This code corrects the problem. % a = [1 2 3 1]; % b = [1 2 1 4]; by gord drewitt |

2003-11-04 11:52:28 UTC |
cheatandprosper by SriSun |
The rules don't say that c must be the same length as sum(b).
by SriSun |

2003-11-04 11:51:43 UTC |
Pretty good: correction by Christopher Cheng |
Fixes Pretty good for the following input:
a = [1 2] b = [5 4] by Christopher Cheng |

2003-11-04 11:51:29 UTC |
2 by Erlend |
Tweak
by Erlend |

2003-11-04 11:50:33 UTC |
Pretty correct by coldtortuga |
Not ALWAYS correct, but since Bartsch' entry passes the gamut...
by coldtortuga |

2003-11-04 11:49:26 UTC |
j2.1 by Niilo Sirola |
OBVIOUS tweak
by Niilo Sirola |

2003-11-04 11:47:11 UTC |
Amelie1 by François Glineur |
Not the shortest, but probably one of the most efficient (no random swapping)
by François Glineur |

2003-11-04 11:43:23 UTC |
Even better? by Peter J. Acklam |
Clever algorithm, Mark
by Peter J. Acklam |

2003-11-04 11:42:39 UTC |
fix it by jed pack |
fixing "Pretty good" so it will work for b=[2 1]
by jed pack |

2003-11-04 11:42:28 UTC |
Bob4 by Tristram Scott |
randperm seems better than sort(rand())
by Tristram Scott |

2003-11-04 11:42:28 UTC |
Not too fancy by Robert Coury |
First pass
by Robert Coury |

2003-11-04 11:38:40 UTC |
while pretty by Nikola Sprljan |
variation
by Nikola Sprljan |

2003-11-04 11:37:22 UTC |
peng01 by peng |
assume no identical elements in vector a?
by peng |

2003-11-04 11:35:06 UTC |
why not? by Niilo Sirola |
Dont think this works...
by Niilo Sirola |