Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: The 10**21 Problem (Part 3)

by oiskuu (Hermit)
on May 16, 2014 at 12:35 UTC ( [id://1086299]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    > perl -e 'print join q( ), map 1000003*(1<<$_) % 1001 % 4, (0..7)'
    0 0 0 0 0 0 0 0
    
  2. or download this
    // C D M values are all 0 (modulo 4).
    int step_cdm[1001] = { 0,0,0,0, 0,1,1,1, 0,2,2,2, 0,3, ... , 0,2,2,2, 
    +0,1,1,1, 0,0,0,0, 0 };
    ...
    if (step && step_ok(d7)) { q8 += step - 1; continue; }   // loop q8
    if (d != 500) continue;
    ...
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1086299]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others surveying the Monastery: (4)
As of 2024-04-19 04:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found