-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathindex.html
249 lines (216 loc) · 8.72 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="no" lang="no">
<head>
<title>Nordic Collegiate Programming Contest 2005</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
<meta name="keywords"
content="ncpc,acm,icpc,collegiate,student,programming,contest,nm,sm,vm,programmering" />
<meta name="description"
content="Nordic Collegiate Programming Contest" />
<link rel="stylesheet" type="text/css" href="../main.css" />
</head>
<body>
<table align="center" width="750px">
<tr>
<td class="page">
<!-- START CONTENT -->
<table width="100%">
<tr>
<td></td>
<td style="text-align: center; vertical-align: middle;">
<a href="http://www.ibm.com/">
<img src="../gfx/ibm.jpg" alt="IBM logo" />
</a>
<br /><br />
<span class="discreet">ICPC main sponsor worldwide</span>
<br /><br />
</td>
<td></td>
</tr>
<tr>
<td style="text-align: center; vertical-align: middle;">
<img src="../gfx/logotyp.gif" alt="DF logo" />
<br /><br />
<span class="discreet">Swedish sponsor</span>
</td>
<td style="text-align: center; vertical-align: middle;">
<img src="../gfx/microsoft3.gif" alt="Microsoft logo" />
<br /><br />
<span class="discreet">Norwegian sponsor</span>
</td>
<td style="text-align: center; vertical-align: middle;">
<img src="../gfx/trolltech2.gif" alt="Trolltech logo" />
<br /><br />
<span class="discreet">Norwegian sponsor</span>
</td>
</tr>
</table>
<h1>NCPC 2005</h1>
<h2>1st October 11:00-16:00 CEST</h2>
<br />
<table width="100%">
<tr>
<td>
<a href="#problems">Result and problem set</a><br />
<a href="#sites">Participating sites</a><br />
<a href="#rules">Rules</a><br />
<br />
<a href="../">Back to main NCPC page</a><br />
</td>
<td style="text-align: center">
<i>a part of</i><br />
<img alt="ICPC logo" src="../gfx/acm-icpc-logo.gif" />
</td>
</tr>
</table>
<table class="head"><tr><td>
<a name="problems" />
<h3>Results and problem set</h3>
</td><td style="text-align:right; vertical-align: middle">
<a href="">top</a>
</td></tr></table>
<p>
The contest was held Saturday October 1st.
The winner of the Nordic contest was Lag Bernhardsson from
The Royal Institute of Technology in Stockholm,
with eight out of nine problems solved. They are now also Swedish champions.
Second was Team Interamöba from Lund Institute of Technology
with 6 problems solved.
Third was Black Gold from The University of Oslo with 5 problems solved,
making them Norwegian champions.
</p>
<ul>
<li>Results:
<a href="http://www.nada.kth.se/contest/ncpc/2005/final/ncpc.html">Nordic</a>,
<a href="http://www.nada.kth.se/contest/ncpc/2005/final/se.html">SM</a>,
<a href="http://www.nada.kth.se/contest/ncpc/2005/final/no.html">NM</a>.
</li>
<li><a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2005-data/ncpc2005problems.pdf">Problem set</a>.</li>
<li><a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2005-data/ncpc2005solutions.pdf">Solution sketches and explanations</a>.</li>
<li><a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2005-data/ncpc2005ball.tar.gz">Input, output, and solutions</a>.</li>
<li><a href="../reg2icpc/showteams.php">Contestant list</a>.</li>
</ul>
<table class="head"><tr><td>
<a name="sites" />
<h3>Participating sites</h3>
</td><td style="text-align:right; vertical-align: middle">
<a href="">top</a>
</td></tr></table>
<p>
Below are links to local information about the contest.
Smaller sites might not set up a web-page.
The organisers will then inform you in other ways:
</p>
<ul>
<li>Aalborg</li>
<li>Aarhus</li>
<li>Bergen</li>
<li>Halden</li>
<li>Linköping</li>
<li><a href="http://www.cs.lth.se/contest/lund.html">Lund</a></li>
<li>Molde</li>
<li><a href="http://www.ifi.uio.no/nm-i-programmering/">Oslo</a></li>
<li>Reykjavík</li>
<li><a href="http://www.nada.kth.se/contest/ncpc/2005/">Stockholm</a></li>
<li>Tromsø</li>
<li><a href="ncpc2005trd.html">Trondheim</a></li>
<!-- <li>Tønsberg</li> -->
<li>Umeå</li>
</ul>
<table class="head"><tr><td>
<a name="rules" />
<h3>Rules</h3>
</td><td style="text-align:right; vertical-align: middle">
<a href="">top</a>
</td></tr></table>
<p>
The rules for this contest is given by the
<a href="http://icpc.baylor.edu/icpc/regionals/About.htm">ICPC
regional contest rules</a>, with the following clarifications and
additions.
</p>
<h4>Who may compete</h4>
<p>
<i>Note:</i> The old “grandfather” rule is no longer effective.
This means that there is no limit on the number of 4th/5th-graders on a
team.
</p>
<p>
Basically, any student who started his/her university/college studies in
2001 or later is eligible to compete. For exceptions such as retaken
years, military service and so on, please see the <a
href="http://icpc.baylor.edu/icpc/regionals/About.htm">ICPC regional
contest rules</a>. Those who have competed in five regional finals (<a
href="http://www.nada.kth.se/contest/nwerc/">NWERC</a>) already, or two
world finals, may not compete.
</p>
<h4>What you may bring to the contest floor</h4>
<ul>
<li>Any written material (Books, manuals, handwritten notes, printed notes, etc).</li>
<li>Pens, pencils, blank paper, stapler and other useful non-electronic
office equipment.</li>
<li>NO material in electronic form (CDs, USB pen and so on).</li>
<li>NO electronic devices (Cellular phone, PDA and so on).</li>
</ul>
<h4>Behaviour during the contest</h4>
<p>
Contestants are <i>only</i> allowed to communicate with members of their
own team, and the organisers of the contest. The only electronic equipment
they can use is their assigned team computer. The only remote electronic
content they may access is what is made available by the local organiser,
such as programming language APIs and compiler manuals. This means the
only network traffic the contestants may generate is from the use of PC^2
for submitting their problem solutions, and access to web-pages specified
by the local organisers. This means you may <i>not</i> read your e-mail or
chat with your aunt on MSN.
</p>
<h4>The contest</h4>
<p>
The problem set consists of a number of problems (usually 8-12).
The problem set will be in English,
and given to the participating teams when the contest begins.
For each of these problems, you are to write a program in C, C++ or Java
that reads from standard input (stdin)
and writes to standard output (stdout), unless otherwise stated.
After you have written a solution,
you may submit it using the <a href="http://www.ecs.csus.edu/pc2/">PC^2</a>
system. See the
<a href="http://www.ecs.csus.edu/pc2/doc/v85/team/PC2TeamGuide.htm">PC^2
Contestants Guide</a> for details.
</p>
<p>
The team that solves the most problems correctly wins. If two teams solve
the same number of problems, the one with the lowest total time wins.
If two top teams end up with the same number of problems solved and the
same total time, then the team with the lowest time on a single problem is
ranked higher. If two teams solve the same number of problems, with the same
total time, and the same time on all problems, it is a draw. The time for
a given problem is the time from the beginning of the contest to the time
when the first correct solution was submitted, plus 20 minutes for each
incorrect submission of that problem. The total time is the sum of the times
for all solved problems, meaning you will not get extra time for a problem
you never submit a correct solution to.
</p>
<p>
If you feel that problem definition is ambiguous, you may submit a
clarification request via the PC^2 system. If the judges think there is no
ambiguity, you will get a short answer stating this. Otherwise, the
judges will write a clarification, that will be sent to all teams at all
sites in the contest.
</p>
<p>
<br />
</p>
<hr />
<p>
Editor: <a href="http://www.idi.ntnu.no/~nilsgri/">Nils Grimsmo</a><br />
<!-- (<a href="http://validator.w3.org/check/referer">h</a>
<a href="http://jigsaw.w3.org/css-validator/check/referer">c</a>) -->
</p>
<!-- END CONTENT -->
</td>
</tr>
</table>
</body>
</html>