aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMohammad S Anwar <mohammad.anwar@yahoo.com>2022-10-31 03:34:15 +0000
committerMohammad S Anwar <mohammad.anwar@yahoo.com>2022-10-31 03:34:15 +0000
commitae37f193ee84fbb850432297a3b5a005fb1a717a (patch)
tree43a7e47ea31e994acdbbcd9c2a3905a57eeaba24
parent47c3e2f07b76014586882ac468f1ab1c04af7434 (diff)
downloadperlweeklychallenge-club-ae37f193ee84fbb850432297a3b5a005fb1a717a.tar.gz
perlweeklychallenge-club-ae37f193ee84fbb850432297a3b5a005fb1a717a.tar.bz2
perlweeklychallenge-club-ae37f193ee84fbb850432297a3b5a005fb1a717a.zip
- Added solutions by Colin Crain.
Diffstat
-rwxr-xr-xchallenge-187/colin-crain/perl/ch-2.pl116
-rwxr-xr-xchallenge-188/colin-crain/perl/ch-1.pl86
-rwxr-xr-xchallenge-188/colin-crain/perl/ch-2.pl109
-rw-r--r--stats/pwc-challenge-187.json272
-rw-r--r--stats/pwc-current.json349
-rw-r--r--stats/pwc-language-breakdown-summary.json50
-rw-r--r--stats/pwc-language-breakdown.json1270
-rw-r--r--stats/pwc-leaders.json724
-rw-r--r--stats/pwc-summary-1-30.json126
-rw-r--r--stats/pwc-summary-121-150.json42
-rw-r--r--stats/pwc-summary-151-180.json92
-rw-r--r--stats/pwc-summary-181-210.json108
-rw-r--r--stats/pwc-summary-211-240.json44
-rw-r--r--stats/pwc-summary-241-270.json44
-rw-r--r--stats/pwc-summary-271-300.json48
-rw-r--r--stats/pwc-summary-31-60.json38
-rw-r--r--stats/pwc-summary-61-90.json90
-rw-r--r--stats/pwc-summary-91-120.json122
-rw-r--r--stats/pwc-summary.json38
19 files changed, 2047 insertions, 1721 deletions
diff --git a/challenge-187/colin-crain/perl/ch-2.pl b/challenge-187/colin-crain/perl/ch-2.pl
new file mode 100755
index 0000000000..24f72ff7a2
--- /dev/null
+++ b/challenge-187/colin-crain/perl/ch-2.pl
@@ -0,0 +1,116 @@
+#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# magick-powers.pl
+#
+# Magical Triplets
+# Submitted by: Mohammad S Anwar
+#
+# You are given a list of positive numbers, @n, having at least 3
+# numbers.
+#
+# Write a script to find the triplets (a, b, c) from the given list
+# that satisfies the following rules.
+#
+# 1. a + b > c
+# 2. b + c > a
+# 3. a + c > b
+# 4. a + b + c is maximum.
+
+# In case you end up with more than one triplets having the
+# maximum, then pick the triplet where a >= b >= c.
+#
+# Example 1
+# Input: @n = (1, 2, 3, 2);
+# Output: (3, 2, 2)
+#
+# Example 2
+# Input: @n = (1, 3, 2);
+# Output: ()
+#
+# Example 3
+# Input: @n = (1, 1, 2, 3);
+# Output: ()
+#
+# Example 4
+# Input: @n = (2, 4, 3);
+# Output: (4, 3, 2)
+#
+#
+# method:
+# Hard to understand the problem here, but we seem to want
+# triples of elements from the input list, selected unordered
+# but distinctly. As this will yield six possible variations in
+# ordering for any final pick, there will always be multiple
+# maximums to chose from if we investigate all groupings. So
+# because of this we will sort the triples as we add them to
+# the list of final candidates.
+#
+# This list is again sorted for the maimum sum, with secondary
+# sorting on first the value of a, then b, then c. This is not
+# exactly specified but seems to fit the bill. Without studing
+# the triples first it's difficult to conceptualise a
+# counterexample. It seems the simple a >= b >= c ordering is
+# potentially insufficient on its own to isolate a single
+# candidate so I've decided on this plan as always delivering a
+# single, unique ordered triple. Because logic and math.
+#
+#
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+use Algorithm::Combinatorics qw( variations );
+
+
+sub get_triplet ( $arr ) {
+ my @trips;
+
+ my $iter = variations( $arr, 3); ## array value 3-permutations (aka variations)
+ while ( my $v = $iter->next ) {
+ next unless $v->[0] >= $v->[1] >= $v->[2];
+ push @trips, $v if is_triplet( $v->@* );
+ }
+
+ ## pretty sure this is what's requested:
+ ## -> largest total sum
+ ## -> larger a
+ ## -> larger b
+ ## -> larger c (logically unnecessary so removed)
+
+ @trips = sort { $a->[0] + $a->[1] + $a->[2] <=> $b->[0] + $b->[1] + $b->[2]
+ || $a->[0] <=> $b->[0]
+ || $a->[1] <=> $b->[0] } @trips;
+
+ return pop @trips;
+
+}
+
+
+sub is_triplet ( $a, $b, $c ) {
+ ($a + $b > $c) and ($b + $c > $a) and ($a + $b > $c) ? 1 : 0;
+}
+
+
+# my $out = get_triplet([1, 1, 2, 3]);
+my $out;
+
+my @tests = ( [1, 2, 3, 2], [1, 3, 2], [1, 1, 2, 3], [2, 4, 3] );
+
+for ( @tests ) {
+ local $" = ', ';
+ say "input: ($_->@*)";
+ defined ($out = get_triplet( $_ ))
+ ? say "output: ($out->@*)"
+ : say "output: ()" ;
+ say '';
+}
+
+
diff --git a/challenge-188/colin-crain/perl/ch-1.pl b/challenge-188/colin-crain/perl/ch-1.pl
new file mode 100755
index 0000000000..0dadc98d02
--- /dev/null
+++ b/challenge-188/colin-crain/perl/ch-1.pl
@@ -0,0 +1,86 @@
+#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# divisibility_index.pl
+#
+# Divisible Pairs
+# Submitted by: Mohammad S Anwar
+# You are given list of integers @list of size $n and divisor $k.
+#
+# Write a script to find out count of pairs in the given list that
+# satisfies the following rules.
+#
+# The pair (i, j) is eligible if and only if
+# a) 0 <= i < j < len(list)
+# b) list[i] + list[j] is divisible by k
+#
+# Example 1
+# Input: @list = (4, 5, 1, 6), $k = 2
+# Output: 2
+#
+# Example 2
+# Input: @list = (1, 2, 3, 4), $k = 2
+# Output: 2
+#
+# Example 3
+# Input: @list = (1, 3, 4, 5), $k = 3
+# Output: 2
+#
+# Example 4
+# Input: @list = (5, 1, 2, 3), $k = 4
+# Output: 2
+#
+# Example 5
+# Input: @list = (7, 2, 4, 5), $k = 4
+# Output: 1
+#
+#
+# method:
+#
+# What is it we are asking for here, anyways? Perhaps despite the initial
+# impressions what we are being asked for pairs of *indices*, the
+# second ordered after the first, that satisfy the condition
+# that the sum of the elements indexed is evenly dividible by
+# the value *k*.
+#
+# we will need to iterate across each index for the first
+# element and then all following indices for the second,
+# repeating until we arrive at the second-to-last and last
+# indices. A modulo function will then test for divisibility.
+#
+#
+#
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+
+sub count_index_pairs( $arr, $div, $count = 0) {
+ for my $i ( 0..$arr->$#* - 1) {
+ for my $j ( $i+1..$arr->$#* ) {
+ $count++ if ($arr->[$i] + $arr->[$j]) % $div == 0;
+ }
+ }
+ return $count;
+}
+
+
+
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+use Test::More;
+
+is count_index_pairs( [4, 5, 1, 6], 2 ), 2, 'ex-1';
+is count_index_pairs( [1, 2, 3, 4], 2 ), 2, 'ex-2';
+is count_index_pairs( [1, 3, 4, 5], 3 ), 2, 'ex-3';
+is count_index_pairs( [5, 1, 2, 3], 4 ), 2, 'ex-4';
+is count_index_pairs( [7, 2, 4, 5], 4 ), 1, 'ex-5';
+
+done_testing();
diff --git a/challenge-188/colin-crain/perl/ch-2.pl b/challenge-188/colin-crain/perl/ch-2.pl
new file mode 100755
index 0000000000..b22c2d3b5f
--- /dev/null
+++ b/challenge-188/colin-crain/perl/ch-2.pl
@@ -0,0 +1,109 @@
+#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# noise-is-for-heros-musics-for-zeros.pl
+#
+# Total Zero
+# Submitted by: Mohammad S Anwar
+# You are given two positive integers $x and $y.
+#
+# Write a script to find out the number of operations needed to
+# make both ZERO. Each operation is made up either of the
+# followings:
+#
+# $x = $x - $y if $x >= $y
+#
+# or
+#
+# $y = $y - $x if $y >= $x (using the original value of $x)
+
+# Example 1
+# Input: $x = 5, $y = 4
+# Output: 5
+
+# Example 2
+# Input: $x = 4, $y = 6
+# Output: 3
+
+# Example 3
+# Input: $x = 2, $y = 5
+# Output: 4
+
+# Example 4
+# Input: $x = 3, $y = 1
+# Output: 3
+
+# Example 5
+# Input: $x = 7, $y = 4
+# Output: 5
+
+# analysis:
+#
+# As is often the case decoding the description is part of the
+# challenge. In example 4, with x = 3 and y = 1, the first op
+# is to subtract y from x, producing a new value of 2 for x.
+# THis is repeated on the next cycle, yielding a count of 2 and
+# a new x of 1. In the third cycle x is equal to y and so we
+# have x = x - y a third time, but also y is equal to the value
+# of x going in, so y = y - x and both are set to 0.
+# Tprogression concludes in three cycles, but was that three or
+# four operations? Fo you feel lucky, punk?
+#
+# I think the correct phrasing to produce the example output is
+# not: "Each operation is made up either of the followings...",
+# but rather: "Each operation is made up ONE OR BOTH of the
+# following manipulations..."
+#
+# In this way should the two values be equal, each can be
+# subtracted from the other, zeroing the output in a single
+# operation.
+
+# Always counting the two actions completely separately
+# produces a cyclic non-resolving pattern as once either value
+# goes to zero subtracting this from the other value no longer
+# changes the result. So that will never work.
+#
+# Maintaining the idea of the previous x across cycles is
+# problematic but not impossible: we save out x if x changes,
+# but always use the saved value to compare y. This however
+# does not give the values from the examples, counting an extra
+# step to reduce the other value to zero and equilibrium.
+#
+# This was my reasoning to get the examples to work right. I
+# can't wait to see what the others have done.
+#
+
+#
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+
+
+sub count_to_zero ( $x, $y, $count = 0 ) {
+ while ( ($x != 0 and $y != 0) and ++$count ) {
+ my $prev_x = $x;
+ $x >= $y and $x -= $y;
+ $y >= $prev_x and $y -= $prev_x;
+ }
+ return $count;
+}
+
+
+
+use Test::More;
+
+is count_to_zero( 5, 4), 5, 'ex-1';
+is count_to_zero( 4, 6), 3, 'ex-2';
+is count_to_zero( 2, 5), 4, 'ex-3';
+is count_to_zero( 3, 1), 3, 'ex-4';
+is count_to_zero( 7, 4), 5, 'ex-5';
+
+done_testing();
diff --git a/stats/pwc-challenge-187.json b/stats/pwc-challenge-187.json
index dc94111c4f..496b1e22e5 100644
--- a/stats/pwc-challenge-187.json
+++ b/stats/pwc-challenge-187.json
@@ -1,31 +1,24 @@
{
- "title" : {
- "text" : "The Weekly Challenge - 187"
+ "yAxis" : {
+ "title" : {
+ "text" : "Total Solutions"
+ }
+ },
+ "chart" : {
+ "type" : "column"
},
"subtitle" : {
- "text" : "[Champions: 36] Last updated at 2022-10-27 08:54:48 GMT"
+ "text" : "[Champions: 36] Last updated at 2022-10-31 03:29:49 GMT"
},
- "tooltip" : {
- "followPointer" : 1,
- "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>",
- "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>"
+ "legend" : {
+ "enabled" : 0
},
"xAxis" : {
"type" : "category"
},
- "plotOptions" : {
- "series" : {
- "dataLabels" : {
- "format" : "{point.y}",
- "enabled" : 1
- },
- "borderWidth" : 0
- }
- },
"drilldown" : {
"series" : [
{
- "id" : "Adam Russell",
"name" : "Adam Russell",
"data" : [
[
@@ -36,7 +29,8 @@
"Blog",
2
]
- ]
+ ],
+ "id" : "Adam Russell"
},
{
"id" : "Andinus",
@@ -54,6 +48,7 @@
},
{
"id" : "Arne Sommer",
+ "name" : "Arne Sommer",
"data" : [
[
"Raku",
@@ -63,11 +58,9 @@
"Blog",
1
]
- ],
- "name" : "Arne Sommer"
+ ]
},
{
- "id" : "Athanasius",
"data" : [
[
"Perl",
@@ -78,17 +71,18 @@
2
]
],
- "name" : "Athanasius"
+ "name" : "Athanasius",
+ "id" : "Athanasius"
},
{
- "id" : "Bruce Gray",
"data" : [
[
"Raku",
2
]
],
- "name" : "Bruce Gray"
+ "name" : "Bruce Gray",
+ "id" : "Bruce Gray"
},
{
"id" : "Cheok-Yin Fung",
@@ -101,14 +95,14 @@
]
},
{
- "id" : "Colin Crain",
"data" : [
[
"Perl",
- 1
+ 2
]
],
- "name" : "Colin Crain"
+ "name" : "Colin Crain",
+ "id" : "Colin Crain"
},
{
"name" : "Dave Jacoby",
@@ -122,36 +116,36 @@
},
{
"id" : "Duncan C. White",
+ "name" : "Duncan C. White",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Duncan C. White"
+ ]
},
{
+ "name" : "E. Choroba",
"data" : [
[
"Perl",
2
]
],
- "name" : "E. Choroba",
"id" : "E. Choroba"
},
{
"id" : "Feng Chang",
+ "name" : "Feng Chang",
"data" : [
[
"Raku",
2
]
- ],
- "name" : "Feng Chang"
+ ]
},
{
- "name" : "Flavio Poletti",
+ "id" : "Flavio Poletti",
"data" : [
[
"Perl",
@@ -166,7 +160,7 @@
2
]
],
- "id" : "Flavio Poletti"
+ "name" : "Flavio Poletti"
},
{
"data" : [
@@ -179,18 +173,16 @@
"id" : "Humberto Massa"
},
{
- "id" : "izem",
+ "name" : "izem",
"data" : [
[
"Perl",
2
]
],
- "name" : "izem"
+ "id" : "izem"
},
{
- "id" : "Jaldhar H. Vyas",
- "name" : "Jaldhar H. Vyas",
"data" : [
[
"Perl",
@@ -204,10 +196,13 @@
"Blog",
1
]
- ]
+ ],
+ "name" : "Jaldhar H. Vyas",
+ "id" : "Jaldhar H. Vyas"
},
{
"id" : "James Smith",
+ "name" : "James Smith",
"data" : [
[
"Perl",
@@ -217,18 +212,17 @@
"Blog",
1
]
- ],
- "name" : "James Smith"
+ ]
},
{
"id" : "Jan Krnavek",
- "name" : "Jan Krnavek",
"data" : [
[
"Raku",
1
]
- ]
+ ],
+ "name" : "Jan Krnavek"
},
{
"name" : "Jorg Sommrey",
@@ -241,6 +235,7 @@
"id" : "Jorg Sommrey"
},
{
+ "id" : "Laurent Rosenfeld",
"data" : [
[
"Perl",
@@ -255,11 +250,10 @@
1
]
],
- "name" : "Laurent Rosenfeld",
- "id" : "Laurent Rosenfeld"
+ "name" : "Laurent Rosenfeld"
},
{
- "name" : "Luca Ferrari",
+ "id" : "Luca Ferrari",
"data" : [
[
"Raku",
@@ -270,30 +264,30 @@
6
]
],
- "id" : "Luca Ferrari"
+ "name" : "Luca Ferrari"
},
{
- "name" : "Mark Anderson",
"data" : [
[
"Raku",
2
]
],
+ "name" : "Mark Anderson",
"id" : "Mark Anderson"
},
{
- "id" : "Matthew Neleigh",
"data" : [
[
"Perl",
2
]
],
- "name" : "Matthew Neleigh"
+ "name" : "Matthew Neleigh",
+ "id" : "Matthew Neleigh"
},
{
- "id" : "Mohammad S Anwar",
+ "name" : "Mohammad S Anwar",
"data" : [
[
"Perl",
@@ -304,29 +298,30 @@
2
]
],
- "name" : "Mohammad S Anwar"
+ "id" : "Mohammad S Anwar"
},
{
+ "id" : "Niels van Dijke",
+ "name" : "Niels van Dijke",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Niels van Dijke",
- "id" : "Niels van Dijke"
+ ]
},
{
- "id" : "Paul Fajman",
- "name" : "Paul Fajman",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "Paul Fajman",
+ "id" : "Paul Fajman"
},
{
+ "id" : "Peter Campbell Smith",
"name" : "Peter Campbell Smith",
"data" : [
[
@@ -337,21 +332,19 @@
"Blog",
1
]
- ],
- "id" : "Peter Campbell Smith"
+ ]
},
{
+ "id" : "Robbie Hatley",
"name" : "Robbie Hatley",
"data" : [
[
"Perl",
1
]
- ],
- "id" : "Robbie Hatley"
+ ]
},
{
- "name" : "Robert DiCicco",
"data" : [
[
"Perl",
@@ -362,17 +355,18 @@
2
]
],
+ "name" : "Robert DiCicco",
"id" : "Robert DiCicco"
},
{
+ "id" : "Robert Ransbottom",
"data" : [
[
"Raku",
2
]
],
- "name" : "Robert Ransbottom",
- "id" : "Robert Ransbottom"
+ "name" : "Robert Ransbottom"
},
{
"id" : "Roger Bell_West",
@@ -417,7 +411,6 @@
]
},
{
- "id" : "Stephen G. Lynn",
"name" : "Stephen G. Lynn",
"data" : [
[
@@ -432,20 +425,22 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Stephen G. Lynn"
},
{
+ "id" : "Tim Potapov",
"name" : "Tim Potapov",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Tim Potapov"
+ ]
},
{
"id" : "Ulrich Rieke",
+ "name" : "Ulrich Rieke",
"data" : [
[
"Perl",
@@ -455,12 +450,9 @@
"Raku",
2
]
- ],
- "name" : "Ulrich Rieke"
+ ]
},
{
- "id" : "W. Luis Mochan",
- "name" : "W. Luis Mochan",
"data" : [
[
"Perl",
@@ -470,10 +462,29 @@
"Blog",
1
]
- ]
+ ],
+ "name" : "W. Luis Mochan",
+ "id" : "W. Luis Mochan"
}
]
},
+ "tooltip" : {
+ "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>",
+ "followPointer" : 1,
+ "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>"
+ },
+ "plotOptions" : {
+ "series" : {
+ "dataLabels" : {
+ "enabled" : 1,
+ "format" : "{point.y}"
+ },
+ "borderWidth" : 0
+ }
+ },
+ "title" : {
+ "text" : "The Weekly Challenge - 187"
+ },
"series" : [
{
"colorByPoint" : 1,
@@ -490,54 +501,54 @@
"name" : "Andinus"
},
{
- "y" : 3,
"drilldown" : "Arne Sommer",
+ "y" : 3,
"name" : "Arne Sommer"
},
{
"drilldown" : "Athanasius",
- "y" : 4,
- "name" : "Athanasius"
+ "name" : "Athanasius",
+ "y" : 4
},
{
- "name" : "Bruce Gray",
+ "drilldown" : "Bruce Gray",
"y" : 2,
- "drilldown" : "Bruce Gray"
+ "name" : "Bruce Gray"
},
{
- "name" : "Cheok-Yin Fung",
"drilldown" : "Cheok-Yin Fung",
- "y" : 1
+ "y" : 1,
+ "name" : "Cheok-Yin Fung"
},
{
- "y" : 1,
- "drilldown" : "Colin Crain",
- "name" : "Colin Crain"
+ "y" : 2,
+ "name" : "Colin Crain",
+ "drilldown" : "Colin Crain"
},
{
- "drilldown" : "Dave Jacoby",
+ "name" : "Dave Jacoby",
"y" : 2,
- "name" : "Dave Jacoby"
+ "drilldown" : "Dave Jacoby"
},
{
"name" : "Duncan C. White",
- "drilldown" : "Duncan C. White",
- "y" : 2
+ "y" : 2,
+ "drilldown" : "Duncan C. White"
},
{
- "name" : "E. Choroba",
"drilldown" : "E. Choroba",
+ "name" : "E. Choroba",
"y" : 2
},
{
- "name" : "Feng Chang",
"y" : 2,
+ "name" : "Feng Chang",
"drilldown" : "Feng Chang"
},
{
- "drilldown" : "Flavio Poletti",
+ "name" : "Flavio Poletti",
"y" : 6,
- "name" : "Flavio Poletti"
+ "drilldown" : "Flavio Poletti"
},
{
"name" : "Humberto Massa",
@@ -545,29 +556,29 @@
"drilldown" : "Humberto Massa"
},
{
- "drilldown" : "izem",
"y" : 2,
- "name" : "izem"
+ "name" : "izem",
+ "drilldown" : "izem"
},
{
- "name" : "Jaldhar H. Vyas",
"y" : 5,
+ "name" : "Jaldhar H. Vyas",
"drilldown" : "Jaldhar H. Vyas"
},
{
- "drilldown" : "James Smith",
"y" : 3,
- "name" : "James Smith"
+ "name" : "James Smith",
+ "drilldown" : "James Smith"
},
{
"y" : 1,
- "drilldown" : "Jan Krnavek",
- "name" : "Jan Krnavek"
+ "name" : "Jan Krnavek",
+ "drilldown" : "Jan Krnavek"
},
{
- "name" : "Jorg Sommrey",
+ "drilldown" : "Jorg Sommrey",
"y" : 2,
- "drilldown" : "Jorg Sommrey"
+ "name" : "Jorg Sommrey"
},
{
"drilldown" : "Laurent Rosenfeld",
@@ -575,59 +586,59 @@
"name" : "Laurent Rosenfeld"
},
{
- "y" : 8,
"drilldown" : "Luca Ferrari",
+ "y" : 8,
"name" : "Luca Ferrari"
},
{
- "y" : 2,
"drilldown" : "Mark Anderson",
+ "y" : 2,
"name" : "Mark Anderson"
},
{
"drilldown" : "Matthew Neleigh",
- "y" : 2,
- "name" : "Matthew Neleigh"
+ "name" : "Matthew Neleigh",
+ "y" : 2
},
{
- "drilldown" : "Mohammad S Anwar",
"y" : 4,
- "name" : "Mohammad S Anwar"
+ "name" : "Mohammad S Anwar",
+ "drilldown" : "Mohammad S Anwar"
},
{
- "name" : "Niels van Dijke",
"drilldown" : "Niels van Dijke",
- "y" : 2
+ "y" : 2,
+ "name" : "Niels van Dijke"
},
{
- "drilldown" : "Paul Fajman",
"y" : 2,
- "name" : "Paul Fajman"
+ "name" : "Paul Fajman",
+ "drilldown" : "Paul Fajman"
},
{
- "name" : "Peter Campbell Smith",
"drilldown" : "Peter Campbell Smith",
- "y" : 3
+ "y" : 3,
+ "name" : "Peter Campbell Smith"
},
{
- "y" : 1,
"drilldown" : "Robbie Hatley",
+ "y" : 1,
"name" : "Robbie Hatley"
},
{
- "name" : "Robert DiCicco",
"y" : 4,
+ "name" : "Robert DiCicco",
"drilldown" : "Robert DiCicco"
},
{
- "name" : "Robert Ransbottom",
+ "drilldown" : "Robert Ransbottom",
"y" : 2,
- "drilldown" : "Robert Ransbottom"
+ "name" : "Robert Ransbottom"
},
{
- "name" : "Roger Bell_West",
+ "drilldown" : "Roger Bell_West",
"y" : 5,
- "drilldown" : "Roger Bell_West"
+ "name" : "Roger Bell_West"
},
{
"name" : "Simon Green",
@@ -635,23 +646,23 @@
"drilldown" : "Simon Green"
},
{
- "y" : 2,
"drilldown" : "Solathian",
+ "y" : 2,
"name" : "Solathian"
},
{
- "drilldown" : "Stephen G. Lynn",
+ "name" : "Stephen G. Lynn",
"y" : 5,
- "name" : "Stephen G. Lynn"
+ "drilldown" : "Stephen G. Lynn"
},
{
- "y" : 2,
"drilldown" : "Tim Potapov",
+ "y" : 2,
"name" : "Tim Potapov"
},
{
- "name" : "Ulrich Rieke",
"y" : 3,
+ "name" : "Ulri