Does microsoft hire off-campus???..if yes, then what is their
process???..n what type of questions they ask???...what about
google???
actually i've gone through microsoft's collg hiring process.it was
closebut hard luck,anyway..so gonna try after 6 months.
--
You
does anybody know the fastest algo for prime factorization of a
number???
--
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
around 999,999,999
or
the link to above pbm is
http://www.spoj.pl/problems/CZ_PROB2/
On Sep 19, 11:45 pm, Rahul raikra...@gmail.com wrote:
how much big number are You tHINKING
Rahul
On Mon, Sep 19, 2011 at 2:40 PM, Manish Verma jalsa.n.sa...@gmail.com wrote:
does anybody know the fastest
Hey, anyone preparing for acm-icpc
what about discussing acm-icpc questions here
what say @shady??
--
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
Given: An array of integers(may be both positive and negative), we
have to find out the minimum positive sum of array(not necessarily
continuous).
example:- {1,-5,7,10,-14,16,-17,20,21,22}
here answer is -5,-17,22 having sum=0;
--
You received this message because you are subscribed
answer will depend on your compiler.
On Feb 5, 1:02 am, jagannath prasad das jpdasi...@gmail.com wrote:
*#includestdio.h
void main(void)
{
int a=10,b;
b=a++ + ++a;
printf(%d,%d,%d,%d,b,a++,a,++a);
}
*what is the answer?how are the function parameters passed on the stack?
--
You
.
On Sat, Feb 5, 2011 at 7:24 PM, Manish Verma monsieur@gmail.comwrote:
answer will depend on your compiler.
On Feb 5, 1:02 am, jagannath prasad das jpdasi...@gmail.com wrote:
*#includestdio.h
void main(void)
{
int a=10,b;
b=a++ + ++a;
printf(%d,%d,%d,%d,b
