expert now?

All the best everyone!

Guys Why so many contests are coming?

Math, AI, Coding clubs sound like an amazing chance for beginners to grow their skills

Guys why so many contest are coming?

Is this a rated contest? Can someone kindly answer?

Hi awoo,

Anything you can do to help with the crawling bans for hacking? These crawling bans have three key disadvantages:

1. Weaker test cases.
2. Weaker cheat detection.
3. Worse user experience.

On other platforms (such as leetcode), I can freely click through submissions which is valuable for additional test cases and cheat detection. On codeforces it seems like there’s a unique technical constraint that currently results in broad bans on anyone clicking through submissions at a normal pace.

Anything you can do to improve the experience for people who enjoy contributing to hacking rounds would be greatly appreciated.

Thanks,

DarkTemplarDrop

I hope I can reach Cyan in this contest

will i return to expert? we are waiting :)

I am newbie. Will I reach to pupil :)

no unrated participation?

watch me win

It would be great to have the unrated participation option available for all the contests, always, MikeMirzayanov ❤️

Will grind Hard to become Pupil, This time .

6 or 7 problems?

Not able to participate as unrated ;-;

wish to be a pupil

all the best!

wishing for +ve delta for everyone

For some reason I have a button to register unrated, and it does not show me that I am out of competition, and I'm definitely over 2100 rating.

As dumb a question as this might be, but are all the Educational rounds hosted by Neapolis University Pafos?

If yes, then what are they for exactly? Honestly, I join for rating.

Is it normal for so many submissions for a problem like D. It doesn't felt that easy.

How did so many solve E1????

Yet another time I feel E<D. Got stuck on D for one hour and do not have time to implement E2 :(

what rating range of question should I solve if I am stuck at C always for Div2?

speedforces

well well well , good D. Don't know how people solved it, stared screen for 1:30 Hour

Can someone tell how did they solve D?

Why using java in D gives TLe

A >> B ?

Why does Writing code in java gives TLE in D wheras CPP code works

Logic for C ?

  dp[0][1] = 0;
    dp[0][0] = 1;
    
    for(int i = 1; i <= n; i++)
    {
         // same 
         if(a[i] >= a[i-1] && b[i] >= b[i-1] )
         {
             dp[i][0] += dp[i-1][0]%m;
         }
         if(a[i] >= b[i-1] && b[i] >= a[i-1])
         {
             dp[i][0] = (dp[i][0]%m + dp[i-1][1]%m)%m;
         }
         
         
          if(a[i] >= a[i-1] && b[i] >= b[i-1] )
         {
             dp[i][1] += dp[i-1][1]%m;
         }
         if(a[i] >= b[i-1] && b[i] >= a[i-1])
         {
             dp[i][1] = (dp[i][1]%m + dp[i-1][0]%m)%m;
         }
         
         
    }
    
    int ans = dp[n][0]%m + dp[n][1]%m;

can someone tell me whats wrong in my code

can someone explain whats wrong in my code

  dp[0][1] = 0;
    dp[0][0] = 1;
    
    for(int i = 1; i <= n; i++)
    {
         // same 
         if(a[i] >= a[i-1] && b[i] >= b[i-1] )
         {
             dp[i][0] += dp[i-1][0]%m;
         }
         if(a[i] >= b[i-1] && b[i] >= a[i-1])
         {
             dp[i][0] = (dp[i][0]%m + dp[i-1][1]%m)%m;
         }
         
         
          if(a[i] >= a[i-1] && b[i] >= b[i-1] )
         {
             dp[i][1] += dp[i-1][1]%m;
         }
         if(a[i] >= b[i-1] && b[i] >= a[i-1])
         {
             dp[i][1] = (dp[i][1]%m + dp[i-1][0]%m)%m;
         }
         
         
    }
    
    int ans = dp[n][0]%m + dp[n][1]%m;

PS C:\Users\total\Desktop\prep\cf> g++ -o E.cpp E
C:/msys64/ucrt64/bin/../lib/gcc/x86_64-w64-mingw32/14.2.0/../../../../x86_64-w64-mingw32/bin/ld.exe: cannot find E: No such file or directory
collect2.exe: error: ld returned 1 exit status

Bruh minGW straight up deleted my files instead of compiling and then said "oh whoopsie I can't find the file :D"

I was able to even recover E once somehow and then it happened again sadge

got MLE on PD...
time: $$$O(n \sqrt {n})$$$
space: $$$O(n \sqrt {n})$$$
I forgot that $$$O(n \sqrt{n})$$$ is too large for space complexity...

D was really good problem. Any hints ?