Max sub array problem REIGN TLE
http://www.codechef.com/problems/REIGN my solution gives tle...can someone suggest optimisation for my code? My solution- http://www.codechef.com/viewsolution/3151583
View ArticleSmall Factorials, Java and big numbers
In the tutorial for the small factorials exercise: http://blog.codechef.com/2009/07/02/tutorial-for-small-factorials/ it states that there is built in support for dealing with large numbers in Java. My...
View ArticleWeak test cases for SEAGRP (Jan14 long contest)
The test cases for the problem SEAGRP are weak. Many wrong solution are being accepted which must have failed if test cases were good. One of my friend got accepted but his code giving wrong answer on...
View ArticleATM PROBLEM ERROR
the judge is saying this is wrong ! i can't find the error. please help ! thanks.include <iostream>include <iomanip>using namespace std;int main() {int x; float y; cin>>x>>y;...
View ArticleBESTBATS - Top Batsmen, WA, help pls.
http://www.codechef.com/problems/BESTBATS getting wa. here is my code: http://ideone.com/E8AnqD#include <iostream> #include <cstdio> #include <cstdlib> using namespace std; int...
View Articleproblem ATM Wrong answer
#include<iostream> #include<stdio.h> using namespace std; int main() { int amt; float bal; cin>>amt>>bal; if(amt%5==0&&amt<bal) { bal=bal-amt-0.50; }...
View ArticleTie breaker problem
Hi,What does fractional score means? Do we get points for partial solutions?
View ArticleTLE and WA
If my solution is both WA and TLE, will it say it a WA or TLE? i.e Can a TLE solution be wrong also?
View Articlehow to decide which algorithm technique to follow?
can somebody help me to know that how do we decide the algorithm technique to be used ? like i should apply greedy approach to a problem or DP or divide and conquer.or i should always try greedy and if...
View ArticleClik here to view.
RECTQUER - Editorial
PROBLEM LINK:PracticeContestAuthor:Roman RubanenkoTester:Gerald AgapovEditorialist:Jingbo ShangDIFFICULTY:EasyPREREQUISITES:Prefix sumPROBLEM:Given a N*N matrix of at most 10 different numbers, answer...
View ArticleInput test cases/Boundary/Tricky
Find tricky/boundary/edge test cases for the problem belowGiven a paragraph of text, write a program to find the first shortest sub-segment that contains each of the given k words at least once. A...
View Articlei want a code to find prime numbers in a given range using while loop.
#include<stdio.h> #include<conio.h> void main() { int x,z,y=2; //x is lower limit and z is upper limit of range printf("enter the no."); scanf("%d%d",&x&z); while(x<=z) {...
View ArticleClik here to view.
QTREE6 - Editorial
PROBLEM LINK:PracticeContestAuthor:Minako KojimaTester:Gerald AgapovEditorialist:Jingbo ShangDIFFICULTY:HardPREREQUISITES:Link Cut Tree, Heavy-Light DecompositionPROBLEM:Given a 0/1 colored tree of N...
View ArticleIARCS Problem
http://opc.iarcs.org.in/index.php/problems/TASKFORCE is the problem I've been working on for so many hours, yet no luck. Please Help!!#include <iostream> using namespace std; int edg(int); int...
View ArticlePlease like me problem error
//CODE DELETED, LIVE CONTEST//using long long int i am getting wrong answer please explain...
View ArticleCannot view current contest ranking
I want to tell that we cannot view the current contest rankings.After checking the first few pages we cannot look further..:( Please look into the matter
View Articledivquery problem
hallo, I just registrated and saw this interesting problem here http://www.codechef.com/problems/DIVQUERY/ ,I make some code I and I think it is fine ,when I type the same input like in the problem the...
View Articlepaying up(wrong answer)
include<cstdio>include<cmath>int main() { int x,sum,flag=0; unsigned int t; scanf("%u",&t); int nonotes,money,d[20]; for(unsigned int k=1;k<=t;k++) { fflush(stdin);...
View Article