![]() |
|
![]() |
|
|
Thread Tools | Display Modes |
|
|
#1 |
|
Newbie
Join Date: Aug 2004
Posts: 3
Rep Power: 0
![]() |
My name is stadzy i am a university student doing my first year in computer science and i entered a programming competition of which i lost....well it was well out of my scope i managed to get half but the third years got away with it...i have been told....
My problem is i want to know if there is anybody out there who think they can break this.... incase u all think i am trying to cheat by writting your codes you can just check this link below it shows the competition ended on friday night and i was in team called TEAM GATES.....here is the link www.2cana.co.za/competition to samarize the question it goes like this.... well here goes; suppose there are 16 participants, and all from different countries. suppose A is from USA and has met B from Japan Suppose C is from USa and has met D from Kenya but has not met A suppose E is from england and has met F from south africa ..etc i need to write a program that will output a series of how the athletes should meet in order to know n meet everyone. since a knows b they do not have to meet again. there are only 2 meetings for each athlete per day so the max people u can meet on daily basis is 2. please help i just wanna know how it could be done not the whole code... if i am not clear enough please check the link www.2cana.co.za/competition/question.jsp please help???? |
|
|
|
![]() |
| Bookmarks |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | |
| Display Modes | |
|
|