Programming Tournament - Page 2

On April 11 2009 02:17 Boblion wrote:
Turbo Pascal > C++ imo.

On April 11 2009 02:17 Boblion wrote:
Turbo Pascal > C++ imo.

On April 11 2009 00:17 never_toss wrote:
#ifndef _EsX_Raptor_
#define _EsX_Raptor_

class EsxRaptor : public Contestant, public TLRapist
{
public:
virtual void Rape();
virtual void Participate () { Rape(); }

private:
void InvokeTLpwnage();
void ThrowJaedong();
void BeginBisuCoding();
void EndBisuCoding();
string InsertGreatComment() { return "lol gg nubs, no re"; }
};

#endif

On April 11 2009 00:17 never_toss wrote:
#ifndef _EsX_Raptor_
#define _EsX_Raptor_

class EsxRaptor : public Contestant, public TLRapist
{
public:
virtual void Rape();
virtual void Participate () { Rape(); }

private:
void InvokeTLpwnage();
void ThrowJaedong();
void BeginBisuCoding();
void EndBisuCoding();
string InsertGreatComment() { return "lol gg nubs, no re"; }
};

#endif

On April 11 2009 00:41 prOxi.swAMi wrote:
Any particular reason why C++?
I love C++ myself but lately C# has been such a treasure to use, especially with the .NET 3.5 framework. There is just SO much more you can do, so easily. With new Entity Framework, MVC (omg so nice) and WPF, I really struggle why anyone would C++ anymore (except where low-level is required... but FUCK windows messages).

On April 11 2009 01:56 Lemonwalrus wrote:
Now that somebody else broke the chain, I can ask my question.

wtf is a programming tournament?

Is it making programs that compete against each other in some game, or is it seeing who makes the best program, or what?

glhf either way.

On April 11 2009 06:58 tec27 wrote:

I dunno how its working for Raptor, but I'm on my schools "programming team" (which sounds really lame ). Our tournaments are a bit bigger though, and you're part of a 3 person team. Its run by the ACM (association for computing machinery). Basically, here's how it works:

You're given anywhere between 6 and 8 different problems to solve, all generally challenging, but there's usually a few that can be solved within 20-30 minutes or so (1-2). They give you a minimal amount of test data, and all the data about the possible input you need to handle, along with a fairly indepth description of what the program needs to do. You then make a program that you think will handle all the possible test data they could throw at it, and when you're satisfied, you submit that for judging. They run they're complete test data through it, and if there's any problems, they send it back to you with a general reason (output syntax, doesn't match test answers, etc.) and add a 20 minute penalty to your score. If you get it right, they give you a correct problem and then add the current amount of time to your score (so if you solved it at the 30 minute mark, they'd add 30).

The winner at the end of the competition is the team who solved the most problems (and in case there's a tie there, its the team who has the least total time score (which would mean they solved the problems in the least amount of time/with the least amount of wrong submissions)).

On April 11 2009 00:17 never_toss wrote:
#ifndef _EsX_Raptor_
#define _EsX_Raptor_

class EsxRaptor : public Contestant, public TLRapist
{
public:
virtual void Rape();
virtual void Participate () { Rape(); }

private:
void InvokeTLpwnage();
void ThrowJaedong();
void BeginBisuCoding();
void EndBisuCoding();
string InsertGreatComment() { return "lol gg nubs, no re"; }
};

#endif

On April 11 2009 08:55 Hamster1800 wrote:
The way it works is that the number of correct submissions determines the winner with the total time being a tiebreaker.

Also, the sample problem in the OP is a pretty straightforward dynamic programming problem.

On April 11 2009 11:49 Pengu1n wrote:
Could you post all the problems? Also what year are you?

On April 11 2009 12:12 gzealot wrote:
Is it? I thought it was doable by using the standard graph theory, could Dijisktra's algo work here?
Could you explain slightly more about dynamic programming, I could never really work my head around it.

OP, would it be possible to get a hold on the solution? thankkkss.

On April 11 2009 12:13 EsX_Raptor wrote:

you made my day :D
I just love it when people show interest in these things, because I'm in love with my CS major.
I just started my Junior year (halfway through),
I will transcribe all the problems (its a handout) as soon as I get home man!


Our group had the solution but I forgot to make a copy for myself x_X

I'll try to work it out myself again and post the solution with the algorithm and maybe source if you want.

We used recursion to to through all the possible paths and then determined the best one by comparing their weighs.