On Sun, Sep 13, 2009 at 2:02 PM, Noufal Ibrahim wrote:
> On Sat, Sep 12, 2009 at 8:10 AM, wrote:
> > I was looking at some bytecode optimizations last year. Tlee had some
> work already done on that front ; he had a branch. (But, I was not able to
> reach him and get to know about the stuff.) I
On Mon, Sep 14, 2009 at 6:20 PM, Anand Balachandran Pillai <
abpil...@gmail.com> wrote:
>
> On Sun, Sep 13, 2009 at 2:02 PM, Noufal Ibrahim wrote:
>
>> On Sat, Sep 12, 2009 at 8:10 AM, wrote:
>> > I was looking at some bytecode optimizations last year. Tlee had some
>> work already done on that
On Fri, Sep 11, 2009 at 10:32 PM, Anand Chitipothu wrote:
> 2009/9/11 Dhananjay Nene :
> > I am curious about the objective .. to the best of my knowledge wsgi is
> > essentially blocking (unless my understanding is incorrect), whereas
> tornado
> > is primarily non-blocking. So would you see any
How do we calculate last 5-digits of 10**12 ignoring trailing zeros. The
code i wrote works good until 10**8 and after that take ages.
The source of problem is Project Euler :
http://projecteuler.net/index.php?section=problems&id=160
The code is pasted here : http://paste.pocoo.org/show/139745/
http://www.apparatusproject.org/blog/2009/09/twisted-web-vs-tornado-performance-test/
On Mon, Sep 14, 2009 at 6:27 PM, Anand Balachandran Pillai <
abpil...@gmail.com> wrote:
>
>
> On Fri, Sep 11, 2009 at 10:32 PM, Anand Chitipothu
> wrote:
>
>> 2009/9/11 Dhananjay Nene :
>> > I am curious about
One more study with slightly different results hyperlinked below inline
On Mon, Sep 14, 2009 at 6:43 PM, Dhananjay Nene wrote:
>
> http://www.apparatusproject.org/blog/2009/09/twisted-web-vs-tornado-performance-test/
>
>
> On Mon, Sep 14, 2009 at 6:27 PM, Anand Balachandran Pillai <
> abpil...@gm
> 16 fac = int(str(fac * i).strip('0')) % 10
This is ugly hack. Can you think of something more mathematical?
Anand
___
BangPypers mailing list
BangPypers@python.org
http://mail.python.org/mailman/listinfo/bangpypers
> print f(1)
>
>
This is a HUGE number. I don't think you are expected to get the answer by
direct calculation. I would guess that you are expected to use mathematical
reasoning to figure out the answer (and not computation)
___
BangPypers ma
On Mon, Sep 14, 2009 at 6:26 PM, Venkatraman S wrote:
[..]
> Thanks for the interest. I will try sometime in Nov/Dec.
> Probably will try to cover Effect Typing (this is something that i stumbled
> on recently and was interesting)
[..]
Excellent! I eagerly look forward to this.
--
~noufal
htt
Shashwat Anand wrote:
How do we calculate last 5-digits of 10**12 ignoring trailing zeros. The
code i wrote works good until 10**8 and after that take ages.
The source of problem is Project Euler :
http://projecteuler.net/index.php?section=problems&id=160
You might consider using the Stirling's
I remember doing something very inaccurate a long time ago for this -
1. find everything in a loop
2.everytime you encounter some zeros, strip them
3.everytime after stripping it exceeds say 7 digits, take out
rightmost 7 digits for accuracy's sake
4. proceed till loop ends
5. print out the
> The key point i think is we do not need factorial but modulus 10**5 without
> trailing zeros. Didn't helped though :( may be a better implementation could
> help
I think the right solution will NOT involve 10**12 computations. Think about it.
___
BangP
This should work,
find f(6)**(10 raised to 7)
On Mon, 14 Sep 2009 18:36:57 +0530, Shashwat Anand
wrote:
How do we calculate last 5-digits of 10**12 ignoring trailing zeros. The
code i wrote works good until 10**8 and after that take ages.
The source of problem is Project Euler :
http://p
@abhishek :
Can you show me the code ?
10**12 is way too much. My code gives output within a minute for 10**8 and
fails. Ofcourse I need to apply some algo here. What do you exactly mean by
taking out rightmost 7 digits ?
On Mon, Sep 14, 2009 at 8:14 PM, Abhishek Mishra wrote:
> I remember doin
The thought which comes to my mind is Modular exponentiation :
for a ** b % r ( if a ** b very large )
I had coded it in C++ but in python the pow() have inbuilt modular-function
made.
so pow(a ,b, r) does the trick
Here for factorial :
F(n) = n * n-1 * n-2 ...* 2 * 1
Just like in earlier case wh
@anand:
There is a way to calculate number of leading zeros in n!
Here i had implemented it :
>>> x = 100 # number whose factorial is to be taken out
>>> s = 0 #initial count of zeros
>>> n = 1
>>> while x / 5**n:
... s += x / 5**n
... n +=1
...
>>> s
24
>>> import math
>>> len(str(math.f
Hello,
I have an external library which uses SWIG to generate bindings for many
languages like python, perl etc. So they have the interface (.i files)
present and also a 'binding' directory and separate dirs for diff
languages. So for 'Python', they have the wrapper functions (.c files) in
the
On Tue, 15 Sep 2009 00:04:01 +0530
bhaskar jain wrote:
[...]
> Problem is that there was a bug and they have changed a few lines
> in one of the C files. So my question is - will just applying the
> patch and installing the library again, will i get a fresh good
> python binding or do i need to re
On Mon, Sep 14, 2009 at 1:55 PM, Gora Mohanty wrote:
> On Tue, 15 Sep 2009 00:04:01 +0530
> bhaskar jain wrote:
> [...]
>> Problem is that there was a bug and they have changed a few lines
>> in one of the C files. So my question is - will just applying the
>> patch and installing the library aga
Thanks for the response.
What i faced was intentionally passing unexpected/nonsense data cause
segmentation fault in one case. Was wondering if this is because of SWIG or
because of the underlying library (which in turn uses glib). But the
underlying library looks ok. Have you faced such issues wh
20 matches
Mail list logo
