How did you got to know? Was there a blog post?

Between thanks for letting me know :)

You need to create a team first and then register as a team. Then select whoever is on the team and is participating.

Ideally, you should fill the form first and then register for the contest, but it is fine. Filling the form actually makes you eligible for prizes.

Till last year we used to have this offline and used to have 2 members per team, so we made the difficulty of problems and length of the contest according to teams having at max 2 members this year too. I understand that it would have been better to participate in a team of 3 like ICPC xD

Email address. I don't know if its called something else .

I know, we should have done that way early. Really sorry about that. All of us were busy setting up the contest and totally forgot about the announcement.

yes

Bruh this contest's on Codeforces.

You should be able to upsolve problems check again.

Yes

When can we expect the editorial ??

I think that the editorial should have been ready and posted by now.

So, when are you planning to release it (or write it) ?

It is a big random test case.

Consider the path, (1,1)->(2,1)->(2,2)->(2,3)->(3,3). The product will be (2^6) * (7^1) * (3^4). Y=7*3*2. So, k=1 as Y^1 only divides the product

This is my solution for this problem:

/**
 * author: said_v15
**/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
typedef long long  ll;

#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++) 
#define pb push_back 
#define sc second 
#define f first 
#define kek cout<<"\n"; 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(v) ((v).begin()), ((v).end()) 
#define int ll


const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
const int MAXN = 1000100;
const int INF = 1e8;
const ll LL_INF=1e18;
const double pi=3.1415926535;
using namespace std;
int divide(int a, int b)
{
          return (a+b-1)/b;
}

int32_t main()
{
    #if defined(_DEBUG)
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
    #endif
 fast;
 // cout << fixed << setprecision(12) << ans;
 // string al = "abcdefghijklmnopqrstuvwxyz";
 
 int questions=1;
 // cin>>questions;
 while(questions--)
 {
     ll n,m,k;
     cin>>n>>m>>k;
     vector<pair<ll,ll>> v(k);
     for(ll i=0;i<k;i++) cin>>v[i].f>>v[i].sc;
     sort(all(v));
     // for(auto x: v) cout<<x.f<<" "<<x.sc<<endl;
     ll ans=0;
     ll li=v[0].f, lj=v[0].sc;
     bool ok=1;
     for(ll l=1;l<k;l++) 
     {
            ll i=v[l].f;
            ll j=v[l].sc;
            if(i>li && j<lj) { 
                ans+=(i-li)*(m-lj+1);
                lj=min(lj,j);li=max(li,i);
            } 
            
     }
     ans+=(n-li+1)*(m-lj+1);
     cout<<ans;
     
     
     
     
 }
    
 
 // !!! LOOK AT NUMBER OF QUESTIONS IN A PROBLEM !!! (cin>>questions)
 

  // cout <<"Runtime is:"<<clock() * 1.0 / CLOCKS_PER_SEC <<endl;
   return 0;
   
}

It's a big random test case