| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 164 |
| 3 | awoo | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 155 |
| 6 | maroonrk | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Поздравляю всех с наступившим 2015 годом!!! Надеюсь все его встретили на веселе и желаю достижения всех целей поставленных на этот год!
Завтра в 3 часа дня по Москве состоится очередной SRM. Добавил напоминалку поскольку в расписании до сегодняшнего дня вроде ничего не было, а сейчас появилось.
Удачи всем участникам!!!
Hey. Happy New Year. Thanks for the announcement but it's more practical to post the time as a link.
Can anyone post the date and time link, in all timezones? Ty in advance.
Match page, Timeanddate
How do one find match page? I didn't manage to do that
I've used next SRM in old (red/black) interface
From main page
Community>Events, but there is just a calendar I do not know how to navigate from this, to SRM details page (which is possible by click in old out of date calendar, which is missing year 2015 :-/ )вот мне интересно, почему на http://clist.by/ нет SRM-ов?
Возможно, потому, что в старом календаре месяцев после декабря до сих пор нет.
А в каком календаре они появились вчера? В новом вроде как несколько дней они уже были.
Topcoder website is so hard to navigate......I can't even find the official SRM schedule......
can anyone post the official link?
http://www.topcoder.com/community/events/
I agree with hiukim, old version was difficult to navigate in, but new version is even worse, without Google I'm lost completely :-D
Kvark161 navigate doesn't mean the same as "have proper link bookmarked", just an opinion...
Thanks for the reminder
Is arena down just for me or for everybody?
Same here
Went down for me at the exact same instant I clicked to open a problem D:
Yup, down.
I saw two people in my room submit successfully. When I tried to compile, it didn't work.
i solved 250! then unable to open 500 and tried re-login and it failed
Прямо сейчас арена не компилирует, а после выхода не логинится.
I can not login to arena
Me neither. Looks like another unrated SRM.
I couldn't compile my 250, so I tried to restart the arena. Now I can't log in.
Smells like an unrated round :(
The worst thing is that the problems can't be reused as we have already seen them. If problems occurred just 10 minutes earlier, the contest could have been postponed.
Looking at TC during last few months — they should write a book "33 recipes how to decrease number of participants in your contests".
Compiling — your request timed out
You can log in now,but there is not "Active Contest"
You cannot compile in a contest that is not active
What about Compiling — You cannot compile in a contest that's not active!!!
And first SRM of the year...
Анонсы от серых до добра не доведут
It's up now, round will be reloaded.
Still doesn't work for me.
Doesn't work for me either. Anyone else?
works for me, but no one can compile code
Same stuff, "You cannot compile in a contest that is not active"
.. and now it logged me off and won't let me log in
Go back to codechef long? :D
same for me
me too :(
Working.
I'm not.
я не могу компилить, т.к. контест не активен.
HAPPY NEW YEAR TOPCODER :( :(
Regrettably, today's round is still not working, and will have to be cancelled. Practice rooms will be added later, once arena issues are identified and corrected.
excuse me, are you a topcoder staff?
I did get the message too but little later.
Nah, just posted the message here because lot of users are unable to open the message.
Problem Setter try to do their best in writing the problem and their bad luck that Round become unrated due to sites problem Sad.
It's totally dead. Someone's getting fired at Topcoder.
Problem Setter try to do their best in writing the problem and their bad luck that Round become unrated due to sites problem Sad.
They get paid for writing problems, so it's not like his work was worthless.
Money is not everything. And preparing problems are very tough otherwise everyday would have been a topcoder/codeforces round. Respect the writer who create beautiful thinking problems.
It's not enough to compensate for the huge amount of work preparing a contest is. The problemsetter probably just wanted to see other people solving his problems, and now he'll have to work hard again for it...
The fall of topcoder
>implying it hadn't started way ago...
It seems to have some broadcast messages from TC admins, but I can't open it. Can anyone see it?
Edit: It was:
Yes, screenshot of messages is here
Meanwhile the TC admins...
Compile error
jajjaa, Let me finish to write all the code, lol!
did you mean " who_Is_Better "?
Oh, my bad. By the way, How can I put a code in a comment here?
put it in "block"
what_Is_Better
which
So, if both fail, TC is better? :D
jajjajja, Let me ADD this condition. Thanks.
EDIT: For silly mistakes like this I fail systest frequently in both, TC and CF.
My first successful hack!
+1, I was hacked ... but at the end, I gained something very important: "BE PENDING TO SMALL DETAILS". BTW, my solution was hacked by you, kingofnumbers and dalex. It seems like I had a wrong Function name.
Раз уж все пропало: как решать 500(div1)? Что-то моя динамика не заработала.
Да это фигня, куда интереснее знать, как открыть 500 (div 1)
может кто-нибудь условие скинуть? Я не смог посмотреть.
Назовем раундом турнира (из N) разбиение числа N на слагаемые, каждое из которых хотя бы 2 (порядок слагаемых важен).
Нужно посчитать кол-во последовательностей раундов длины K, такое что кол-о слагаемых в одном равно сумме чисел в следующем, K <= 6, сумма на первом уровне = N <= 1e18
Я если что не писал раунд, но вроде так: k=1 — фибоначчи, сумма двух геомпрогрессий. Дальше надо уметь сворачивать биномиальную сумму с коэффициентами геомпрогрессии в следующую геомпрогрессию. Там нужно будет взять сумму двух биномов отрицательной степени, поэтому все будет раздваиваться на каждом шаге, асимптотика что-то вроде
Для фиксированного k у нас получается рекуррентность, зависящая от предыдущих 2k членов, можно просто посчитать какой-нибудь динамикой первые 2k + 1 членов и эту рекуррентность восстановить, на семплах работает.
неплохо, спасибо:)
А почему так получается или ты просто заметил это?
Додебажил более простое(или не более).
Динамика dp[n][2 ^ k] — добавили n человек — i-ый бит взведен, если мы можем уже добавили хотя бы 1 группу на текущем уровне. При добавлении человека перебираем самый поздний уровень, на котором "закрыли" группу. На всех меньших были 1, а стали 0, а на этом было что угодно, стало 0. ну и дополнительный переход из всех 1 в 0.
Bumping, it seems the arena is back up and the round has been added to practice.
I started writing down solutions for recent problems without editorials here, today's hard problem (the only one I saw before shit happened, the other ones might be added soon) is there already.