Добро пожаловать на 2014-2015 CT S02E03: Codeforces Trainings Season 2 Episode 3 (NCPC 2008 + USACO DEC07 + GCJ 2008 Qual). Продолжительность тренировки — 4 часа 30 минут. Тренировка открыта как для команд, так и для индивидуальных участников. После ее окончания вы можете дорешивать задачи тренировки или поучаствовать в ней виртуально, если не смогли принять участие одновременно со всеми. Пожалуйста, участвуйте в тренировке честно.
Так как это тренировка, то возможно набор задач будет расширен, если для значительного количества участников он окажется простым.
Условия задач будут на английском языке, ведь мы же готовимся к ACM-ICPC!
Удачи!
Where I can rigester it?
Sorry,the contest has already started, you can do it as a virtual contest after end of the contest. click here:http://codeforces.com/gym/100494
Крутая картинка :) Кстати, там '\n' в конце пропущен. Или хотя бы пробел.
Can someone who solved D explain why it is brute-forceable? Thanks..
Why do you think so?
I looked at the codes which got AC.
Hi , I am getting TLE in problem I ( Introspective Caching ) . This is my code : http://ideone.com/UThJix I can't understand which part of my code is costly. Can someone identify the part of my code which leads to TLE .
Edit : Found my mistake .. :D
Can someone provide solution to K?
Brute-forse with O(n^2) complexity:)
Wow. I thought it'd be too much. Thanks, got AC. Now I can see that it could be done with suffix array...
We also thought it'd be too much:) But something clicked in my head at the last moment:) And we got +7)
Could you explane this in more detail?
Missed the contest due to the late announcement :(
So many participants who solved B, but I have no single idea how to do it. Wouldn't someone explain it to me? Especially why we can put one file in 0 bits.
In this problem, you need to check: Is it possible to file tags so that the length of the label was no longer a B and all the labels were different. That is, the answer is yes, if 2 ^ (b + 1) -1> = n
Sorry for bad english. Google translate =)
Hey everyone,I am new to codeforces gym.please tell me whether we get any editorials after contest or not and since other's solutions are not visible, how to understand solution of problems I couldn't solve .
There are no official editorials but you can discuss about the problems here and share your approach. You can't see others solutions as they become visible only when you are able to solve that problem.
What is the idea behind Problem A ( Aspen Avenue ) ? I think it involves DP but how to represent DP state in this case.
how to solve C Code Theft ??
Problem K's judge seems to be behaving randomly. Is there some undefined behavior in my code?
Submission 1: http://codeforces.com/gym/100494/submission/8183454
Submission 2: http://codeforces.com/gym/100494/submission/8183446
Can someone figure this out?
You're using scanf and streams to input data.
That's just one version. I tried multiple combinations. Plus, I think they can be used together.
I found the official website for ncpc 2008, which has input/output and solutions sketches, and judge solutions. Every problem except the last two seems to be from ncpc 2008. The solution sketch is not too detailed, but I thought I'd share and I hope this helps.