Quantcast
Channel: CodeChef Discuss - latest questions
Browsing all 39796 articles
Browse latest View live
↧

Marking 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 Article


DELISH codechef june 2013 challenge

http://www.codechef.com/viewsolution/2240031 Someone please point out my mistake in this code.

View Article


runtime 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 Article

the 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 Article

Time 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 Article


What 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 Article

AMSGAME1_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 Article

AMSGAME1 - 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 Article


Runtime 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 Article


Please 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 Article

Enormous 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

COOLING - Editorial

PROBLEM LINKSPracticeContestDIFFICULTYEASYEXPLANATIONThe following greedy algorithm always finds the optimum answer:Choose the lightest pie not yet on a rackIf none of the remaining racks can hold this...

View Article

whats the best book/source to learn the following: proofs, including proofs...

hi just mention the best source/link/book to learn specifically the following

View Article


bulid up concepts for combinatorics in programming?

If someone is aware of any online resource/book for combinatorics questions in programming i.e. subject formulas, problems please help.

View Article

books on algorithm

can anyone pls suggest a good book for ds and algorithm im a beginner so choosing a good book matters a lot .thanks

View Article


atm..wrong answer..cannot find the reason..

Below is the code that i wrote but it always shows"wrong answer" when i submit it.Can some please tell me what is wrong in it? thanx in advance...#include <iostream> #include <iomanip>...

View Article

SUMTRIAN Submission doubt

I am not sure how solutions which require more than the specified time limit (which is 3 sec) got...

View Article


Comparing 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 Article

linear search

hey so this is my code for linear search. is there a problem with this?. coz its not comparing and returning if i enter an element which does not exist in the array#include<stdio.h>...

View Article

holes:wrong answer..not able to find the reason..pleazzz help!!

#include<stdio.h> #include<string.h> int main() { int tc,c,i,flag=0; scanf("%d",&tc); for(c=0;c<=tc;c++) { char str[100]; char *string; string=gets(str);...

View Article
Browsing all 39796 articles
Browse latest View live


<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>