On Sun, Sep 13, 2009 at 2:02 PM, Noufal Ibrahim nou...@gmail.com wrote:
On Sat, Sep 12, 2009 at 8:10 AM, venka...@gmail.com 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
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 nou...@gmail.com wrote:
On Sat, Sep 12, 2009 at 8:10 AM, venka...@gmail.com wrote:
I was looking at some bytecode optimizations last year. Tlee had some
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
anandol...@gmail.comwrote:
2009/9/11 Dhananjay Nene
One more study with slightly different results hyperlinked below inline
On Mon, Sep 14, 2009 at 6:43 PM, Dhananjay Nene dhananjay.n...@gmail.comwrote:
http://www.apparatusproject.org/blog/2009/09/twisted-web-vs-tornado-performance-test/
On Mon, Sep 14, 2009 at 6:27 PM, Anand Balachandran
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
On Mon, Sep 14, 2009 at 6:26 PM, Venkatraman S venka...@gmail.com 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.
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=problemsid=160
You might consider using the Stirling's
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.
___
This should work,
find f(6)**(10 raised to 7)
On Mon, 14 Sep 2009 18:36:57 +0530, Shashwat Anand
anand.shash...@gmail.com 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
@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 ideam...@gmail.com wrote:
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
On Mon, Sep 14, 2009 at 1:55 PM, Gora Mohanty g...@srijan.in wrote:
On Tue, 15 Sep 2009 00:04:01 +0530
bhaskar jain bhaskar.jain2...@gmail.com 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
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
14 matches
Mail list logo
