“Computers can figure out all kinds of problems, except the things in the
world that just don't add up.” - James Magary
Department of Mathematics, IIT Roorkee presents Code Rush, an online
programming contest as part of its technical festival Cognizance 2013.
There will be 4-5 problems with a
Hello,
HAFT is a rooted binary tree in which every non-leaf node v has following
properties:
i. v has exactly two childrens.
ii. the left child of v is root of complete binary subtree, containing half
or more of v's descendants.
Some examples of HAFT are given in attached image.
Can anybody
To construct a HAFT of with N leaves:
a) if N=2^K for some K=0, then construct a complete tree with N leaves.
b) otherwise, suppose 2^K N 2^(K+1), then
1) construct root node R.
2) construct a complete binary tree with 2^K leaves as the left child of R.
3) construct a HAFT with (N-2^K) leaves
Hi,
I need code to convert Regular Expression to NFA and then check whether it
accepts an input string or not.
Please help !!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
Are you summing the numbers on each set query?
Sukun Tarachandani
IDD Electrical Engineering(2nd year)
IIT Roorkee
On Fri, May 4, 2012 at 10:56 PM, vIGNESH v v.v.07121...@gmail.com wrote:
Hai
Can you brief about the rest of the cases?
On 4 May 2012 01:56, Umer Farooq the.um...@gmail.com
They haven't shared the rest of test cases. However, the execution time
difference is extremely high.
It took about 0.3 and 0.6 sec for the cases in which it executed
successfully. However, it was taking more than 5 sec on test cases in which
it couldn't run.
On Fri, May 4, 2012 at 10:26 PM,
I meant what is your algorithm, are you summing up the entire numbers A and
B every time a set query is made?
Sukun Tarachandani
IDD Electrical Engineering(2nd year)
IIT Roorkee
On Fri, May 4, 2012 at 11:32 PM, Umer Farooq the.um...@gmail.com wrote:
They haven't shared the rest of test cases.
Nevermind i read your code.
Your algorithm is wrong. what you are doing here is adding up the complete
binary numbers A and B every time a query is made.
Instead use something like a bitvector for java to store the two binary
numbers and another bit vector to store C, and another to store the
http://en.wikipedia.org/wiki/Bit_array
Sukun Tarachandani
IDD Electrical Engineering(2nd year)
IIT Roorkee
On Sat, May 5, 2012 at 9:49 AM, Sukun Tarachandani sukun...@gmail.comwrote:
Nevermind i read your code.
Your algorithm is wrong. what you are doing here is adding up the complete
hi guys i am a final year student of engineering and i am working on an
ONLINE EXAMINATION SYSTEM just like GATE, GRE usually used by prometrics.
now i am come across one problem, i want that during the exam the student
is not able to navigate(can't open anything else just work on test)
anywhere
you have to write a program which tell about how many times it has run.
ex:
if you run first time it will print 1.
if you run second time it will print 2.
like this.
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
10it60...@iitkgp.ac.in
--
You received this message because you are subscribed
use a file...every time we run it... get number from file increment it print
it and again replace back to filedats it.
On Sat, Oct 15, 2011 at 3:56 PM, kumar raja rajkumar.cs...@gmail.comwrote:
you have to write a program which tell about how many times it has run.
ex:
if you run first
What would be the efficient way to code this program.??
Given an array of size n, find all the possible sub set of the array of size
k(all the subsets must be of size k).
--
Kind Regards
Ishan Aggarwal
Phone : +91-9654602663
--
You received this message because you are subscribed to the
best way it to invoke the function recursively
just like a k-1 ary tree
correct me if im wrong
On Sat, Sep 10, 2011 at 2:49 PM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
What would be the efficient way to code this program.??
Given an array of size n, find all the possible sub set
can someone plz provide the solution to it???
On Sat, Sep 10, 2011 at 9:30 PM, sukran dhawan sukrandha...@gmail.comwrote:
best way it to invoke the function recursively
just like a k-1 ary tree
correct me if im wrong
On Sat, Sep 10, 2011 at 2:49 PM, Ishan Aggarwal
I am trying to solve this problem, got some idea but am not
clear...please give your input...
http://www.codechef.com/problems/MONEY
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Hello,
Does anybody have a program/algorithm about finding a support function
of any given planar curve?
thanks
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
17 matches
Mail list logo
