bWayne is going to rock now:)

I feel great when I see people like you, as some people after reaching expert, stop giving contests in order to uphold their ratings.

What should be the problem rating for E,F,G in the contest according to you?

Thanks dvdg6566, I got it.

What is wrong with normal Priority queue implementation in E?

If all these accounts are created by a single person, I wonder how can someone remember so ugly handle names!!

Hi scott_wu, As you are an working professional now, how do you manage to keep up with participating in contest and doing Competitive Programming with your daily work, or what's your routine/schedule and if you could suggest some management tips?

I asked this because I am a student in almost after a year I would in a working person and I would not like to leave doing CP.

How do you deal with infinite loop run? Which cause the output.txt file to increase the size infinitely as I could not stop that activity and hence I need to reboot my PC deliberately? Which is quite painful during the contest time?

Also how do you deal with any runtime error caused? As many times it don't give the outputs nor show error and looks as the code ran but didn't gave the output.

Waiting for one such wonderful contest by Ashishgup after a long time.

Monogon, Please make it happen ASAP. Congrats to both of you

tmwilliamlin168, sir you are one of the best inspiration for all of us. First of all a big congratulations to you, you have achieved much which we had not even think of, keep making videos, winning contest, competitions, motivating us.

I got tle in this, could you plz tell me why?

int ans = 0;
for(int i = 1 ; i <n; i++){
	int x = n-i;
	for(int j = 1; j*j<=x; j++){
		if(x%j == 0){
			ans++;
		if(x/j != j){
			ans++;
		}
		}
	}
}
// ans += ans;
cout << ans ;

Resubmit your code, you will get to know about the WA Testcases...

My solution for Problem C doesn't work out and I could not figure out why? Basic Idea of my solution: 1. Make a 2D array storing all the values(sum of pairs) 2. Finding Frequency and getting the sum(for which I get max freq) 3. Then checking for all the possible values of pairs for which I get the sum and ignoring the indexes where I have taken values...

Please help My solution 89058810

I look over the standings and check whether I am leading or not

Yaa I got it, Thanks

Please look over my code, I could not find out which cases I am missing, Is my logic correct?

Why have you stopped making video editorials for codeforces contest problems?

Is there any Youtube channel for video editorials of Atcoder contests?

Here is my code for B-Multiplication, two of the test cases aren't giving AC, could not identify the bug. Can anyone help me?

I saw a solution of Ashishgup, here at line 30 I could not figure out, why a comparison with 1e18 + 5 is done, instead of 1e18?