DEFACING - Editorial
PROBLEM LINKSPracticeContestDIFFICULTYEASYPREREQUISITESBrute force, GreedyPROBLEMWe are given an integer S represented in a 7-segment display. Add some segments or digits into it to create the as large...
View ArticleModular Exponentiation and large numbers
I am having trouble in understanding how this code is giving the correct answer for larger test cases (TL > limit of long long int). Suppose TL =...
View ArticleNZEC error.
Hi, I always recieve a non zero exit code? Why is that happening? Could someone look at my code?def fact(n):#factorial function if(n==0): return 1 return(n*fact(n-1)) def coeff(n,k):#binomial...
View ArticleATM why can't i submit a program in TCL?
I just completed the ATM script in TCL, but when I goto upload it TCL is not an available option!! what gives?
View ArticleProgramming Language to use
Hi,The only programming language I m familiar with is C#. But i see most of the guys using C, C++ or java.Do I need to learn one of these languages or is it fine with C#?
View ArticleVirtual Contest..
Why doesn't codechef include the feature of virtual contest ? There were some really good contests held within the last 1 week but due to some issue i couldn't participate in them .It would be really...
View ArticleWhy downvote?
@gautam94 : What is your problem man? why are you down voting my comments? is there anything wrong in my answers?
View ArticleClik here to view.
Resistance- How do i fix this code ?
This is the code i have written for the resistance problem.I have written recursive functions to calculate numerator and denominator. In the end I am reducing the fraction by recursively dividing...
View ArticleINTEG : time limit exceeded
my solution here to the INTEG problem is giving me time limit exceeded and I cant figure out why or even give an example that produces TLE I checked the editorial and I believe I am using the approach...
View ArticleNeeded a simple understandable explanation of Hopcroft-Karp Maximum Matching...
I went through many articles, wiki page but I am not able to understand the concept behind it. I got the concept of augmenting path and how it increases by one every time untill max matching is found,...
View Articlehow to make a wordpress plugin which post on visitors wall after some time
To post on your own wall i can use facebook auto post plugin. But if i want to post on visitors wall after sometime then how could it be implemented.The concept is same like...
View ArticleDRGHTS-Editorial
PROBLEM LINK:PracticeContestAuthor:Sergey NaginTester:Hiroto Sekido, Gerald AgapovEditorialist:Ajay K. VermaDIFFICULTY:EasyPREREQUISITES:Depth first traversalPROBLEM:Given a forest with N nodes, where...
View ArticleShortest Path in a Graph visiting all nodes atleast once!
I have been trying to solve following problem from topcoder practice problems:Problem LinkI have found one of topcoder user's solution, but I could not understand it. Can somebody please explain me the...
View ArticleCode for the practice Problem Life, the Universe, and Everything'.Its giving...
include<iostream>using namespace std; int main() { int a; A: cin>>a; if(a==42) return 0; cout<<a; goto A; return 0; }
View ArticleCode for the practice Problem Life, the Universe, and Everything'.Its giving...
include<iostream>using namespace std; int main() { int a; A: cin>>a; if(a==42) return 0; cout<<a; goto A; return 0; }
View ArticleHow to solve this segment tree problem?
http://www.codechef.com/AICL2014/problems/ACMICL04 . Can anyone give an approach to solve this segment tree problem.
View ArticleIOPC14R : WA - Unable to understand where I'm getting the WA
The problem i'm trying to solve is the IOPC14R, viz. , LCS Returns.Now I did see the accepted solutions and are very similar to my solution . The thing is that I am getting a WA and dont know at what...
View ArticleMARCHA2 - weird sitiuation
so, I am getting a very weird wrong answer for the Johnny and the Beanstalk problem . and here is my original solution.I even tried to mimic the accepted solution here with my solution here and I still...
View ArticleCode for the practice Problem Life, the Universe, and Everything'.Its giving...
include<iostream>using namespace std; int main() { int a; A: cin>>a; if(a==42) return 0; cout<<a; goto A; return 0; }
View Article