Following the algorithm provided as hint ends up in TLE. I'm using C++. But anyway this was a great problem. I don't really care about passing the judge. Just as long as I know the solution

#include <bits/stdc++.h>

#define ll long long

#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

Simple Solution of Voters List using Vector and Set.

#include <bits/stdc++.h>

#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

Solution of Lead Game

#include<iostream>

#include<bits/stdc++.h>

using namespace std;

n=int(input())
diff=0
lead=0
leadingplayer=0
for i in range(n):

Here's A Recursive DP Solution of this!

Equals Gifts IARCS at master · JVJplus

yes sir plz

I submitted my solution at IARCS Problem Archive. A fatal error just keeps coming up without any reason. There seems to be this error with every C++ submission on IARCS's grader.

Here's my solution for anybody who may require help:

#include <iostream>
#include <algorithm>
 
using namespace std;
 

The complexity of Count Sort is O(n).

To what complexity can this solution be brought down to ? My code is O(nlogn). However, some people got O(n) without sorting. How is that possible ?

My code is available at [C++] PYRAMID.

Online registration for both ZIO-2019 and ZCO-2019 will open on Thursday, 27 September, 2018 .

Hi, Vishnu Lokhande

The registration for ZCO and ZIO will start in the month of september , You should visit this website Indian Association f...

Ok, well i founded some good sources for learning asymptotic analysis on forum and i learned it.

There is no question directly from Asymptotic Analysis. But but but.. you can't dream of being at IOI (even INOI) without being able to find the time and space complexity of your code.