.png){kind=icon}
Return
Programming contest strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compedu.2006.08.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Each year the ACM hosts a truly international programming contest - the International Collegiate Programming Contest (ICPC). Dating back to a contest held by Texas A&M University in 1970, this annual event, along with the associated regional contests, has grown to 5606 teams from 1733 universities in 84 countries (in the year 2006). Despite the maturity of the event, and the number of competitors, there has never been a systematic examination of contest strategy. Herein several strategies are proposed and examined to determine whether a team call gain all advantage by choosing a good strategy; and, if so, then what that strategy should be. We show that a team call gain in advantage by choosing a good strategy, but that there is no one best strategy. A team must choose between winning by number of solved problems and winning by points. Finding the optimal strategy to will by problems is shown to be NP-complete, while to win by points a team must solve problems in order from easiest to hardest. (C) 2006 Elsevier Ltd. All rights reserved.
Keywords:
programming contest
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
10.5
Papers:
5.0K
Citations:
2.9W
Organization
Cited Papers
ShareSaveShareSaveShareSaveModulating effects of L‐arginine on cytokine‐stimulated lymphocyte migration in vitro.png)
Microsurgery
MicrosurgeryIF0
PREAI
ShareSave
View more