Hello, Codeforces!
We are happy to invite you to TheForces Round #19 (Briefest-Forces), which will take place on Jul/03/2023 18:05 (Moscow time)
What is TheForces Round?
You will have 135 minutes to solve 6 problems.
All the statements are very short and brief,and we strongly recommend you to read all problems.
The round is rated:) After the round is over,you can find your rating changes here.
Problems were prepared and authored by wuhudsm,Psychotic_D,vikram108,Banis.
We would like to thank our army of testers: sreesh_56,milind0110,blxst, O--O,corrupt,sai-17,noomaK,Away_in_the_heavens, NaturalSelection,EndlessDreams,yash_04.
Also we want to thank you for participating in our round.
Discord Server (1000+ people)
Let's go!!
As a tester, prepare ur ...
as a tester
If you've done all the problems you can try to think about how do you do E with minimal memory, here's an sol that does 12,000 KB
Cool, GL & HF.
Will TheForces rating change after the round? Yes, it will.
After the round, you can find your TheForces rating here
The registration is open!
TheForces is great but... Starts a little bit late. That might cause insomnia. Please upvote if you agree and downvote if you disagree.
All Problems are in Queue.Will it Disturb the Contest?
The checker is broken.
D long queue!!!!!!!!!!!!!!!!!!!!
ohh, problem E is... so dirty code(for me)
What is wrong with this- [submission:211970161] ?
Not able to view code.
You can copy the code from the Editorial and submit it. After you get AC, you will be able to view the test data.
can u make other submissions to view?
After you get AC, you can view other submissions
I think the solution is O(n^2) with all values in the array a and c being multiples of m.
m can have maximum of 1344 factors so it will be O(1344*1344).
You forgot fast io:(
I tried it out with Fast IO. The input for this problem is very large it seems.
Thanks for this info. I guess this contest is of no use then.
Why do you think so? I felt the problems were clever, regardless of the constraints. Fast IO is a pretty common thing, and it is assumed to be used by everyone.
"I guess this contest is of no use then."
Shouldn't you be glad that you learned about fast IO in an unrated contest?
how it is visible but other submissions not visible
You can copy the code from the Editorial and submit it. After you get AC, you will be able to view the test data.
I guess that's because you don't have fast IO!
how to solve F? i thought it was related to cycle decomposition and tried but failed...
what is the logic of problem A
If $$$l_1+r_1 \gt l_2 + r_2$$$, then the probability of Alice's winning is higher than Bob's.
You can check the proof in the editorial here.
Just curious who choose this as problem A? It is easy to guess, but very hard to prove.
It's easy to observe.
Observation $$$\neq$$$ proof. Is the purpose of the contest to encourage guessing?
The proof is described in the Editorial.
problem E: ref: https://mirror.codeforces.com/gym/104455/submission/211981570
is there no way to make this O(7.(2n)) solution pass?
Why this contest is not added into TheForces Rounds Group?
Added.
Thanks for it.
I can't see it right now
Issue fixed.
Restored the contest.
Why the yesterday's TheForces #19 round is deleted ?