thanks for this round.

The competition announcement should include a link to the competition: Codeforces Round 704 (Div. 2)

I am curious: why do all these contests prepared by Moscow Olympiad Committee have unusual timing?

Will the problem score distribution be announced for this round (since there is an official competition as well)?

I believe it will be a wonderful round!

Hope all of us can get good scores!

Notice the Unsual Timing.

For me living in China ,the timing is so good.

As a Chinese coder, I'm surprised to find out it's a good time for me to participate in the contest, normally for join the contest in Codeforces, I have to stay up late.

I'm looking forward to solving the problems, it'll be another chance for me to challange and improve myself. Stay Cheeki Breeki!

Please can the timings be changed because students of many countries won't be able to take part due to their college lectures ?

ok sorry for that.

Note: Unusual time

Unusual timing = less competition

One of my friends is interested in setting up a round. Does anyone know typically how much time it takes for the entire process (proposal of the round to the hosting of round)?

Hoping to get scoring distribution as early as possible

You guys(Russian school kids) do train hard regularly.. Nice going .. Hope to see similar things in my country too.

I sense chaos

I am curious: why do all these contests prepared by Moscow Olympiad Committee have unusual timing?

Even though we have quit our music career, we will continue to give contests on Codeforces.

Please share score distribution too

It hurts...

hope green delta for all

This timing is so much better for me. Afternoons are usually slow, this can give a nice touch. All the best to all.

I hope my rank and rating will be increase in this contest :)

I missed the time :(

Is C DP or greedy?

How to solve D ? :(

How to solve E?

What was famous hack in problem D?

Can Anyone tell me pretest 18 of the D of this contest

Hacks,hacks everywhere!!!

0 1 0
YES
1
1

0 3 1
NO

Can anyone explain why my code for E is wrong on pretest 27?

108288547

Almost missed this round. UNUSUAL TIMING (: Started 5 minutes late with the fastest heartbeat ever.

Can anyone help. Why this solution is wrong import java.util.*;

public class A {

public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    StringBuilder sb = new StringBuilder();
    int testCases = sc.nextInt();

    for (int t = 0; t < testCases; t++) {
        double p = sc.nextLong();
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();

        long ans = Long.MAX_VALUE;

        long temp = (long) Math.ceil(p / a);

        ans = Math.min(ans, (long) (temp * a - p));

        temp = (long) Math.ceil(p / b);

        ans = Math.min(ans, (long) (temp * b - p));

        temp = (long) Math.ceil(p / c);

        ans = Math.min(ans, (long) (temp * c - p));

        sb.append(ans).append("\n");

    }

    System.out.print(sb);
}

}

I tried to hack A with 99999999999999998 2 2 2 but got an invalid hack error

Validator 'validator.exe' returns exit code 3 [FAIL Expected int32, but "99999999999999998" found (stdin, line 1)]

even though, the problem clearly says p < 1e18

Someone from the authors, please clarify this?

Can anyone explain why my submission for E 108288547 have WA on pretest 27?

how to do B i'm getting tle

edit: can we do it using bitset i've got the logic but not able to implement if someone has done it using bits please do share ur code

How sad it is when I got the observation for D so early but kept getting WA at pretest 8 around 1 hour and half :((

just now: hackforce

soon: FSTforce

Why is everyone discussing solutions and hacks... The contest for the kids is still going on in Russia.. Let's just control our curiosity for an hour

Due to the official competition source codes of other participants will not be available for an hour after the end of the round.

So maybe we shouldn't discuss anything about the contest especially the solutions and the hacks.

Felt more of like a Div 2.5 contest. It was great !!!

Thanks for the "strong" pretest of problem D!

In C .. why does the logic of setting max,min for each index (keeping in mind the neighbouring char's max,min index) fails on pretest 5. You can check my submission : https://mirror.codeforces.com/submissions/indresh_0903 Can anyone please help :/

So scary (be hacked in last 10 mins) and so rubbish pretest in D! ):

from math import ceil
 
t=int(input())
for _ in range(t):
    p,a,b,c=map(int,input().split())
    print(min(ceil(p/a)*a-p,ceil(p/b)*b-p,ceil(p/c)*c-p))

Why is this wrong for A?

Guys did anyone else have this problem? When I sent a solution it said that I had already sent that solution but I was sending it first time. I did anything possible but it always said that I had already sent that solution.

Was D having a simple idea to trigger 1s in result starting from a pattern like

1 1 1 0 0 0

0 1 1 0 0 1.

Triggering flood of ones from right at 0,1 pair and stopping at 1,0 pair.

I didn't participated but just pondering over the idea.

This gives me RE on pretest 5

FOR(i, m) {
		ll j = sp[t[i] - 'a'];
		to_which[i] = cp[t[i] - 'a'][j];
		while (i > 0 && to_which[i] < to_which[i - 1]) {
			to_which[i] = cp[t[i] - 'a'][++j];
		}
		sp[t[i] - 'a'] = to_which[i] + 1;
}

whereas this gets AC on pretest

FOR(i, m) {
		ll j = sp[t[i] - 'a'];
		assert(j < (ll)cp[t[i] - 'a'].size());
		to_which[i] = cp[t[i] - 'a'][j];
		while (i > 0 && to_which[i] < to_which[i - 1]) {
			++j;
			assert(j < (ll)cp[t[i] - 'a'].size());
			to_which[i] = cp[t[i] - 'a'][j];
		}
		sp[t[i] - 'a'] = j + 1;
}

I have changed only this much part of the code and nothing else. Someone please help me out in debugging the error.

UPD: I got the mistake I was doing. Thank you all.

@Admin/@MikeMirzaynov, if a person participates in a contest, why is it that that person is not allowed to make another submission until the system testing concludes? (Obviously I'm not asking you to count submissions after contest gets over) It has happened very often that I don't get a problem within the contest time bounds but do have a solution immediately after the contest gets over — and I have to wait for a while before my submission can be evaluated (because system testing is running) — Its bad enough that I wasn't able to solve it within the bounds, worse still that I can't check if my code is right or not when I finish it. Request you to look into it if possible...

Why was there sudden change in timings ? My midsems are approaching and had to miss 2 classes, nevermind tho, the contest was worth it. Sincere request to not change timings, old timings were perfect.

How to solve C using dp?

Is there any solution for E using graphs??

Thanks for the round though the pretests are a bit too weak...

good contest

Is this round "FSTForces" ?

Fst forces

Poor pretest for D ：(

codefst

codefst

Believe it or not, I believe that today's round is just for hackers...(At least D)

Some very weak pretests for D (:

I want to know who makes problem D's data?

At least 400 coders failed system tests on this problem :)

(include me).

Thanks for the strong pretests! Love pretest producer!

Is this submission for A hackable? He used ceil and float when numbers are as big as 1e18. I got cases which fail in g++14 and couldn't find a hack case since he submitted in g++17

qwq oh noooooooooooo!thanks for pretest!!!

Good Guy! case for a=0 not in the pretest. Fst so many people.