Few Months back I found the problem
on Code Sprint
1/x + 1/y = 1/N! (N factorial). For large value of N
we have to find the par of (X,Y) which satisfy the equation
my sol was slow ,
can any pleas help me .
Thanks
Kumar Vishal
--
You received this message because you are subscribed to
I m Trying to make BSTand checking if node already there just
return ,trying to return 1
but here its returning 0 ,
lease help
// btree.cpp : Defines the entry point for the console application.
//
#include stdafx.h
#includestdio.h
#includestdlib.h
#includeconio.h
struct Node
{
int
On Sun, Jun 13, 2010 at 18:36, souravsain souravs...@gmail.com wrote:
Lets keep discussions in t his group limited to Algos and problems
neutral to any language.
Yes, please.
--
http://roshan.mathews.in/
--
You received this message because you are subscribed to the Google Groups
Algorithm
On Mon, Dec 14, 2009 at 11:02 PM, vicky mehta...@gmail.com wrote:
Given a file with a lot of words (10 million) find out the top 10%
most
frequently occuring words.
http://www.cc.gatech.edu/classes/semantics/misc/pp2.pdf
--
You received this message because you are subscribed to the Google
