Range overflow in VSN
When we are finding distance b/w P and Q (x2-x1)^2 + (y2-y1)^2 whole underoot.(for 2d case). Now according to constraint of co-ordinates (this value (x2-x1)^2 + (y2-y1)^2) can exceed max value possible...
View Articlesmall factorial solution
ok, I know that small factorial has a solution that is now known to the entire codechef( maybe an exaggeration )...but, is it legal, well, allowed to just use one of the library feature of a language ?...
View ArticleWhere have I been wrong in implementation please someone tell me, please?
I am working on this problem for 13+ hours. I read on the discussion that it would require two segment tree and now, I am not getting what is wrong with my code. Though it passes test-cases and I think...
View Articleapproach for BEERUS
Can anyone discuss their approach for this problem from this contest
View ArticleSolution for VSN not accepted
Can somebody please find out mistake in my solution ? I compared with those which were accepted, my equation matches, and the way i wrote the equation in quadratic, there is no chance of getting...
View ArticleShould we have proper ordering of questions in Short Contests
While trying problems in short contest, most of you must be puzzled - where to start. Which is the easiest problem? Since initially the questions are sorted randomly and sometimes the 4th and 5th...
View ArticleNPORP - Editorial
PROBLEM LINK:Div1Div2PracticeSetter-Denis AnishchenkoTester-Hasan JaddouhEditorialist- Click here to find out.DIFFICULTY:MEDIUM(This problem is MEDIUM w.r.t. thinking and wit required, while...
View ArticleClik here to view.
DARTSEGM - Editorial
PROBLEM LINK:Div1Div2PracticeSetter-Ildar GainullinTester-Hasan JaddouhEditorialist-Abhishek PandeyDIFFICULTY:HARDPRE-REQUISITES:Segment Tree, Convex Hull, Computation Geometry (i.e. the proof...
View ArticleClik here to view.
VSN - Editorial
Problem LinkPracticeContestAuthor:Rahim MammadliTester:Misha ChorniyEditorialist:Bhuvnesh JainDifficultyEASY-MEDIUMPrerequisitesCross Product, Binary SearchProblemGiven a stationary point $P$ and a...
View ArticleInvitation to CodeChef April Lunchtime 2018!
Hello Fellow Coders!The month of April held a special significance in the programming world, with the ACM-ICPC World Finals crowning a new world champion. So how about you cap off this brilliant month...
View ArticleCompilation of Plagiarism Concerns
Hello all, Since the last two weeks, I have seen multiple people on discuss putting forward their grievances regarding the plagiarism issue. Not only that, many of you have also mailed me your issues...
View ArticleHow to find maximum spanning tree in BEERUS?Please help
https://www.codechef.com/QUCO2018/problems/BEERUS
View ArticleClik here to view.
BIBOARD - Editorial
Problem LinkPracticeContestAuthor:TianyiTester:Misha ChorniyEditorialist:Bhuvnesh JainDifficultyHARDPrerequisitesFlows, Minimum CutProblemYou are given a grid consisting of $0$(white), $1$(black) and...
View ArticleProblem with merge sort tree
I read merge sort trees from here (https://discuss.codechef.com/questions/94448/merge-sort-tree-tutorial) understood the build function but I can't understand the query function.Why would you go top to...
View ArticlePlease suggest a fast method to find pth element in frequency table?
consider a sorted array with xi , xi+1, xi+2, ... , xi+n distinct elements with frequencies a0,a1,a2,...,an respectively. How can i find pth element in this?
View ArticleJune long challenge - difficult
Is it Just me, or did others too feel that the June long challenge for division 2 was a bit too difficult. Usually the first 3 questions are very simple, and another 3 questions are challenging, which...
View ArticleDo you think June Challenge(div2) was tough except first problem?
I think problems were too difficult. Except the first one with accuracy of 50+, all problems had accuracy in single digits or 11-14 (for 2 problems and a challenge). I need to know if everyone thinks...
View Articlewhats wrong in my code for frieza
include<iostream>include<string.h>using namespace std;int main() {int t; cin>>t;while(t>0) {string s="";cin>>s;int ans=0; int c;string s2="frieza";for(int i=0;s[i]!='\0';)...
View ArticleWhy is tis code giving SIGSEGV error although no array element is out of...
https://www.codechef.com/viewsolution/18891776 It is from beginner practice questions(TRACE).
View Articlea good set solve ?
okay, so I used two way to do this problem, first is using a custom fibonacci where instead of f(a) = f( a - 1 ) + f( a -2 ), I turned it into f(a) = f(a - 1 ) + f( a - 2 ) + 1, this should make sure...
View Article