hey everybody we all know that we love programming and certainly all
are appearing fro code4bill so instead of mugging in a small place why
dont we move to a group like CODE4BILL ASPIRANTS. we can discuss
problem better there
hi every1 ,
I m Himanshu Sawhney , MCA student from D.U. Just joined this group .
I've formed a sol. plz chk it out
mark_last_cell(start,end,number)
{
if(start==end)
a[start]=1
return
mid=(start+end)/2
mark_last(start,mid-1,number-1)
A general approach to problems like this is to find an algorithm that
maps the integers 0..N-1 to the N possible sequences that satisfy the
constraints. Then the problem reduces to finding a random integer.
Me also got Promoted. Round 3 is technical. Don't know C++ good. Will
rely on C.
Yes. You can cast the program as a DP, but the memo table may well
have size exponential in the number of weights due to the NP hardness.
I.e. in general the "DP" degenerates into an exhaustive search. Trees
with internal isomorphisms (including A(j) values) improve efficiency.
The DP is of the
I've got a problem that's roughly like this: i've got a finite set of
objects each of which has the same set of properties describing its
current state. I want to create a random ordered list of these
objects, but the sequence is subject to certain rules. As an example,
suppose that you want to
Only posts related to online programming contests can be posted there ,
others will be moderated down. You need not be a member of gmail or
have an google account. Anyone can post the message.
Hi,
I have started a new group for posting online programming contests.
Please do post of any online programming contest there , if not please
cc.
http://groups.google.com/group/iopc
Regards
Terry.
it is NP, but I am have this feeling that there is a dynamic
programming to solve it.
[a,b] is user input. weights should be inside the interval. if outside,
it will be a violation and we would like to minimize it.
-- Forwarded message --IIT Kanpur, as a part of its technical festival, Techkriti, is organizing
IOPC - The international Online Programing Contest
The contest will be held on 18th February, 2006, and will run for 18 hours. IOPC provides you a platform to compete with the best aroun
thanx for telling me my mistake i have understand where the probelm lies well then i wonder how this problem will be solved also i am not very familiar with Dyanamic programming
-- Richa
Richa,
In your algoritm's second iteration, you can't flip cell 15..beacuse,
cell 14 is not 1 by that time..it has already been flipped back to 0...
The same holds for all your later iterations..
You might have generalized the result from the first iteration..but,
its not so...because, the 1st ite
Dear friends,
I believe there is a separate group focussing on solving all the problems as
given in donald knuths' AOCP. Please let me know if there is any such thing.
regards,
sudarshan
14 matches
Mail list logo
