[algogeeks] Re: How to Improve efficiency of this code? [SPOJ - HS11DIVS]

2011-09-30 Thread shady 
use strings to multiply and other stuff in C++/C
else use some other language

On Oct 1, 12:13 am, ".itoa"  wrote:
> Bump.. Anybody?

-- 
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 group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: How to Improve efficiency of this code? [SPOJ - HS11DIVS]

2011-09-30 Thread .itoa 
Bump.. Anybody?

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/MFYbEg6sUjAJ.
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 group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: How to Improve efficiency of this code? [SPOJ - HS11DIVS]

2011-09-30 Thread .itoa 
nope. It fails for large numbers. number can go upto 10^100. first off , how 
to input such large numbers in c/c++ ? 

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/T2qjkZm9uFkJ.
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 group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: How to Improve efficiency of this code? [SPOJ - HS11DIVS]

2011-09-30 Thread shady 
got AC ?

On Fri, Sep 30, 2011 at 11:23 AM, .itoa  wrote:

> *UPDATED  *the first() function. Instead of using a loop , using m=a%x and
> a = a-m+x to find the first divisible number.
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/Ez0CHSTQqAYJ.
>
> 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 group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
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 group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: How to Improve efficiency of this code? [SPOJ - HS11DIVS]

2011-09-29 Thread .itoa 
*UPDATED  *the first() function. Instead of using a loop , using m=a%x and a 
= a-m+x to find the first divisible number.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/Ez0CHSTQqAYJ.
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 group at 
http://groups.google.com/group/algogeeks?hl=en.