using System;
namespace Codechef__TLG_ 
{
    class Program 
    {

This is more optimum than the easy solution. In this solution, I don't have to calculate the cumulative sum for both players. I am just calculating the cumulative difference that is lead. If diff is positive p1 wins else p2 wins. Max lead will be the max |diff|.

#include <iostream>

#include<iostream>

using namespace std;

int main()

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...

The solution would be right if we only had to print the id numbers, We also have to print the total no. before printing the id's.

So you have to store each value in array then print ...

C++ STL (MAP ) SOLUTION:-

#include<bits/stdc++.h>

using namespace std;

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

That's awesome Rajashekar, great job. That was quick. :)

Next step is the Competitive Programming Playlist. Its long, but just take it one step at a time. Ask questions if you get...

i completed all the beginner problems posted...after these what i need to do next?

Thanks

You seemed to already know the answer XD Anyway, yeah, the problems I set will be mostly about maths. I cannot think "algorithmically" much myself :P

Please keep a mathematics problem like ISTA2001 in the coming ICO Prep Competitions. I really liked it. :)

Waiting eagerly for it bro

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: