IPSC 2014 Announcements
- 2014-06-19 00:10:00 UTC
-
Missed the contest? Didn't solve all problems? Have no fear!
IPSC 2014 has been added to the Training Area.
Now you can solve all the problems you didn't solve before, and even compete
virtually against the original participants.
As always, please report all bugs to ipscreg@ksp.sk.
- 2014-06-18 13:25:00 UTC
-
The solutions booklet has been updated.
- 2014-06-15 16:25:00 UTC
-
We have published a preliminary version of the
solutions booklet.
The correct outputs, solution source code, and
problem E photo gallery
can be found in the IPSC Archive.
The final version of the booklet will be available in a few days,
as well as support for IPSC 2014 in the Training Area.
Did you like the contest? Our e-mail address is ipscreg@ksp.sk and we would
love to hear all kinds of feedback you might have.
- 2014-06-15 16:05:00 UTC
-
The contest is over! All submissions have now been tested and the results are final.
Thank you for participating, and congratulations to
R+T+J for taking the first place! Take a look at the
Top 10 Teams as well.
- 2014-06-15 14:00:00 UTC
-
In problem L1, multiple teams have reported that they have problems with
determining the exact value of a certain large number. As this was not intended to be
a part of the problem, we decided to help you out by letting you know that the number
ends in 99.
- 2014-06-15 13:30:00 UTC
-
In problem J2, only instances where start != end are valid. (The problem
statement should have stated "two distinct endpoints".) In other words, if
the only counterexample that exists has start == end, the code is still considered good.
- 2014-06-15 12:24:00 UTC
-
Regarding problem H: On our machine, sizeof(size_t) == 8 in C++.
- 2014-06-15 11:34:00 UTC
-
We fixed a tiny typo in the problem statement F: the example at the beginning now
correctly states that "9265" (and not "9256") occurs at offset 5. (Thanks to Patrick
Xia for letting us know about this typo.)
- 2014-06-15 11:23:00 UTC
-
Please re-download c1.in.
If your previous C1 submits were valid for the input you downloaded previously, we will
rejudge them as OK.
- 2014-06-15 11:18:00 UTC
-
Accidentally, we uploaded the same file as c1.in and c2.in. That file should be c2.in.
The correct c1.in will be uploaded soon. Sorry! Once this is resolved, we will deal with
your submissions on C1 somehow.
- 2014-06-15 10:43:00 UTC
-
Beat the rush: download early! Password-protected archives with all test data and
a PDF version of problem statements are available already:
Linux,
Windows.
Once the contest starts, the password will be available here:
password.txt.
- 2014-06-15 09:30:00 UTC
-
We are now in the middle between the end of the practice session and
the beginning of the main contest. Congratulations to the 47 teams
who solved all problems, and especially to team Andromeda Express, who
took the first place -- also thanks to the 60 bonus minutes they
received for sending us a postcard. Will the Postcard Quest also
decide the winner in the real contest? We will see!
- 2014-06-15 09:00:00 UTC
-
Should you have any clarification requests during the contest, you
may send an e-mail to ipscreg@ksp.sk, or you may talk to us
at ipsc-org@swissjabber.org (XMPP) or ipsc.org.2014@gmail.com.
- 2014-06-14 11:51:00 UTC
-
Unfortunately, the problem statement of T has a typo:
The constraint "1 ≤ k ≤ n" should read "1 ≤ k ≤ ℓ"
(in both subproblems). Sorry about that.
As this is just the practice session, we are not going to rejudge
the problem: if you got hit by this issue, at least you saw what
a wrong answer looks like :)
