-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathindex.html
521 lines (492 loc) · 17.1 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
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
---
layout: old_default
title: "Nordic Collegiate Programming Contest 2010"
---
<table width="100%">
<tr>
<td class="imgcell" style="width: 33%">
<a href="http://www.ibm.com/">
<img src="../gfx/ibm.jpg" alt="IBM logo" />
</a>
</td>
<td class="imgcell" style="width: 33%">
<a href="http://www.netcompany.com/">
<img src="../gfx/nc.jpg" alt="Netcompany logo" />
</a>
</td>
<td class="imgcell">
<a href="http://www.27m.se/" style="width:120px">
<img src="../gfx/27m.gif" alt="27M logo" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
ICPC main sponsor worldwide
</td>
<td class="sponcell">
Danish sponsor
</td>
<td class="sponcell">
Linköping sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.softhouse.se/">
<img src="../gfx/softhouse.jpg" alt="Softhouse logo" />
</a>
</td>
<td class="imgcell">
<a href="http://www.apptus.se/">
<img src="../gfx/apptus.jpg" alt="Apptus logo" />
</a>
</td>
<td class="imgcell">
<a href="http://www.arm.com/">
<img src="../gfx/arm.gif" alt="ARM logo" style="width:120px" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
LTH sponsor
</td>
<td class="sponcell">
LTH sponsor
</td>
<td class="sponcell">
LTH sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.software-innovation.no/">
<img src="../gfx/software-innovation.jpg" alt="Software Innovation logo" style="width:150px"/>
</a>
</td>
<td class="imgcell">
<a href="http://www.tandberg.no/">
<img src="../gfx/Cisco_Logo_150_pixels.gif" alt="Cisco logo" style="width:150px"/>
</a>
</td>
<td class="imgcell">
<a href="http://www.skill.se/">
<img src="../gfx/skill.gif" alt="Skill logo" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
Norwegian sponsor
</td>
<td class="sponcell">
Norwegian sponsor
</td>
<td class="sponcell">
Linköping sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.microsoft.no/">
<img src="../gfx/microsoft2.gif" alt="Microsoft logo" style="width:150px" />
</a>
</td>
<td class="imgcell">
<a href="http://www.spotify.se">
<img src="../gfx/spotify.png" alt="Spotify logo"/>
</a>
</td>
<td class="imgcell">
</td>
</tr>
<tr>
<td class="sponcell">
Norwegian sponsor
</td>
<td class="sponcell">
Swedish national sponsor
</td>
<td class="sponcell">
</td>
</tr>
</table>
<h1>NCPC 2010</h1>
<h2>2nd October 11:00-16:00 CEST</h2>
<br />
<table width="100%">
<tr>
<td>
<a href="#info">Information</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="info" />
<h3>Information</h3>
</td><td style="text-align:right; vertical-align: middle">
<a href="">top</a>
</td></tr></table>
<p>
The contest was held 2nd October 11:00-16:00 CEST.
The winner was <i>Lag Bernhardsson</i> from KTH in Sweden,
with 8 problems solved out of 11.
</p>
<ul>
<li>Problem set
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2010-data/ncpc2010problems.pdf">PDF</a>].</li>
<li>Slides describing solutions
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2010-data/ncpc2010slides.pdf">PDF</a>].</li>
<li>Example input and output
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2010-data/ncpc2010sampledata.zip">zip</a>].</li>
<li>Judges input, output and solutions
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2010-data/ncpc2010ball.zip">zip</a>].</li>
</li>
<li><a href="scoreboard">Scoreboards</a></li>
<li><a href="contestants.html">Contestant list</a></li>
</ul>
<!--
<p>
The <a href="reg">registration</a> is open until September 30 at 18:00 CEST.
The list of <a href="http://torvalds.cs.lth.se/ncpc/ncpclist.php">registered teams</a>.
</p>
-->
<p>
<a href="http://www.facebook.com/group.php?gid=153631727994840">Join
NCPC on Facebook</a> and spread the word to your friends and
colleagues!
</p>
<p>
NCPC will use the Kattis automatic judging system developed by
KTH. Every team will get a new account on the day of the
competition. If you have a personal Kattis account then you can use it
to practice on the available problems.
<!--
To request a Kattis account
(not required for the competition) send an email to
[email protected] with subject ncpc09-konto. To simplify the
procedure please format the email as follows (on two separate lines):
<br/>Name: Firstname Lastname
<br/>Email: [email protected]
<br/>The accounts are created manually so it may take a while. A confirmation and password will be sent to the email address given in the letter.
-->
<ul>
<li><a href="http://www.csc.kth.se/contest/ncpc/2010/ncpckattis.pdf">Instructions for contest system</a></li>
<li><a href="http://ncpc2010.scrool.se/">Kattis contest system</a></li>
</ul>
<p>
The winners will be Nordic Champions in programming for teams, and the
best student teams will go to <a href="http://nwerc.eu">NWERC</a>, the
regional finals in the <a href="http://icpc.baylor.edu">ICPC</a> contest.
This contest also encompasses national and local championships, and
is held in a distributed manner at various sites throughout the Nordic
countries.
</p>
<p>
Organisers should review the
<a href="../NCPC-Site-HOWTO.html">NCPC-Site-HOWTO</a>.
</p>
<table>
<tr><td>NCPC subregional manager:</td>
<td>Roy Andersson (Lund University)</td></tr>
<tr><td>NCPC director:</td>
<td>Fredrik Heintz (Linköpings universitet)</td></tr>
<tr><td>Head of Jury:</td>
<td>Jon Marius Venstad (NTNU)</td></tr>
<tr><td>Technical Director:</td>
<td>Gunnar Kreitz (KTH)</td></tr>
</table>
<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 is a list of sites that will hopefully join NCPC in 2010. (+ marks
verified sites.)
</p>
<table>
<tr>
<th></th>
<th>Denmark</th>
<th>Organiser</th>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.netcompany.dk/dm">DM I Programmering - København</a></td>
<td>Steffan Andersen
<code><san netcompany.com></code></td>
</tr>
<tr>
<td>+</td>
<td><a href="http://cs.au.dk/~mgreve/algocomp/">DM I Programmering - Aarhus University</a></td>
<td>Mark Greve
<code><mgreve cs.au.dk></code></td>
</tr>
<tr>
<td></td>
<td>Aalborg University</td>
<td><i>No organiser. Help us find one!</i></td>
<!--
<td>Kristian Torp
<code><torp cs.aau.dk></code></td>
-->
</tr>
<tr>
<th></th>
<th>Finland</th>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cis.hut.fi/ncpc/">Aalto University</a></td>
<td>Markus Ojala
<code><Markus.Ojala tkk.fi></code></td>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.helsinki.fi/u/kurhila/ncpc/ ">University of Helsinki</a></td>
<td>Jaakko Kurhila
<code><kurhila cs.helsinki.fi></code></td>
</tr>
<tr>
<th></th>
<th>Iceland</th>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.hr.is/faculty/mmh/ncpc/">Háskólakeppnin í forritun - Reykjavik University</a></td>
<td>Magnús M Halldórsson
<code><mmh ru.is></code></td>
</tr>
<tr>
<td></td>
<td><a href="http://www.tviund.net/?p=391">Háskólakeppnin í forritun - University of Iceland</a></td>
<!-- <td><i>No organiser. Help us find one!</i></td>-->
<td>Kristján Jónasson
<code><jonasson hi.is></code></td>
</tr>
<tr>
<th></th>
<th>Norway</th>
<th>Faculty Advisor: Magnus Lie Hetland<code><mlh idi.ntnu.no></code></th>
</tr>
<tr>
<td>+</td>
<td>Molde University College - Spesialized University in Logistics</td>
<td>Hans F. Nordhaug
<code><hans.f.nordhaug himolde.no></code></td>
</tr>
<tr>
<!-- <td>Norwegian University of Science and Technology</td> -->
<td>+</td>
<td><a href="ntnu.html">NTNU</a></td>
<td>Christian Jonassen
<code><chrijon stud.ntnu.no></code></td>
<!-- ok -->
</tr>
<tr>
<td></td>
<td>Sør-Trøndelag University College</td>
<td>Grethe Sandstrak
<code><grethe aitel.hist.no></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td>University of Bergen</td>
<td>Martin Vatshelle
<code><Martin.Vatshelle ii.uib.no></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.ifi.uio.no/nm-i-programmering/">University of
Oslo</a></td>
<td>Stein Michael Storleer
<code><michael ifi.uio.noo></code></td>
<!-- ok -->
</tr>
<tr>
<td></td>
<td>University of Tromsø</td>
<td><i>No organiser. Help us find one!</i></td>
<!--
<td>Åge Andre Kvalnes
<code><aage cs.uit.no></code></td>
-->
</tr>
<tr>
<td></td>
<td>Vestfold University College (no competition 2010)</td>
<td>Helge Herheim
<code><helge.herheim hive.no></code></td>
</tr>
<tr>
<td></td>
<td>Østfold University College</td>
<td><i>No organiser. Help us find one!</i></td>
<!--
<td>Jan Hoiberg
<code><jan.hoiberg hiof.no></code></td>-->
</tr>
<tr>
<th></th>
<th>Sweden</th>
<th>National coordinator: Fredrik Heintz<code><frehe ida.liu.se></code></th>
</tr>
<tr>
<td>+</td>
<td><a href="http://chalmers.it/ncpc/2010/">Chalmers</a></td>
<td>Jerry Lindahl
<code><jerryl chalmers.it></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.ida.liu.se/progsm/2010">Linköpings
universitet</a></td>
<td>Fredrik Heintz
<code><frehe ida.liu.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.lth.se/contest/lund.html">Lund University</a></td>
<td>Roy Andersson
<code><roy.andersson cs.lth.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.csc.kth.se/contest/ncpc">KTH - Royal
Institute of Technology</a></td>
<td>Stefan Nilsson
<code><snilsson nada.kth.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.umu.se/student/ncpc2010">Umeå University</a></td>
<td>Tomas Ögren
<code><stric cs.umu.se></code></td>
<!-- ok -->
</tr>
</table>
<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>
In short: Teams of up to three persons try to solve as many problems as
possible from a set, without external help.
</p>
<p>
The rules for this contest is given by the
<a href="http://cm.baylor.edu/ICPCWiki/Wiki.jsp?page=Regional%20Rules">ICPC
regional contest rules</a>, with the following clarifications and
additions:
</p>
<h4>Who may compete</h4>
<p>
The teams competing consist of up to three persons. The competition is
open to everybody, as long as they belong to some Nordic entity in some
sense (all belong a given university or company, or all just come from the
same country).
</p>
<h4>ICPC eligibility</h4>
<p>
Only
<a href="http://cm.baylor.edu/ICPCWiki/Wiki.jsp?page=Regional%20Rules">ICPC
eligible</a> student teams compete in the ICPC division.
These may qualify for the regional finals
(<a href="http://nwerc.eu">NWERC</a>), and further to the
<a href="http://icpc.baylor.edu">ICPC World Finals</a>.
Basically, any student
who started his/her university/college studies in 2006 or later is eligible
to compete. For exceptions such as retaken years, military service and so
on, please refer to the
<a href="http://cm.baylor.edu/ICPCWiki/Wiki.jsp?page=Regional%20Rules#section-Regional+Rules-TeamComposition">ICPC rules</a>.
Persons who have competed in five regional finals already, or two world
finals, may not compete in the ICPC division.
</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>What you may use during the contest</h4>
<ul>
<li>What you brought to the contest floor (see above).</li>
<li>Your assigned (single) computer.</li>
<li>The specified system for submitting solutions.</li>
<li>Printers designated by the organiser.</li>
<li>Things given to you by the contest organiser.</li>
<li>Electronic content specified by the organiser, such as language APIs
and compiler manuals.</li>
<li>Compilers and IDEs specified by the organiser.</li>
<li>Non-programmable tools which are a natural part of the working
environment (such as <code>diff</code> and <code>less</code>).</li>
<li>NO other compilers or interpreters for programming languages.</li>
<!-- IDEs do this <li>NO libraries for generating source code.</li>-->
</ul>
<h4>Behaviour during the contest</h4>
<p>
Before the contest begins, you are allowed to log in on your assigned
computer, and log in on the submission system. You may do nothing else with
the computer (such as starting to write code). You may not touch the
problem set before the contest has started.
</p>
<p>
Contestants are <i>only</i> allowed to communicate with members of their
own team, and the organisers of the contest. You may not surf the web
(except for allowed content), read e-mail, chat on MSN, or similar things.
The only network traffic you may generate is from
submitting problem solutions, and access to content specified by the local
organisers.
</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 specified submission system.
</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 submission 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>