-
Notifications
You must be signed in to change notification settings - Fork 2
/
index.html
724 lines (684 loc) · 23.7 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
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
<?xml version="1.0" encoding="ISO-8859-1"?>
<!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 2015</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>
<div style="text-align: center;">
<table class="divcenter" style="text-align: justify" width="750px">
<tr>
<td class="page">
<!-- START CONTENT -->
<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" style="width: 33%">
<a href="http://www.thalesgroup.com/">
<img src="../gfx/thales.jpg" alt="Thales logo" width="250" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
ICPC main sponsor worldwide
</td>
<td class="sponcell">
Danish sponsor
</td>
<td class="sponcell">
NTNU sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.bekk.no">
<img src="../gfx/bekk.jpg" alt="Bekk logo" width="200" />
</a>
</td>
<td class="imgcell">
<a href="http://www.schlumberger.com">
<img src="../gfx/Schlum_logo_blue.png" alt="Schlumberger logo" width="200" />
</a>
</td>
<td class="imgcell">
<a href="http://www.operasoftware.com/">
<img src="../gfx/opera_logo.png" alt="Opera Software logo" width="250" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
NTNU sponsor
</td>
<td class="sponcell">
NTNU sponsor
</td>
<td class="sponcell">
NTNU sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.flatfrog.com/">
<img src="../gfx/flatfrog.jpg" alt="Flatfrog logo" width="140" />
</a>
</td>
<td class="imgcell">
<a href="http://www.apptus.se/">
<img src="../gfx/apptus.png" 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.ericsson.com">
<img src="../gfx/ericsson.gif" alt="Ericsson logo" />
</a>
</td>
<td class="imgcell">
<a href="http://www.idainfront.se">
<img src="../gfx/idainfront.jpg" alt="ida infront logo" width="250" />
</a>
</td>
<td class="imgcell">
<a href="http://www.operasoftware.com/">
<img src="../gfx/opera_logo.png" alt="Opera Software logo" width="250" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
Linköping sponsor
</td>
<td class="sponcell">
Linköping sponsor
</td>
<td class="sponcell">
Linköping sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.codemill.se">
<img src="../gfx/codemill2014.png" alt="Codemill logo" style="width:180px" />
</a>
</td>
<td class="imgcell">
<a href="http://www.dohi.se">
<img src="../gfx/dohi.png" alt="Dohi logo" style="width:180px" />
</a>
</td>
<td class="imgcell">
<a href="http://www.academicwork.se">
<img src="../gfx/academicwork.png" alt="AcademicWork logo" style="width:180px" />
</a>
</td>
</tr>
<tr>
<td class="sponcell">
Umeå sponsor
</td>
<td class="sponcell">
Umeå sponsor
</td>
<td class="sponcell">
Stockholm sponsor
</td>
</tr>
<tr>
<td class="imgcell">
<a href="http://www.sogeti.se/">
<img src="../gfx/sogeti.png" alt="sogeti logo" width="250" />
</a>
</td>
<td class="imgcell">
<!--
<a href="http://www.acino.se/">
<img src="../gfx/acino.png" alt="Acino logo" style="width:220px" />
</a>
-->
</td>
<td class="imgcell">
<!--
<a href="http://cinnober.com/">
<img src="../gfx/cinnober.png" alt="Cinnober logo" style="width:220px" />
</a>
-->
</td>
</tr>
<tr>
<td class="sponcell">
Karlstad sponsor
</td>
<td class="sponcell">
</td>
<td class="sponcell">
</td>
</tr>
</table>
<h1>NCPC 2015</h1>
<h2>Saturday 10th 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>
NCPC 2015 will be held Saturday 10th October 11:00-16:00 CEST. NCPC
is a distributed contest with many sites throughout the Nordic
countries. Local information for each site such as when and where
you should meet will be available by following the links associated
with each site below.
</p>
-->
<p>
The contest was held October 10th, 11:00-16:00 CEST. The winner
was <i>Omogen Heap</i> from Stockholm, Sweden, who solved 9 out of 10 problems. Congratulations!
</p>
<ul>
<li><a href="http://ncpc15.kattis.com/standings">Final standings</a></li>
<li>Problem set
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2015-data/ncpc2015problems.pdf">PDF</a>].</li>
<li>Slides describing solutions
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2015-data/ncpc2015slides.pdf">PDF</a>].</li>
<li>Judges' input and output
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2015-data/ncpc2015testdata.tar.bz2">tar.bz2</a>]. For some problems a .desc file describes an input or a PNG image illustrates it.</li>
<li>Judges' solutions
[<a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2015-data/ncpc2015solutions.tar.bz2">tar.bz2</a>]. </li>
<li><a href="https://github.com/icpc/ncpc-web/releases/download/ncpc2015-data/ncpc2015all.tar.bz2">Packaged problems</a> including testdata, solutions, wrong solutions, output validators, input generators, etc.</li>
<li>All material are copyright 2015 by the NCPC 2015 jury. They are licensed under the <a href="http://creativecommons.org/licenses/by-sa/3.0/">Creative Commons BY-SA v3.0</a> license.</li>
<li>
The list of <a href="http://icpc.baylor.edu/regionals/finder/nordic-2015/teams">registered teams</a>.
</li>
<!--
<li>
The list of <a href="http://icpc.baylor.edu/regionals/finder/nordic-2015">registered contestants</a>.
</li>
-->
</ul>
<p>
<ul>
<!--
<li>The <a href="reg.html">registration</a> is open until Thursday October 8nd at 18:00 CEST.</li>
-->
<li>The <a href="reg.html">registration</a> is now closed. Your local organizer might still accept new teams, contact them to find out.</li>
<li>The list of <a href="http://icpc.baylor.edu/regionals/finder/nordic-2015/teams">registered teams</a>.</li>
</ul>
</p>
<p>
The winners will be Nordic Champions in programming. Universities
may select student teams to go
to <a href="http://nwerc.eu">NWERC</a>, the regional finals in
the <a href="http://icpc.baylor.edu">ICPC</a> contest. NCPC also encompasses national and local championships.
</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>
There will be <b>two warmup contests</b>
at <a href="https://warmup.kattis.com">https://warmup.kattis.com</a>
to help you practice. The first is Saturday October 3rd
11:00-16:00 CEST. The second starts Saturday evening and continues until Friday October 9th.
</p>
<!--
<p>
To practice on the available problems go
to <a href="https://ncpc12.contest.scrool.se/">Kattis</a>. If you have
a personal Kattis account then you can use it, otherwise you can
register <a href="https://ncpc12.contest.scrool.se/register">here</a>
(or in the menu, "Log In" and then "Register account"). To show up on
the standings page, you must also go to
the <a href="https://ncpc12.contest.scrool.se/standings/">standings
page</a> (linked from the menu) and pick a team name ("Join the fun?"
below the scoreboard).
</p>
-->
<!--
<p>
There will be a <b>public contest</b> using the same problems as
NCPC at <a href="https://open.kattis.com/contests/ncpc2015open">https://open.kattis.com/contests/ncpc2015open</a>.
The contest starts at 11.00 CEST, i.e. at the same time as NCPC.
</p>
-->
<p>
NCPC will use the Kattis automatic judging system provided
by <a href="http://kattis.com/">Kattis</a>. Every team will get a new
account on the day of the competition.
</p>
<ul>
<li><a href="https://open.kattis.com/documentation">Instructions for the Kattis contest system</a></li>
<li><a href="https://open.kattis.com/documentation/tutorial1">A Kattis tutorial</a></li>
<!--<li><a href="https://ncpc12.contest.scrool.se/">Kattis contest system</a></li>-->
</ul>
<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></td><td>Fredrik Niemelä (Kattis)</td></tr>
<tr><td>Head of Jury:</td>
<td>Lukáš Poláček (Spotify)<td></tr>
<tr><td></td><td>Markus Sortland Dregi (University of Bergen)</td></tr>
<tr><td>Technical Director:</td>
<td>Gunnar Kreitz (Spotify/Kattis)</td></tr>
</table>
<table class="head"><tr><td>
<a name="sites" />
<h2>Participating sites</h2>
</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 2015. (+ marks
verified sites.) Follow the links to get local information such as when and where to meet.
</p>
<table>
<tr>
<th></th>
<th>Denmark</th>
<th>Organiser</th>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.netcompany.dk/dmip">DM I Programmering - København</a></td>
<td>Søren Fogt Lundbo
<code><sfl netcompany.com></code></td>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.netcompany.dk/dmip">DM I Programmering - Aarhus</a></td>
<td>Mathias Rav
<code><rav cs.au.dk></code></td>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.netcompany.dk/dmip">DM I Programmering - Aalborg</a></td>
<td>Søren Fogt Lundbo
<code><sfl netcompany.com></code></td>
<!--<td><i>No organiser. Help us find one!</i></td>-->
</tr>
<tr>
<th></th>
<th>Finland</th>
</tr>
<tr>
<td>+</td>
<td><!--<a href="http://cse.aalto.fi/en/current/events/ncpc2014/">-->Aalto University</td>
<td>Teemu Sirkiä
<code><teemu.sirkia aalto.fi></code></td>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.helsinki.fi/u/ahslaaks/ncpc">University of Helsinki</a></td>
<td>Antti Laaksonen
<code><ahslaaks cs.helsinki.fi></code></td>
</tr>
<tr>
<td></td>
<td>University of Tampere</td>
<td>Heikki Hyyro
<code><Heikki.Hyyro uta.fi></code></td>
</tr>
<tr>
<td>+</td>
<td><a href="http://www.lut.fi">Lappeenranta University of Technology</a></td>
<td>Tuomo Sainio
<code><tuomo.sainio lut.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>Hjalti Magnússon
<code><hjaltmann gmail.com ></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 - Specialized 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>Marius Enerly
<code><marius.enerly gmail.com></code> </td>
<!-- ok -->
</tr>
<tr><td></td><td></td>
<td>Neshat Naderi
<code><neshat.naderi hotmail.com></code></td>
</tr>
<!--
<tr>
<td> </td>
<td>Sør-Trøndelag University College</td>
<td>Grethe Sandstrak
<code><grethe aitel.hist.no></code></td>
</tr>
-->
<tr>
<td>+</td>
<td>University of Bergen</td>
<td>Torstein Jarl Strømme
<code><torsteins me.com></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.maps-uio.no/artikler/arrangement/124001/">University of Oslo</a></td>
<td>Carl Martin Rosenberg
<code><cmrosenb gmail.com></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td>Høgskolan i Gjøvik</td>
<td>Login
<code><login hig.no></code></td>
</tr>
<tr>
<td>+</td>
<td>UiT the Arctic University of Norway</td>
<!--<td><i>No organiser. Help us find one!</i></td>-->
<td>Robert Pettersen
<code><robert cs.uit.no></code></td>
</tr>
<!--
<tr>
<td></td>
<td>Vestfold University College</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><fredrik.heintz liu.se></code></th>
</tr>
<tr>
<td></td>
<td><a href="http://ncpc.dtek.se/">Chalmers</a></td>
<td><i>No organiser. Help us find one!</i></td>
<!--<td>Niclas Ogeryd
<code><n.ogeryd gmail.com></code></td>-->
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.kau.se/ncpc15">Karlstad University</a></td>
<td>Stefan Alfredsson
<code><Stefan.Alfredsson kau.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.ida.liu.se/progsm/2015">Linköpings
universitet</a></td>
<td>Fredrik Heintz
<code><fredrik.heintz liu.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td>Luleå Institute of Technology</td>
<!--<td><i>No organiser. Help us find one!</i></td>-->
<td>Adam Sahlin
<code><adasah-1 student.ltu.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.lth.se/contest/current">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>Marc Vinyals
<code><vinyals kth.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.cs.umu.se/student/ncpc2015">Umeå University</a></td>
<td>Tomas Forsman
<code><stric cs.umu.se></code></td>
<!-- ok -->
</tr>
<tr>
<td>+</td>
<td><a href="http://www.it.uu.se/edu/ncpc">Uppsala University</a></td>
<td>Lars-Åke Nordén
<code><lln it.uu.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>
<b>Note that new languages have been added since 2014 and rules regarding
programming languages have been clarified. Read <a href="#rules-contest">the
details below</a>.</b>
</p>
<p>
The rules for this contest is given by the
<a href="http://icpc.baylor.edu/regionals/rules">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://icpc.baylor.edu/regionals/rules#HICPCRegionalRulesfor2015">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 2011 or later is eligible
to compete. For exceptions such as retaken years, military service and so
on, please refer to the
<a href="http://icpc.baylor.edu/download/regionals/rules/EligibilityDecisionTree-2015.pdf">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 id="rules-contest">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++, C#, Go, Java, Objective-C, Python,
Haskell, JavaScript or PHP. The jury guarantees that each problem is
solvable in C++ and Java. No guarantees for other languages are given
due to the big number of allowed languages.
</p>
<p>
The submitted programs must read from standard input (stdin) and write 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>
<p>
<br />
</p>
<hr />
<p>
Updated: 2015-08-17
(<a href="http://validator.w3.org/check/referer">h</a>
<a href="http://jigsaw.w3.org/css-validator/check/referer">c</a>)
<br />
Responsible editor: <a href="mailto:[email protected]">Fredrik Heintz</a><br />
</p>
<!-- END CONTENT -->
</td>
</tr>
</table>
</div>
</body>
</html>