*FUN TEASER
*
*
*
**
*Imagine you are alone in a boat in the middle of a river. Suddenly the boat
starts to sink. You don't know swimming and no one is around to help you.
How do you get out of the situation?
*
*Update Your Answers at* : Click
On Mon, May 9, 2011 at 8:31 PM, Don dondod...@gmail.com wrote:
That would do it if you have a 64-bit type, which most implementations
have, but the standard does not require.
I think that I can make it shorter and cleaner.
int main(int argc, char* argv[])
{
const int n=49;
char
@all geeks ..check out the algo solution with detailed explanation
here
http://shashank7s.blogspot.com/2011/03/wap-to-find-all-possible-palindromes-in.html
let me know if it will fail for any test cases
Thanks Regards
Shashank Mani The Best Way To Escape From The problem is Solve
It
*Urgent need a Business Analyst//Newark, NJ//6-12 Months Contract*
*
*
*Please send updated Resume at peter@gmail.com pe...@gmail.com*
*Job Title:**Business Analyst*
*Duration: 6-12 Months Contract*
*Location: Newark, NJ*
*Rate: $45-50 /hr C2C Max*
*Requires F2F after phone screen*
How can we calculate the number of divisors a number have in minimum time or
having minimum Time Complexity.
--
Harshit Gangal
Fourth Year Undergraduate Student
Dept. of Computer Science
JIIT, Noida , India
--
You received this message because you are subscribed to the Google Groups
Algorithm
*Urgent need a QA Test Lead..*
*
*
*Please send updated Resume at **peter@gmail.com pe...@gmail.com*
*
*
*Start: 5/16 or 5/23*
*Duration: 7+ Months Contract*
*Location: Newark Delaware*
*Rate: Open*
*Job Role Skill set:* QA Test Lead for Bank Conversion**
*Manual Testing Lead
I was on a river boat in Europe, and the emergency drill was to go to
the upper deck and wait, high and dry, for the boat to sink into the
muddy river bottom.
Dave
On May 11, 2:09 am, Lavesh Rawat lavesh.ra...@gmail.com wrote:
*FUN TEASER
*
*
*
**
*Imagine you are alone in a boat in the
*Urgent need a Systems Engineer *
*
*
*Please send updated Resume at **peter@gmail.com pe...@gmail.com*
*
*
*Duration: 2 Months Contract*
*Location: McGaw Park, IL*
*Rate: DOE*
*
*
*Required skills:*
Build, Maintenance and support of Windows servers. HP hardware maintenance
I don't know that it takes exactly 9 operations. I ran the program on
my 3 GHz computer with n=4. It took 17 seconds. 17*3 billion / 2^32 is
11.87 clock cycles per iteration through the loop. A clock cycle is
not the same as an operation, because many machine operations take
more than one clock
*Urgent need a SAP.SCM.WMS..*
*
*
*Please send updated Resume at **peter@gmail.com pe...@gmail.com*
* *
*Start date:** 05/15/2011*
*Duration: 12 Months Contract*
*Location: Melville, NY*
*Rate: DOE*
* *
*Job role skill set: Package Solution Consultant - SAP.SCM.WMS*
*Service
*Urgent need a SAP.FIN.CO*
*
*
*Please send updated Resume at **peter@gmail.com pe...@gmail.com*
* *
*Start date:** *ASAP
*Duration: 12 Months Contract*
*Location: Melville, NY*
*Rate: DOE*
*
*
*Job Title: *CO Consultant (Landed)* *
*Job role skill set: Package Solution
i will stop imaging.
On Wed, May 11, 2011 at 7:38 PM, Dave dave_and_da...@juno.com wrote:
I was on a river boat in Europe, and the emergency drill was to go to
the upper deck and wait, high and dry, for the boat to sink into the
muddy river bottom.
Dave
On May 11, 2:09 am, Lavesh Rawat
*II.P1. Design Implementation of Distributed Computing Algorithms for
Integer Factoring Discrete Log.*
* *
*II.P2. Design of Algorithms for Secure Cloud Computing Data Processing.*
* *
*II.P3 Design Analysis of Post-Quantum Cryptographic Schemes.*
* *
*II.P4. Secure Collaborative Cloud
*Urgent need a SAP.SCM.WMS..*
*Please send updated Resume at pe...@dwlabs.com*
* *
*Start date:** 05/15/2011*
*Duration: 12 Months Contract*
*Location: Melville, NY*
*Rate: DOE*
* *
*Job role skill set:* Package Solution Consultant - SAP.SCM.WMS
* *
*Service area:* SAP-Forecast to
For small numbers, trial division would work. Be sure to only divide
by prime numbers. When you find one which divides your target,
increment your counter and divide the target by that number as many
times as it works. Then go on to the next prime. When the prime
squared is larger than the target,
*Urgent need a SAP Technical Lead//Dublin, OH//3-6 Months Contract*
*Please send updated Resume at pe...@dwlabs.com*
* *
*Duration: 3-6 Months Contract*
*Location: Dublin, OH*
*Rate: DOE*
* *
*Job role :* *SAP Technical Lead*
*
*
*Required skills:*
EWM project starting with some design
*Urgent need a Business Analyst//Newark, NJ//6-12 Months Contract*
*
*
*Please send updated Resume at **pe...@dwlabs.com*
*Job Title:**Business Analyst*
*Duration: 6-12 Months Contract*
*Location: Newark, NJ*
*Rate: $45-50 /hr C2C Max*
*Requires F2F after phone screen*
*Job Discription:*
isnt this a DP problem ?
I think its there in CLRS.
Let me know.
Cheers
Supraja J
On Wed, May 11, 2011 at 7:55 AM, Harshit Gangal harshit.gan...@gmail.comwrote:
How can we calculate the number of divisors a number have in minimum time
or having minimum Time Complexity.
--
Harshit Gangal
Dear Colleagues:
Please share the announcement below with those who might be interested.
Thank you very much.
Best regards, Organizing Committee
CALL FOR PAPERS - Deadline: May 23, 2011
mail tome plz
vamsiachy...@gmail.com
On 8 May 2011 22:00, UTKARSH SRIVASTAV usrivastav...@gmail.com wrote:
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
@Dave: Can there be an in-place O(n) solution to this???
On Mon, May 9, 2011 at 7:01 PM, Dave dave_and_da...@juno.com wrote:
@Ashish: By compress, I meant to transfer the active entries in the
hash table into contiguous elements of an array. Since the hash table
itself is probably stored in
@Anurag What do you mean by sum of smallest...please explain.In
2
5 5
and
3
3 5 6
On Mon, May 9, 2011 at 12:10 AM, kumar anurag anurag.it.jo...@gmail.comwrote:
find xor of all elements - if its equal to zeo then Case has solution
otherwise NO
for finding the soltuion just sort all the
sorry, i mean smallest( not sum of smallest, as smallest means a single
element)
2
5 5
101-5
101-5
--
000 - xor
=0 hence has a solution
so ans=(total sum -smallest)
total sum=5+5=10
smallest=5 - as minimun(5,5)=5
so ans=(10-5)=5
2nd ex
3 5 6
011-3
101-3
---xor
110
110-6
--xor
@Apoorve: I don't believe that you can determine the frequency counts
in-place in O(n).
Dave
On May 9, 8:42 am, Apoorve Mohan apoorvemo...@gmail.com wrote:
@Dave: Can there be an in-place O(n) solution to this???
On Mon, May 9, 2011 at 7:01 PM, Dave dave_and_da...@juno.com wrote:
Can some one help in finding out the bug in the below code.
Input: (left,right,weight) representing intervals
Output: maximum weight of non-overlapping intervals
#include iostream
#include vector
#include math.h
#include algorithm
struct point
{
int value;
bool isLeft;
@pacific you are perfectly right but the order is not o(kn) its is
O(k*n*log(n)) because to get the least number u have to use priority queue
nd at every iteration (from 1 to k*n) u have to push and pop one single
element.
--
Anshuman Mishra
IIIT Allahabad
-
26 matches
Mail list logo
