still not getting the correct output
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For
موقع سكس شوب بالخليج
كل من يبحث عن المتعة و الجنس الان اكبر موقع عربي لبيع السلع الجنسية
لكل من يبحث عن المتعة و السعادة
لكل من يبحث عن الاثارة و المصداقية
ليس لكم غير قطار الحب ايطاليا لبيع المنتجات الجنسية
موقع امن و رائع يبيع كل المنتجات المتعلقة بالجنس و الخاصة للشباب و
الازواج ومنها
*Hi,*
*
*
*Based on most comments, The popular puzzle of the last week is*
*http://dailybrainteaser.blogspot.com/2011/05/trick-brain-teaser-2-may.html?http://dailybrainteaser.blogspot.com/2011/05/trick-brain-teaser-2-may.html
lavesh=lavesh
*
*Please subscribe and follow this blog to show your
same here, did anyone find a link to this book yet?
I couldn't find it anywhere. I am willing to buy an electronic copy of
this book if it's out there.
I need it asap. Please let me know.
Thanks a lot.
On Apr 26, 12:25 am, vamsi achyuth vamsiachy...@gmail.com wrote:
mee++; :)
On 25 April 2011
please elaborate
On Wed, May 4, 2011 at 4:20 PM, Sathaiah Dontula don.sat...@gmail.comwrote:
hash on the each page and compare the hash value.
Thanks regards,
Sathaiah Dontula
On Tue, May 3, 2011 at 8:59 PM, bittu shashank7andr...@gmail.com wrote:
suppose You have a billion urls, where
Given an N arrays of size K each.. each of these K elements in the N
arrays are sorted, each of these N*K elements are unique. Choose a
single element from each of the N arrays, from the chosen subset of N
elements. Subtract the minimum and maximum element. Now, this
difference should be least
dere is soln first person mail to first person on list n den the one who
gets to next so since we all need it :P
On Fri, May 6, 2011 at 11:01 AM, vamsi achyuth vamsiachy...@gmail.comwrote:
mail me++;
On 6 May 2011 10:52, naresh kumar naresh.sac...@gmail.com wrote:
Pleas mail to me also...
can u please explain me in descriptive manner
On Sat, May 7, 2011 at 2:31 PM, Amir hossein Shahriari
amir.hossein.shahri...@gmail.com wrote:
@venkatesan : im not sure about that! this problem is different
but we can do it in O(n^2)
the DP1 can be built done in O(n^2) as in abhijith's
calculate MD5 and then see if MD5 for 2 pages is equal.
On Sun, May 8, 2011 at 1:24 PM, sourabh jakhar sourabhjak...@gmail.comwrote:
please elaborate
On Wed, May 4, 2011 at 4:20 PM, Sathaiah Dontula don.sat...@gmail.comwrote:
hash on the each page and compare the hash value.
Thanks
1.Add 0 to the array if the number of elements in the given array is
odd.
2.Count the frequency of each element or we can simply sort it.
3.If the frequency is even for any element then that element can be
distributed among two parts equally(say p1 and p2).
4.For the elements having odd
mail me also usrivastav...@gmail.com
On Sun, May 8, 2011 at 1:08 AM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
dere is soln first person mail to first person on list n den the one who
gets to next so since we all need it :P
On Fri, May 6, 2011 at 11:01 AM, vamsi achyuth
find xor of all elements - if its equal to zeo then Case has solution
otherwise NO
for finding the soltuion just sort all the elements and find the (sum of all
-sum of smallest)..
On Sun, May 8, 2011 at 9:50 PM, Kunal Patil kp101...@gmail.com wrote:
Can anybody tell me How to solve candy
mail me too plzz.. cegprak...@gmail.com
On Sun, May 8, 2011 at 10:00 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
mail me also usrivastav...@gmail.com
On Sun, May 8, 2011 at 1:08 AM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
dere is soln first person mail to first
this is my code
--
#includeiostream
#includevector
#includestring.h
using namespace std;
vectorint tbf(100,0),array(100,0);
//vector 'tbf' denotes tobeflipped
void make(int ptr,int b,int e)
{
if(b==e)
{
array[ptr]=0;
Please mail the book Data Structures and Algorithms in C by Mark
Allen Weiss to the following Id - ankit4...@gmail.com
if anyone has d book
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
On 08/05/2011 23:32, ankit sablok wrote:
Please mail the book Data Structures and Algorithms in C by Mark
Allen Weiss to the following Id - ankit4...@gmail.com
if anyone has d book
Stop being an IDIOT requesting illegal copies of books on a public list.
This is really irritating me now. Due to
@charles: think in his point of view.. everyone's needs are different
On Mon, May 9, 2011 at 4:26 AM, Charles Turner chtu...@gmail.com wrote:
On 08/05/2011 23:32, ankit sablok wrote:
Please mail the book Data Structures and Algorithms in C by Mark
Allen Weiss to the following Id -
Use KnapSack DP. suppose the sum of element = s and number of elements
= n make a 2-dimesnsional array of size n * ((s+1)/2); I think that
much hint is enough.
if we think little bit more we can optimize it also.
--
You received this message because you are subscribed to the Google Groups
kumar anurag anurag.it.jolly@... writes:
find xor of all elements - if its equal to zeo then Case has solution
otherwise NOfor finding the soltuion just sort all the elements and find the
(sum of all -sum of smallest)..
On Sun, May 8, 2011 at 9:50 PM, Kunal Patil kp101090-
@anshu
then shall we use the foll reccurence realation??
1i=n
S=(s+1)/2
f(i,S)= min( f(i-1, S), f(i-1, S- ar[i]) )
On Mon, May 9, 2011 at 10:42 AM, anshu anshumishra6...@gmail.com wrote:
Use KnapSack DP. suppose the sum of element = s and number of elements
= n make a 2-dimesnsional array
20 matches
Mail list logo
