I think that this code can suffice.
http://www.ideone.com/ESW8Z
#includestdio.h
int solve(int,int);
int main()
{
printf(%d,solve(100,10));
return 0;
}
int solve(int a,int b)
{
int quotient=0,k=0;
if(ab)
return quotient;
while((1k)*b=a)
{
k++;
}
k--;
use sieve.then make a list of primes.
A binary search can work well to find the next greater prime 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
haha yeah okay..that can be done :-)
i had forgotten abt *
--
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
dp will work fine. :-)
O(n^2) algo.
--
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
the simplest solution for longest increasing continuous array length is O(n)
and
the simplest solution for longest increasing continuous subsequence length
is O(n^2).
a solution for spiral is http://www.ideone.com/ygjsq
--
You received this message because you are subscribed to the Google
*longest increasing continuous subsequence length=longest increasing
subsequence length
in my previous mail.
--
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
hey man,could you tell something abt the attire and all.?
we dont need to go in formals,right?
plus,koi interview and all hoga?
--
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
it should.
--
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 more options, visit this
yeah,only some compilers support it.
--
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
you can read up the
http://en.wikipedia.org/wiki/Negative_base#Calculationpart on the wiki
page
http://en.wikipedia.org/wiki/Negative_base
its explained quite effectively.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
10 matches
Mail list logo
