Tomi Kyöstilä wrote:
> Any idea when the next competition is coming? (it hasn't been quite
> weekly as you hoped, eh? ;)
Uh no. It turns out that I have less time than I thought, though a big
chunk of it should be freed-up after this weekend. I do have an idea... :-)
Cheers,
Brian
--
http://ma
Brian Quinlan wrote:
> Brian Quinlan wrote:
>
>> Tomi Kyöstilä wrote:
>>
>> Why don't I see my solution (__author__ = "dOb") in the results? I'm
>> sure that you got it as you replied to my mail.
>
>
> Your solution is now included. See:
> http://www.sweetapp.com/pycontest/contest1/results.htm
Brian Quinlan wrote:
> Tomi Kyöstilä wrote:
>
>Why don't I see my solution (__author__ = "dOb") in the results? I'm
>sure that you got it as you replied to my mail.
Your solution is now included. See:
http://www.sweetapp.com/pycontest/contest1/results.html
Good job!
Cheers,
Brian
--
http://m
Tomi Kyöstilä wrote:
> Why don't I see my solution (__author__ = "dOb") in the results? I'm
> sure that you got it as you replied to my mail.
Ahhh...sorry. I have your solution and I timed it but I don't have the
results here so I can't add it to the website. I'll do it tomorrow.
> Where do the
Brian Quinlan wrote:
> Here are the results for the first problem in the Python Programming
> Contest.
>
> I haven't been able to find as much time as I excepted, so my analysis
> is not very in depth.
>
> You can find the results here:
> http://www.sweetapp.com/py
Here are the results for the first problem in the Python Programming
Contest.
I haven't been able to find as much time as I excepted, so my analysis
is not very in depth.
You can find the results here:
http://www.sweetapp.com/pycontest/contest1/results.html
And the problem definition
Raymond Hettinger wrote:
> I'm curious about the stability of your timing setup. If you run your
> own version of fly.py several times with the same starting seed, how
> much variation do you see between runs?
There is very little variation (about 0.1%) but my solution is over an
order of magnit
[Brian Quinlan]
> I'm doing to judge the solutions based on execution speed. It sucks but
> that is the easiest important consideration to objectively measure.
. . .
> I'm always looking for feedback, so let me know what you think or if you
> have any ideas for future problems.
I'm curious about
ThanhNam Nguyen wrote:
>>>1st day: A --> B 100 bucks
>>>2nd day: A --> B 60 bucks
>>>3rd day: A --> B 40 bucks
>>>What would the solution be? And for how much in total?
>>>
>>
>>There are two correct solutions:
>>
>>["A", "B"] # spend one night in A, then fly to B on day two (cost 80)
>>["A", "A",
ThanhNam Nguyen wrote:
> Since my NNTP server doesnt allow posting, I'll ask you directly
> instead.
>
> Must I start from the first day?
No.
> For example:
>
> 1st day: A --> B 100 bucks
> 2nd day: A --> B 60 bucks
> 3rd day: A --> B 40 bucks
>
> What would the solution be? And for how much i
John Hazen wrote:
> I have one question about the problem. Is the cost we are to minimize
> the cost of arriving in the target city at all, or the cost of arriving
> at the target city at the end of the final day of the schedule?
Minimize the arrival cost. The arrival day is not relevant.
> (If
John Hazen wrote:
> * Brian Quinlan <[EMAIL PROTECTED]> [2005-07-15 02:08]:
>
>>You can find the first problem here:
>>http://www.sweetapp.com/pycontest/contest1
>
>
> I have one question about the problem. Is the cost we are to minimize
> the cost of arriving in the target city at all, or the
* Brian Quinlan <[EMAIL PROTECTED]> [2005-07-15 02:08]:
>
> You can find the first problem here:
> http://www.sweetapp.com/pycontest/contest1
I have one question about the problem. Is the cost we are to minimize
the cost of arriving in the target city at all, or the cost of arriving
at the targe
On Sat, 16 Jul 2005, George Sakkis wrote:
> "Tom Anderson" <[EMAIL PROTECTED]> wrote:
>
>> On Sat, 16 Jul 2005, Joseph Garvin wrote:
>>
>>> Someone correct me if I'm wrong -- but isn't this the Shortest Path
>>> problem?
>>
>> Dang! I was just about to point that out.
>>
>> [snipped]
>>
>> But ye
"Terry Reedy" <[EMAIL PROTECTED]> wrote:
> "Tom Anderson" <[EMAIL PROTECTED]> wrote:
> > I can't immediately see any properties of this network that could be
> > exploited, but that doesn't mean there aren't any.
>
> No it doesn't. The challenge is to find a property that saves more time,
> acros
"Tom Anderson" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> On Sat, 16 Jul 2005, Joseph Garvin wrote:
>
>> Someone correct me if I'm wrong -- but isn't this the Shortest Path
>> problem?
>
> Dang! I was just about to point that out.
One twist is that it is not the shortest path
"Tom Anderson" <[EMAIL PROTECTED]> wrote:
> On Sat, 16 Jul 2005, Joseph Garvin wrote:
>
> > Someone correct me if I'm wrong -- but isn't this the Shortest Path problem?
>
> Dang! I was just about to point that out.
>
> [snipped]
>
> But yes, this is basically about who can write the fastest implem
On Sat, 16 Jul 2005, Joseph Garvin wrote:
> Someone correct me if I'm wrong -- but isn't this the Shortest Path problem?
Dang! I was just about to point that out.
> I don't foresee anyone getting a more efficient solution than what they
> can find in hundreds of algorithms textbooks. If this is
liest tricks to create a fast python implementation of the algorithm.
Brian Quinlan wrote:
>I've decided that it would be be fun to host a weekly Python programming
>contest. The focus will be on algorithms that require a bit of thought
>to design but not much code to implement.
>
&
Brian Quinlan wrote:
> I've decided that it would be be fun to host a weekly Python programming
> contest.
I like the idea, and doing the first problem was fun indeed
:o)
> I'm always looking for feedback, so let me know what you think or if you
> have any ideas for futu
[EMAIL PROTECTED] wrote:
> Brian> This contest is for people who like thinking about algorithms.
>
> Surely you must have missed the smiley...
No, I saw it but it just confused me as I have no sense of humor.
Cheers,
Brian
--
http://mail.python.org/mailman/listinfo/python-list
Brian> This contest is for people who like thinking about algorithms.
Surely you must have missed the smiley...
S
--
http://mail.python.org/mailman/listinfo/python-list
Bill Mill wrote:
> On 7/15/05, Brian Quinlan <[EMAIL PROTECTED]> wrote:
>
>>[EMAIL PROTECTED] wrote:
>>
>>>Brian> I've decided that it would be be fun to host a weekly Python
>>>Brian> programming contest. The focus will be on algorithms that require
>>>Brian> a bit of thought to desig
Brian Quinlan enlightened us with:
> Also, it is easiest to protect my system against malicious code if
> it is being run on an OS without a writeable filesystem.
Even easier with User Mode Linux and a COW (copy on write) filesystem.
Sybren
--
The problem with the world is stupidity. Not saying
On 7/15/05, Brian Quinlan <[EMAIL PROTECTED]> wrote:
> [EMAIL PROTECTED] wrote:
> > Brian> I've decided that it would be be fun to host a weekly Python
> > Brian> programming contest. The focus will be on algorithms that require
> > Brian> a bit of thought to design but not much code to
[EMAIL PROTECTED] wrote:
> Brian> I've decided that it would be be fun to host a weekly Python
> Brian> programming contest. The focus will be on algorithms that require
> Brian> a bit of thought to design but not much code to implement.
>
> For some of us that's what we do day-in, day
James wrote:
> I am not sure if it is a good idea to use a LiveCD for OS when you are
> testing for speed. CD access speeds fluctuate and may even impact
> performance even if you start measuring after the module loading is
> complete.
It didn't seem to matter in my testing. Module loading is done
Brian> I've decided that it would be be fun to host a weekly Python
Brian> programming contest. The focus will be on algorithms that require
Brian> a bit of thought to design but not much code to implement.
For some of us that's what we do day-in, day-out at work. It's just not
calle
Brian Quinlan wrote:
> I've decided that it would be be fun to host a weekly Python programming
> contest. The focus will be on algorithms that require a bit of thought
> to design but not much code to implement.
>
> I'm doing to judge the solutions based on execution s
Are you aware of http://mathschallenge.net/index.php?section=project ?
The "The focus will be on algorithms that require a bit of thought
to design but not much code to implement." part seems common, although
your problem domain probably is larger.
/Simon
--
http://mail.python.org/mailman/listi
I've decided that it would be be fun to host a weekly Python programming
contest. The focus will be on algorithms that require a bit of thought
to design but not much code to implement.
I'm doing to judge the solutions based on execution speed. It sucks but
that is the easiest
31 matches
Mail list logo
