What are some good cookoff strategies?
I am participating for the first time in COOKOFF competition. So I want to know what are some of the best strategies to apply while solving problems, in such a short duration contest?
View Articlehow multiply two large numbers stored in arrays?
I found a very good algorithm to multiply two numbers if one of them is very large... It is very nicely explained in the followng Codechef tutorial!!...
View ArticleWhat is left rotation (
What is left rotation(<<<) and right rotation(>>>) ..?? Someone please explain them..or just give me a link to read about them .. I was solving problem One Dimensional Game of Life...
View ArticleNow how to solve this problem
http://www.spoj.com/problems/RENT/How can i solve the above problem please help !!!
View ArticlePainting WA???
http://www.codechef.com/viewsolution/4132176 plzzz give test cases where my code fails???
View ArticleClik here to view.
IDOLS - Editorial
PROBLEM LINK:PracticeContestAuthor:Konstantin SokolTester:Tasnim Imran SunnyEditorialist:Praveen DhinwaDIFFICULTY:HARDPREREQUISITES:heavy light decomposition, segment treePROBLEM:There are N persons in...
View Articlewhy wrong ans ...i tried all possible test case i can think
http://www.codechef.com/COOK47/problems/PNTNG my solution is http://www.codechef.com/viewsolution/4132102 plz help me...
View Articleproblem in accessing
the link to short contest is not opening this is the link http://www.codechef.com/COOK47
View Articlecant get which test case is missing
i cant get which test cases are missing.. i sorted the array elements and in for loop within a for loop got the nos. subsequent divided by prime factor.. pls see the link...
View ArticleCooling pies help!
here's my code: http://www.codechef.com/viewsolution/4132385please tell me what's wrong with this? it's working in my compiler.
View ArticleCoded almost same as Editorial still WA! Can anyone point out what went wrong?
Thanks a ton!Problem: http://www.codechef.com/problems/PNTNGMy solution: http://www.codechef.com/viewsolution/4131658
View ArticleWA IN FLAGS... PLZ HELP
Here are two soln's that are almost same...1 is ac :-- http://www.codechef.com/viewsolution/4128188 ..nd other shows wa :-- http://www.codechef.com/viewsolution/4129571 ...(mine)the one that shows wa...
View ArticleFLAGS - Editorial
PROBLEM LINK:PracticeContestAuthor:Konstantin SokolTester:Tasnim Imran SunnyEditorialist:Praveen DhinwaDIFFICULTY:CAKEWALKPREREQUISITES:simple combinatorics.PROBLEM:Given following 5 patterns of a...
View ArticleLevy Conjecture, Sieve of Eratosthenes,TLE problem.
link: http://www.codechef.com/problems/LEVY/include<stdio.h>include<stdlib.h>include<math.h>int main() {int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); int A[n],i;...
View Articlejava time limit
I want to ask one frequent question.In many problems i saw that in java if we submit problems then it can get submitted even if time taken by it is beyond the given time limit.How is this...
View ArticleClik here to view.
WTHINGS - Editorial
PROBLEM LINK:PracticeContestAuthor:Konstantin SokolTester:Tasnim Imran SunnyEditorialist:Praveen DhinwaDIFFICULTY:MEDIUM HARDPREREQUISITES:binary search, convex polygonsPROBLEM:You are given a strictly...
View ArticleKNPSK - Editorial
PROBLEM LINK:PracticeContestAuthor:Konstantin SokolTester:Tasnim Imran SunnyEditorialist:Praveen DhinwaDIFFICULTY:EASY-MEDIUMPREREQUISITES:greedy, sortingPROBLEM:You are given N items, each item has...
View ArticlePNTNG - Editorial
PROBLEM LINK:PracticeContestAuthor:Konstantin SokolTester:Tasnim Imran SunnyEditorialist:Praveen DhinwaDIFFICULTY:EASYPREREQUISITES:sorting, greedyPROBLEM:Given a three dimensional table of dimensions...
View ArticleCoin change problem : UVa 11137 - Ingenuous Cubrency
Hey, I have just started learning Dynamic Programming. I solve the problem in this way.for(i=0;i<21;i++) for(j=0;j<N;j++) if(j>=coins[i]) ways[j]+=ways[j-coins[i]]; then I try to solve By...
View ArticlePALIN: provide me some corner cases where my program is falling..
#include< stdio.h > #include< string.h > int comp(char a[],char s[],int l) { int i; for(i=l/2 ; i < l ; i++) if(a[i] < s[i]) return 0; else if(a[i] > s[i]) return 1; } int...
View Article