Clik here to view.
Swaccha Bharat Abhiyan - Editorial
PROBLEM LINK:PracticeDIFFICULTY:MEDIUMPREREQUISITES:Graphs, greedy algorithmsPROBLEM:Our aim is to clean maximum squares within the given time.EXPLANATION:Ok, let's start from the starting point. We...
View ArticleChallenge problem rejudge
Although the challenge problems have been rejudged.. The new scores of the participants have not been updated in the the rank list and therefore, we dont know our actual rank. I just wanted to know my...
View ArticleZCO-contest
Hi! I am a beginner competitive c++ programmer.I don't know c++ well.I was trying ZCO question and i entrapped in chewing problem What should i do when i stuck in ZCO problem I am preparing for...
View ArticleData Structures and Algorithms
Hi all, I need your help to make a list of most used data structures and algorithms along with their tutorials, implementation and some problems on them. It will be helpful to everyone in many ways. I...
View ArticleJava - Competitive Programming Tricks
Till date, I have been using C++ for contests and I would like to try Java for some of the contests from now on so that it will be a practice for me.So, are there any Java tricks that can be used in...
View ArticleTRACTK3 - Editorial
PROBLEM LINKDIFFICULTY:EASYPREREQUISITES:BASIC PROGRAMMING KNOWLEDGEPROBLEM:There are n boxes containing $10^9$ Rupees each. Now the terrorists will pass a few queries which need to be executed as per...
View ArticleSecond largest element in a binary search tree.
How to find out the second largest largest element in a binary search tree?
View ArticleDIVMAC Editorial (Unofficial)
Here is the Link for the problem for those who are just surfing the forum randomly ;) DIFFICULTY Easy-Medium PRE-REQUISITE 1) Segment Tree 2) Sieve of Eratosthenes PROBLEM: Given an array A of N...
View ArticleGetting started here, questions about strategy, etiquitte, etc.
Hi guys. I've just started here, I have a few questions about how I approach this place. Firstly, let me just say that wow - some of the problems here are pretty difficult, even for easy!Alright, so...
View ArticleHow strong is plagiarism ?
Does changing variables and doing some minor changes also detected at end of the contest ?
View ArticleHROC101-Editorial
In this problem, the well known Fermat's Little Theorem is used to calculate the large power of numbers.typedef long long ll; const ll MODULUS=1000000007; ll p(ll b, ll e, ll m) { ll c=1; while(e) {...
View ArticleJLY-Editorial
The idea is to maintain a boolean array to store set of absolute difference of successive elements. a) If absolute difference between two elements is more than n-1 or 0, return false. b) If an absolute...
View ArticleHROC106-Editorial
Here is the Solution #include<bits/stdc++.h> using namespace std; int N; int R[100]; int X[100]; int Y[100]; int dist2[100][100]; inline int sq(int n){return n*n;} bool f(const double rad) {...
View ArticleHROC102-Editorial
Here is the Solution #include<bits/stdc++.h> using namespace std; int main() { int a[6][6],maxsum=INT_MIN,sumnow; cin.sync_with_stdio(false); int t; cin>>t; while(t--) { maxsum=INT_MIN;...
View ArticleMTX-Editorial
Here is the solution const int MAX=1600000; vector <long long> p(1600000); void solve(){ for(int i=0; i < MAX ; i++ ) p[i]=1; for(int i=2; i < MAX; i+=2){ int j=i, c=0; while (j%2==0)...
View Articlehroc104-Editorial
Here is the Solutionint main() { int T; cin >> T; while (T--) { string S; cin >> S; string S2; cin >> S2; int count1 = 0; int count0 = 0; int countq = 0; for (int i = 0; i <...
View ArticleClik here to view.
The Bookshelves Problem
Can someone tell me where i am doing wrong for this problem i am currently trying for K = 1.
View ArticleZCO Dynamic Programming problems
Can anyone please help me with these ZCO problems concerning Dynamic Programming.The first Problem I want to speak of is ROUNDTABLE(The Problem):This problem is seems analogous to Choosing...
View Article