... I should have posted the version with 2 levels (with 39 leaves) instead of 1 level. The 1 level version run fine indeed, even with Intel 8. Only the 2 levels version show the problem : [...]...and allocatable give: [ 1 ] 1 [ 2 ] 2 [ 3 ] 3 [ 4 ] 4 [ 5 ] 5 ........... [...

...tree, for which each node has 3 leaves. Several versions of the code ... of recursive calls (I tried 1 and 2 levels), - use allocatable or pointer ... and got [ 1 ] 1 [ 2 ] 2 [ 3 ] 3 [ 4 ] 4 [ 5 ] 5 [ ... ] 12 in both cases with Intel 10.1. HTH Mike Metcalf

...( t_dt ) :: stufflist_sublevel integer , parameter :: maxchild = 3 integer :: myindex integer :: current_size integer ... size ( stufflist %% array ) do myindex = 1 , arraysize write(12,*) "[", myindex , "]" , stufflist ....exe [ 1 ] 1 [ 2 ] 2 [ 3 ] 3 [ 4 ] 4 [ 5 ] 5...

...accept different type of lists as input for example: a list of int [1,2,3] or string ["1","2","3"] where each input list...get back ["*","*","^","^"] If it's of any use, in Haskell I'd do: Prelude> concatMap (replicate 2) [1..5] [1,1,2,2,3,3,4,4,5,5] Prelude> concatMap (replicate 2) "hello world" "hheelllloo wwoorrlldd" A simple version of dual would be, dual [] = ...

...::MakeMaker 6.30 ExtUtils::Manifest 1.46 ExtUtils::ParseXS n/a File::Spec 3.12 Module::Build 0.2806 ...::Signature n/a Test::Harness 2.56 Test::More 0.67...ok 1 ok 2 ok 3 ok 4 ok 5 ok ...longdblsize=12 ivtype='long', ivsize=4, nvtype='double', nvsize=8, Off_t...usr/lib/libc.so.30.3, so=so, useshrplib=false, libperl...

...the math: (1/2) * (2/3) * (3/4) * (4/5) * (5/6) ... ((double) rand () / ((double) (RAND_MAX) + (double) (1))); x = (r * M); y = (int) ...bean from Beans2 beans2--; } if (z == 2) { // Tails loses beans1--; // Beans2 gains one... and reset //games. if(live==1){ printf ("Lost at: %%d beans ...

...the math: (1/2) * (2/3) * (3/4) * (4/5) * (5/6) ... ((double) rand () / ((double) (RAND_MAX) + (double) (1))); x = (r * M); y = (int) ...bean from Beans2 beans2--; } if (z == 2) { // Tails loses beans1--; // Beans2 gains one... and reset //games. if(live==1){ printf ("Lost at: %%d beans ...

...following games. For example, if 3 pennies are used to play...math: (1/2) * (2/3) * (3/4) * (4/5) * (5/6...seed = 10000; . srand (seed); . M = 2; . . . int score = 0; . . //Score keeps...from Beans2 . . beans2--; . } . if (z == 2) . { . // Tails loses . . beans1--; . . // Beans2 gains...

... a concrete advantage to beginning with 3 pennies, instead of beginning with one.... the math: (1/2) * (2/3) * (3/4) * (4/5) * (5/6) *...000 rounds int count=0; beans1 = 3 + score; // Beans gets defined here, ... (double)rand() / ((double)(RAND_MAX)+(double)(1)) ); x = (r * M); y = (int) ...from Beans2 beans2=beans2--; } if(z==2){ // Tails loses beans1=beans1--; // Beans2 gains...

... chaos. Example: One player has 3 pennies, and another player has ...a concrete advantage to beginning with 3 pennies, instead of beginning with ... math: (1/2) * (2/3) * (3/4) * (4/5) * (5/6)... higher if you begin with 3. This experiment is empirically verifiable,... to land: sqrt(avg flips) = 1.428571429 = number of seconds to ...