Reminder: Contest starts in 4 hours.

Yesterday's contest has a 30 minute long queue.

Can you confirm faster judging time today?

I have a suggestion to assign weight to every problem according to difficulty. Is that possible? CodeChef_admin

Can GOOD_OPR be solved without calculating the formula for SUM(i*j*k) L <= i < j < k <= R ?

Can anyone tell me why my submission is incorrect? https://www.codechef.com/viewsolution/95676624 I have been trying for an hour to figure it out

Did anyone else solve the MST problem using divide and conquer and rollback?

The min OR spanning tree problem without queries

Did something like this in UTLA,

for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
        int c = a[i] + a[j];
        next_dp[j][c] = max(next_dp[j][c], dp[c] + 2);
    }
    for (int j = 0; j < i; ++j) {
        int c = a[j] + a[i];
        dp[c] = max(dp[c], next_dp[i][c]);
    }
}

What is the name of this kind of dynamics when we maintain the state of the dynamics so that it always contains only pairs that end before i?

Can anyone suggest tasks where a similar approach can be used?

What is the point of making straight forward probability problem in contest? Is this a math exam?

Problem : here Can someone help me with a test case this code fails at?

#include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;


int main() {
	ll t; cin>>t;
	while(t--){
	   ll n; cin>>n;
	   string s; cin>>s;
	   vector <char> a,b;
	   ll j=0;
	   while(j<n && s[j]=='1'){  a.push_back('1'); b.push_back('0'); j++; }
	   for(ll i=j;i<n;i++){
	       if(s[i]=='0'){
	           a.push_back('0'); b.push_back('0'); continue;
	       }
	       ll k=i;
	       while(k<n && s[k]=='1') k++;
	       if(k-i==1){
	           a.push_back('1'); b.push_back('0');
	       }
	       else{
	           a.pop_back(); a.push_back('1');
	           for(ll p=0;p<k-i;p++){
	               a.push_back('0'); b.push_back('0');
	           }
	           b.pop_back(); b.push_back('1');
	           
	       }
	       i=k-1;
	       
	   }
	   for(auto x : a) cout<<x;
	   cout<<endl;
	   for(auto x : b) cout<<x;
	   cout<<endl;
	   
	}
	
	
	
	return 0;
}

Problem : here