DWITE Help

[Dan]

We are looking for some computer science students or enthusiast to help in the writhing of DWITE contest questions for the up coming 2007/2008 school/contest year. DWITE as many of you may know is an online programing contest for high school students in Canada witch is writen in teams, and then marked by an AI judge online. We need are few smart people to come up with high school level computer science problems that can be done in several languages as questions for the contest.

If you do help out you will not be able to participate in the 2007/2008 contest or be a part of any team that is participating in the contest for this year. For the most part it is a thankless job but your name will be listed in a credits section of the site and on any questions you come up with that are used.

If you would like to help out post under this topic and if approved you will be added to the DWITE group and the forum where we are working on the questions will show up for you. We are looking for people with some history with the site so we can trust you but any help would be apershated.

[zylum]

can you please re-add me to the group? btw, hows the progress with the judge?

[zylum]

how exactly do i view the dwite forums? in v2 they were on the forum index. i cant seem to find them anywhere in v3

[haskell]

If you want, I am available, and would be quite honoured to partake in this.

I am a multi-language, multi-paradigm, multi-platform(the 3 Ms) programmer. So, I can whip up questions, and provide the solutions in XX number of languages.

I also have decent english writing skills, so I could also help with editing and revising the questions in hopes of it being more concise, understandable, and etc... I can also help with english mechanics and such, if the need be.

Sample Qustion

Quote:

The Universe, the Galaxies, and the Stars

Problem: There is 1 named universe which has 0 < n < 10 galaxies in it. Each galaxy has a name and 1 <= n < 10 possible stars in it. But, we need to find if the stars can be considered part of them. For a star to be considered part of a galaxy, its co-ordinates must be within the specified number of units in the X, Y, and Z planes. The number of stars in each galaxy must be known, along with their name.

Input: The first line of input is the name of the Universe, which is a single word with less than 10 characters in length. The second line of input is the number of galaxies in the universe. The third line is the name of a galaxy, which is also a single word with less than 10 characters in length. The fourth line is the XYZ co-ordinates of the center of the galaxy. Each co-ordinate value is -255 >= XYZ <= 255 The fifth line is the distance allowed in any plane from the center of the galaxy. The sixth line is number of stars to be tested if they are part of the galaxy. The nth line is the XYZ co-ordinates of the star(s). The input ends when all the co-ordinates are 0.

code:

Sample Input: Haskell 2 Lyman 100 3 10 60 4 0 20 2 4 56 89 99 5 5 100 200 4 Break 200 4 60 34 2 250 3 10 2 5 7 0 0 0

Output: The first line of output must be the name of the universe. The 2nd to nth line must be the name of a galaxy, with the number of stars within it next to the name.

code:

Sample Output: Haskell Lyman 1 Break 0

That was kind of spur of the moment, but its pretty much an example of what I can think of.

[rdrake]

Count me in.

[Clayton]

Me too, I like writing problems more than doing them. I learn more that way

[MihaiG]

i wouldn't mind making some of the problems for question 1 or 2

[klopyrev]

Can I voluntreer my services?

KL

[Tony]

Well as Dan has pointed out, we are obviously looking to build up a problems pool to draw from for the upcoming contests.

Though otherwise we would also welcome any feedback, suggestions, wishes about the contest. Would you like to see something changed? Some new feature added?

You could leave messages here, or contact ether Dan or myself via your method of choice.