Auto comment: topic has been updated by Kogut_Ivan (previous revision, new revision, compare).

-

may i go pupil..

Did he just do the 67 joke...

okay, that 6-7 ref had to be intentional...

Excited for the first Div. 3 of the year! Thanks to the organizers, setters, and testers for putting this together. Looking forward to a fun round with solid problems and learning during the hacking phase. Good luck to everyone participating — let’s code fair and strong!

You will be offered 6-7 problems

No way... the 67 joke

Having become expert in last round, maybe I can take it easy this time..... Unrated registration is great！

As a newbie, I hope to get close to pupil in this contest.

The first div.3 contest of the year

You guys are still doing the 6-7 joke, let the great meme reset happen guys.

Hoping to do 4-5 tasks in this round. At least 3 tasks, and don't get -rating.

The first div-3 of the year. Hoping to get +delta in this round!

Div-3 after a long time

6 7 haha

You will be offered 6-7 problems and 2 hours 15 minutes to solve them.

I hope this 6 7 joke be sent to cry's basement.

How can I reach the pupil level? What do I need to solve in the Div section, and which center do I need to be in to reach it? Also, if anyone can give me advice on how to reach the pupil level, please let me know.

Kogut_Ivan, fstilus you have incorrectly written that you should not have a rating point of 1900 or higher, instead you should have written that you should not have a rating point of 1600 or higher

Auto comment: topic has been updated by fstilus (previous revision, new revision, compare).

I think it would be better, if we could get at least one interactive type problem in div 3.

maybe specialist this time :)

Can someone please repeat the number of problems we will have?

Hope to rank up...

Nice way to open the year with Div. 3. Much appreciation to the organizers, setters, and testers especially the smartie MariamH :)

numberforce

We are going LagForces with this one

first ever div-5 on cf?

Oh yeah!

I got my second AK(solved all problems) on Div.3 (on pretests)

Thanks for the interesting contest!

Such a slow assessment, such abstract questions.

Using generative AI to polish statements is not prohibited, I think?

Nooooo I just got $$$F$$$ just needed 5 more seconds to submit :(

so easy

Nice contest.. loved to solve D.

I don’t know why I couldn’t understand the problem statements for A and B.

I don’t know if it was just me, but I’ve read Problem D more than 10 times and still couldn’t understand the actual problem statement.I was really confused :<

UPDATE: I misread every time

“Alice can either halve the number” as “Alice can either have the number.”

Now I think the statement was actually fine. It would just be nicer if there were a simple notation like [a/2]

Opened youtube randomly, suddenly seen bro Bhuia sharing his solutions live. What the hell bro. (Link)

Thank you for this contest! Enjoyed the blend of different topics, from Binary Search to Trees to DSU. Shame my inability didn't quite reach problem F in time.

lagging speed is inversely proportional to the contest number

Unclear B statement

Problmes were hard tbh T-T

Too much laggig giving unwanted penalties, should be improved

First div3. contest in which I got WA on A,B,C :(

I have been giving contests here for 2 years now and it is not funny anymore. I can tolerate cheaters but please atleast try to make queues run smoothly during the round. It is my humble request at this point.

I do not really get why problem G was placed as G.

the language of this contest was by far the worst i have seen till date. The problems were not explained clearly even the easiest problems were represented in such a way that it become very difficult to understand...

Is it me or anyone find it more harder rather than normal div 3

why pretests on G so weak that n^2 brute force can pass pretest?

Unclear problem statements:

$$$B$$$: When $$$s = k$$$, does the last unit of sand fall and then he flips it over? Or he flips it before it falls? The problem statement says "He will do this even if the sand is still falling", but its actually the former case, when you look at the sample testcases and understand.

$$$F$$$: Really didn't understand what you meant by "If cherries have already fallen from any leaf before, the tree will break, so such a situation must be avoided". Does the process stop once all cherries are collected? Are we allowed to do redundant operations, where no cherry falls?

Problems were really good though, once you understand them or make necessary assumptions as to what the author might have meant. Thanks for the round!

Why did my hack on G get an Unexpected verdict?

Could it be that a tester wrote a brute force with if(min<len)return 0; and some memoization, and it was marked as correct

I don't know if it's just me, but in every single contest I hate on ABC (div 2) and ABCD (div3) because they are guessforces

But I end up loving the rest of the problems

And, at this point, I can say for sure it's easier for me to solve a D (div2) or E (div3) rather than a C (div2) or a D (div3)

I wonder if there's a rule on which problems should be guessforces and which ones should be algos, maybe I'm just going crazy

on problem G, O(NQ) solution is as fast as O(QlogN) solution, it seems that for almost test cases, the answer appears near the l so brute force solution didn't have to search full range.

(n,k)forces

Hello, could someone please help? My code is getting a WA on line 102 of test 2 for C and line 502 of test 2 for B, but the tests are not visible, so I'm not able to understand where my logic is going wrong.

#include <bits/stdc++.h>
using namespace std;
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t=0, ti=0, s=0, k=0, m=0;
	cin >> t;
	while (ti < t){
		cin >> s >> k >> m;
		if (k >= s){
			if (m%k > s){
				cout << 0 << "\n";
			} else {
				cout << s-m%k << "\n";
			}
		} else {
			cout << k-m%k << "\n";
		}
		ti++;
	}
}

#include <bits/stdc++.h>
using namespace std;
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t=0, ti=0;
	cin >> t;
	while (ti < t){
		int n=0, k=0, l=0, r=0, count=0, yn=0;
		cin >> n >> k;
		l=k*2-1;
		r=k*2+1;
		if (n >= 2 || k > n){
		while (l < n+1){
			count++;
			if (n >= l && n <=r){
				cout << count << "\n";
				yn=1;
				break;
			}
			l=l*2-1;
			r=r*2+1;
		}
		if (yn == 0){
			cout << -1 << "\n";
		}
	} else {
		cout << 0 << "\n";
	}
		ti++;
	}
}

Thanks!

This was my first ever contest and I didnt select unrated mode when i registered for it. On my profile it shows under unrated section. Can someone explain how this works? Will I need to participate in another to get a official ranking?

is this solution hackable — https://mirror.codeforces.com/contest/2184/submission/357558156

My apologies, I misunderstood earlier. Please disregard that remark.

I have one simple question. I might be wrong but did you guys explain in the problem statement what is an hourglass and how does it work? not even a single reference was shared to understand it properly. ruined everything!

I remember taking this contest in the morning and am currently rated less than 1600. The contest on my end does not show up as rated for some reason. Does this mean that I have to participate in at least five rated rounds before contests are rated for me? I am sorry if I am asking something obvious but I am a little bit lost.