Below is the discussion thread to discuss all doubts/alternative solutions/better explanations for Problem D of Round #704.
# | User | Rating |
---|---|---|
1 | tourist | 3748 |
2 | Benq | 3540 |
3 | Petr | 3470 |
4 | Radewoosh | 3355 |
5 | ecnerwala | 3347 |
6 | maroonrk | 3345 |
7 | jiangly | 3324 |
8 | scott_wu | 3313 |
9 | ainta | 3298 |
10 | boboniu | 3289 |
# | User | Contrib. |
---|---|---|
1 | 1-gon | 200 |
2 | Errichto | 196 |
3 | rng_58 | 194 |
4 | SecondThread | 186 |
4 | awoo | 186 |
6 | Um_nik | 182 |
7 | vovuh | 179 |
8 | Ashishgup | 176 |
9 | -is-this-fft- | 173 |
9 | maroonrk | 173 |
Below is the discussion thread to discuss all doubts/alternative solutions/better explanations for Problem D of Round #704.
Name |
---|
Can someone please explain the proof to-
It's not difficult to prove that the answer does not exist when k>a+b−2.
How to solve if the condition that $$$k<=a$$$ is not met?
same question how to solve for k<=a???
please help
Suppose TC is 3,4,2 Make the string x as 1110000 and y as 1110001 then just change the x[a+b-1-k] to 1 and you will get the required answer link to my solution , It is very easy to understand for k<=x https://codeforces.com/contest/1492/submission/108304677
Why do people downvote it? That's what cf needs, discussion threads for the problems
perhaps they think this discussion should under
Announcement of Codeforces Round #704 (Div. 2)
?I saw that lots of coders always discuss problems under the announcement of the contest
https://codeforces.com/blog/entry/88129
Sorry,I didn't see it.
I agree with you.
It's good only when it is official. I mean say a lot of people start separate discussion threads, then it will be a lot of choas.