We are planning to run Yandex.Algorithm finals for online contestants at Sunday, Aug 3 2014 at 19:00. Onsite contestants, please do not discuss Yandex.Algorithm problems at the open boards till the online round end time (20:40 Moscow Time). Problems will be reordered.
→ Обратите внимание
До соревнования
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 06.11.2024 01:27:21 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
Will onsite participants be visible in scoreboard? If yes, does it mean that I can know the order of problems after few onsite contestants submissions?
This situation is already under consideration. Probably we will do not add onsite contestants' results.
In my opinion, 1:40 is a little bit short for the final round. My reasoning is that people that can solve 5 problems in, say, 2:30, are better and should be rated higher than those who can solve 4 in 1:40 and run out of ideas.
That aside, the problems were great, thanks for the contest!
Well, programming competitions are always about speed. Usually, everyone can solve all the problems given sufficiently enough time.
Ha, yeah. Guess there's little place in competitive programming for slowpokes like me. Takes too long to come up with the idea for a hard problem and in short competitions I almost always end up solving one extra problem just 5-10 minutes after the end of the contest.
Then you should have better chances in ACM ICPC or individual contests with longer duration (like GCJ and FHC). I think it is great to have such variety of contests nowadays — everyone can show his strong sides somewhere. Someone like thinking and solving hard problems, working with them for hours or even days, other guys prefer typing:)
How to solve problem Dice without writing a lot of code?
P. S. I like problem "1024 Stack Edition", just easy dynamic programming :)
Put a cube at the hexomino, so down face and hexomino cell will be enumerated by same number. Then just try to roll cube along the hexomino so down face will have same number as current cell. If all 6 cells visited — answer is Yes. Else try to rotate cube 4 times and to swap numbers, related to one pair of opposide sides (because we can fold the hexomino in two directions, both cube orientations are legal) and repeat the procedure. After it all ends up unsuccessfully, answer No.
no where it was written that the paper can be fold in both sides. after getting wa i changed this without hope and it turned into ac :(
There was no limitation on the directions of folding, so both can be used. Why do you think that any "preferred" direction is selected? Usually paper can be fold in two sides...
yah i know. i did not mean to complain. but i personally dont like such hidden thingy :(
LOL, this is an unusual situation where an unrated coder is helping a red coder. :D
First of all, what is the point of shuffling problems? Because if one will use scoreboard from finals to estimate problem difficulty, he can also get their original names (by just placing cursor on problem letter in scoreboard).
And second question, for all those who know C++ better than me:) What does nice(int x) do in C++? :) I failed problem D because of function with name nice — compare this (WA1) and this (AC) (only difference is in changing function name). I tried first source in CF run, on my PC and everywhere else outside Yandex.Contest — it works well; but on Yandex.Contest there is some nice(int x) in C++ that returns some value >0 for every x in range 1..60000:) And I can't find anything about it in any reference.
It's in unistd.h.
Upd. And the reason why on CF it's fine — because it's Unix-specific. What OS do you have on your PC? Did you try to submit it to, e.g., some ejudge-based system?
Thank you for clarification, I got it:) It is really useful experience for me.
Any of those PC's was running Linux? If yes, it may be some variable used in Linux libraries. If no, please report it in Yandex.Contest (sending bug report to system administrators).