LEALCO - Editorial
PROBLEM LINK:PracticeContestAuthor:Vitaliy HerasymivTester:Anton LunyovEditorialist:Anton LunyovDIFFICULTY:EASYPREREQUISITES:Bitmasks, BacktrackingPROBLEM:You are given an array R[0], R[1], ..., R[N-1]...
View ArticleCan Mtech students appear for ACM-ICPC WF ?
Are MTech or MS students eligible for ACM ICPC WF ?
View ArticleWA in MARBLEGF
I am having a problem in solving this question - http://www.codechef.com/DEC13/problems/MARBLEGF/ here is my solution-http://www.codechef.com/viewsolution/3073979 If someone could help me to point out...
View ArticleStatement for problem SEAGRP updated
Hello @all,As some people were saying that the statement for this problem had some minor notation issues, namely with the limits for the test cases and for the values of n and m, I've decided to speak...
View ArticleC or Cpp which is better?
i have this doubt from when i started solving codechef problems.Now i am programming in C language only.Is learning complete C language is more adequate to become a good_programmer/master in codechef...
View Articlecant understand why it is showing wrong answer
include <iostream>include <iomanip>int main() { using namespace std;int wdraw; float bal; float left; cin >> wdraw; cin >> bal; if(wdraw <= bal) { if(wdraw%5==0){ left =...
View ArticleComplexity and Execution time
Suppose a C++4.8.1 program is O(N) and N=10000, then how much time (in seconds) will it approximately take to run?
View Articlewhat is buffer
actually what is buffer why the values will be stored in buffer during programming
View ArticleBESTBATS - Top Batsmen explanation
NOTE: look for image numbers and corresponding images below. **codechef BESTBATS - "top batsmen" guidance: lets sort scores of players(qsort). here i sorted in decreasing order. the number of ways...
View ArticleSEGMENTATION FAULT
When I am trying to get a string as input from scanf it is running well on my codeblock IDE, but here it is giving me an SIGSEGV error. Please help. My code is here...
View Articlelook at this c program and check the answer and correct it...
include<stdio.h>void main() { int x,y; char ch; do{ printf("\n press '1' for addition"); printf("\n press '2' for substraction"); printf("\n press '0' for exit \n"); scanf("%c",&ch);...
View ArticleHelp with MTRICK
I have tried to optimize my code in almost every possible way yet i'm getting TLE. The link to problem is http://www.codechef.com/JAN14/problems/MTRICK and to my solution is...
View ArticleHelp me with MAXCOUNT test cases where my program does not work
What am I getting wrong answer for this program(MAXCOUNT)[from easy]? I have tried all possible test cases ie. for 1 occurence, for all occurence etc..Please help me find a test case where my code does...
View ArticleJust an idea on faster publication of editorials
Just saying...if the authors of the problems on long/short contests submit an explanation along with the problems there wouldn't be any delays. It'd be great if their explanation included the following...
View Articlepython run time error (NZEC) in spoj
My following code returns me the run time error in spoj during submission. Can anybody tell me how to remove this error. here is the link of the question http://www.spoj.com/problems/SERVS/import numpy...
View ArticleSmall tree problem
In a weighted tree, how to find for each node the other node farthest from it (in linear time)?Thanks
View ArticleADVICE NEEDED
hiii, i am happy to say that i have solved almost 50 questions and still willing to practice more...my problems is that most of the quetions i solved is from easy section and it needs only knowledge of...
View ArticleWA on firesc
I'm trying to solve http://www.codechef.com/problems/FIRESC/ problem. Im using bfs instead of dfs unlike the editorial.This is my solution http://www.codechef.com/viewsolution/3235157.Can somebody help...
View Articlepaying up wrong answer
#include<iostream> #include<math.h> using namespace std; int main(){ int ans,size,test; cin>>test; for(int i=0;i<test;i++) { cin>>size; cin>>ans; int a[size]; for(int...
View ArticleLUCKY3 - Editorial
PROBLEM LINKSPracticeContestDIFFICULTYMEDIUMEXPLANATIONFirst of all, notice that there are exactly 1022 lucky number of length between 1 and 9. We can solve problem for each lucky number independently,...
View Article