Добро пожаловать на 2016-2017 CT S03E09: Codeforces Trainings Season 3 Episode 9. Продолжительность тренировки — 5 часов. Тренировка открыта как для команд, так и для индивидуальных участников. После ее окончания вы можете дорешивать задачи тренировки или поучаствовать в ней виртуально, если не смогли принять участие одновременно со всеми. Пожалуйста, участвуйте в тренировке честно.
Перейдите в раздел Тренировки для регистрации и участия.
Ориентировочный старт: 9 ноября 2016 г., 16:10 (Московское время).
Так как это тренировка, то возможно набор задач будет расширен, если для значительного количества участников он окажется простым.
Условия задач будут на английском языке, ведь мы же готовимся к ACM-ICPC!
Удачи!
In problem M in test 8 we have following strings in input
Why don't we know answer for query
?
Maybe, judge's solution misses a case. I just exclude cases when two variables are independent to get AC.
Sorry, haven't seen vintage_Vlad_Makeev's comment
How to solve G? (The Queens one)
Probably, the right decision was to bruteforce answers for small n and to find the formula on oeis.org.
In fact the first 5 cases are enough, and n =4,5 are given while n<=3 is trivial (answer is 0)
How to solve it without using external resources?
How to solve B, I and j?
I — O(n^3logn) passes. Iterate the points of the first triangle and calculate the count of each triple of distances. Std::map got TL verdict, so I used std::sort to do that.
Problem J you can you gaussian elimination, you can solve http://www.spoj.com/problems/XMAX/ to understand it
How can I find the number of subsequence of maximum sum and the sequence using Gaussian Elimination?
You can store the numbers whose xor equal to the answer by vector and find the set that xor equal to the answer. To find the number of subsequence, you just count the number of 0 after using Gaussian Elimination, Suppose it is M. If you xor the answer with any subset whose xor sum is 0, it doesn't affect the maximum xor sum, so the answer is 2^M
Ignore the comment about Gaussian Elimination above. Here's a link to the right algorithm to solve this: Link
It seem like the link is missing solution for this problem. Can you re-update this ?
I just cant get it??? Why neither solution nor source code available for training contest??? :((
I just cant get it? Why neither solution nor code available for Training contest ??? :(((
what is the solution procedure of Problem N(Cut Tiles).
Attention: a[i] = 2^x.
How to solve problem B?
Here is the solution to B.
Could anyone tell me how to solve problem E? Thanks in advance
Here is the solution to E.
Thanks man!!!Very helpful
Do you have editorial this contest?
How to solve C?
How to solve D?