Any way to filter practice problems?
I was thinking whether there was any way to filter practice problems like Unsolved/Solved/All. That can help. In the beginning it won't matter but if I keep on practicing soon I might be missing problems.
View Articletest case generation
how do the problem setters/testers generate test case? Is it by done by using some random procedures or by manually?
View Articlewhat is the problem in this code
package ATM;public class Example { double newBalance; public double operation(double balance,double withdrawl) {if(withdrawl%5 !=0) { System.out.println("Please Withdraw in multiple of 5"); } else...
View ArticleHow to compare xml value to user defined value in jsp
I am making a program which will take a text data from user. now, i want to check that this given data is present in my xml file or not. like:<c:import url="dict.xml" var="url"/> <x:parse...
View ArticleSet System.setOut(); to Command Prompt
I want to set output stream to the Command prompt like this:Process p = Runtime.getRuntime() .exec("C:\\Windows\\System32\\cmd.exe /c start cls"); System.setOut(new...
View ArticleUsing `scanf` for `unsigned long long int` with MinGW.
#include <stdio.h> int main (void) { int t; int y, z, a, b; scanf ("%i", &t); for (t; t > 0 ;) { scanf ("%i", &y); --t; } return 0; } The above code works fine and the program ends...
View ArticleCHEFGAME - Editorial
PROBLEM LINK:PracticeContestAuthor:Roman RubanenkoTester:Hiroto SekidoEditorialist:Anton LunyovDIFFICULTY:MEDIUMPREREQUISITES:Prim's algorithmPROBLEM:The best described in the problem statement.QUICK...
View ArticleMarking solved problems not working in MAY 2013 contest (1.4)
I realized that my Chrome extension is not working in MAY 2013 long contest...related to - http://discuss.ww2.codechef.com/questions/3011/a-green-mark-for-solved-practice-problems
View ArticleDELISH codechef june 2013 challenge
http://www.codechef.com/viewsolution/2240031 Someone please point out my mistake in this code.
View Articleruntime error[ACMKAPD]
it is giving runtime error each time.. i made small changes but all in vein.. http://ideone.com/KoYhtz is my solution problem is: http://www.codechef.com/problems/ACMKANPD/and i always waste my time in...
View Articlethe little elephants and candies
whats wrong with this code in python 3.1.2....for the problem "the little elephants and candies"?import sys t=int(input()) for i in range(t): n,c=map(int,sys.stdin.readline().split())...
View ArticleWhat should i do ?
i am really good at writing algorithms (pseudo code)...but i am not able to implement it properly. i am still in the learning c++. what do i do to be a master this skill reply soon.............. with...
View ArticleAMSGAME1_wrong ans
someone please tell why i am getting wrong answer in following code : http://www.codechef.com/viewsolution/2232651 OR please provide me with some test cases with which i could figure out my mistake.
View ArticleTime complexity of Dijkstra's Algorithm
I coded up an implementation of Dijkstra's Algorithm.It works correctly as I had coded from a pseudocode which was very abstract for a MOOC,6 months back. However,I wanted to know what is its running...
View ArticleAMSGAME1 - Editorial
Problem Link:PracticeContestDifficulty:CAKEWALKPre-requisites:gcdProblem:You are given a set of N positive numbers A[0], A[1], ..., A[N-1]. At each step you pick two unequal numbers and replace the...
View ArticleComparing floating point numbers
This is my solution for the problem ALCHEMY on SPOJ :#include <stdio.h> int main (void) { float a = 1000, b = 37; unsigned long int x, y; float z = a / b; for (x,y; x != -1, y != -1;) { scanf...
View ArticleRuntime error in GCD2
Why this simple code is giving me Runtime error...????#include<stdio.h> int gcd(int a,int b) { if(b==0) return a; else return gcd(b,a%b); } char ch[251]; int remaind(int a) /*To calculate...
View Articlecomputational geometry tutorial
can any one provide some good source for studying computational geometry?
View ArticlePlease explain me what are binary indexed trees and how do they work.
I am not able to understand how to implement binary indexed trees. I cant understand how they work. If someone could please explain me in detail how to use them along with an example.Thank you.
View ArticleEnormous input test (INTEST)
Here's my code :#include <stdio.h> int main (void) { unsigned long long t, y, z, a; a = 0; scanf ("%I64u %I64u", &t, &y); for (t; t > 0 ; --t) { scanf ("%i", &z); if (t == 0)...
View Article