aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--challenge-225/robert-dicicco/perl/ch-2.pl76
-rw-r--r--challenge-225/robert-dicicco/raku/ch-2.raku71
-rw-r--r--challenge-225/robert-dicicco/ruby/ch-2.rb68
-rw-r--r--challenge-225/ulrich-rieke/cpp/ch-2.cpp13
-rw-r--r--challenge-225/ulrich-rieke/haskell/ch-2.hs7
-rw-r--r--challenge-225/ulrich-rieke/perl/ch-2.pl24
-rw-r--r--challenge-225/ulrich-rieke/raku/ch-2.raku24
-rw-r--r--challenge-225/ulrich-rieke/rust/ch-2.rs18
-rw-r--r--stats/pwc-challenge-203.json301
-rw-r--r--stats/pwc-challenge-224.json395
-rw-r--r--stats/pwc-current.json154
-rw-r--r--stats/pwc-language-breakdown-summary.json76
-rw-r--r--stats/pwc-language-breakdown.json2954
-rw-r--r--stats/pwc-leaders.json716
-rw-r--r--stats/pwc-summary-1-30.json128
-rw-r--r--stats/pwc-summary-121-150.json118
-rw-r--r--stats/pwc-summary-151-180.json110
-rw-r--r--stats/pwc-summary-181-210.json42
-rw-r--r--stats/pwc-summary-211-240.json54
-rw-r--r--stats/pwc-summary-241-270.json126
-rw-r--r--stats/pwc-summary-271-300.json92
-rw-r--r--stats/pwc-summary-31-60.json36
-rw-r--r--stats/pwc-summary-61-90.json108
-rw-r--r--stats/pwc-summary-91-120.json112
-rw-r--r--stats/pwc-summary.json46
25 files changed, 3094 insertions, 2775 deletions
diff --git a/challenge-225/robert-dicicco/perl/ch-2.pl b/challenge-225/robert-dicicco/perl/ch-2.pl
new file mode 100644
index 0000000000..0ed926b338
--- /dev/null
+++ b/challenge-225/robert-dicicco/perl/ch-2.pl
@@ -0,0 +1,76 @@
+#!/usr/bin/env perl
+=begin comment
+---------------------------------------
+AUTHOR: Robert DiCicco
+DATE : 2023-07-11
+Challenge 225 Task 2 Left Right Sum Diff ( Perl )
+---------------------------------------
+=cut
+use strict;
+use warnings;
+use feature 'say';
+
+my @array = (1, 2, 3, 4, 5);
+my @left = ();
+my @right = ();
+my @left_right_sum_diff = ();
+
+sub ltr {
+ my @array = @_;
+ my $sum = 0;
+
+ push @left, 0;
+ for my $i (0 .. $#array - 1) {
+ $sum += $array[$i];
+ push @left, $sum;
+ }
+}
+
+sub rtl {
+ my @array = @_;
+ my $sum = 0;
+ push @right, 0;
+ for ( my $i = $#array; $i > 0; $i--) {
+ $sum += $array[$i];
+ push @right, $sum;
+ }
+}
+
+say ("Input: \@ints = (@array)");
+ltr(@array);
+
+print("\t\@left = ");
+print join(", ", @left), "\n";
+
+rtl(@array);
+print("\t\@right = ");
+@right = reverse(@right);
+print join(", ", @right), "\n";
+
+for my $i (0 .. $#array) {
+ push @left_right_sum_diff, abs($left[$i] - $right[$i]);
+}
+
+my $str = join(", ", @left_right_sum_diff, "\n");
+substr($str, -3) = '';
+print("\tOutput: \@left_right_sum_diff = $str\n");
+
+=begin comment
+---------------------------------------
+SAMPLE OUTPUT
+perl LRSD.pl
+Input: @ints = (10 4 8 3)
+ @left = 0, 10, 14, 22
+ @right = 15, 11, 3, 0
+ Output: @left_right_sum_diff = 15, 1, 11, 22
+
+perl LRSD.pll
+Input: @ints = (1 2 3 4 5)
+ @left = 0, 1, 3, 6, 10
+ @right = 14, 12, 9, 5, 0
+ Output: @left_right_sum_diff = 14, 11, 6, 1, 10
+---------------------------------------
+=cut
+
+
+
diff --git a/challenge-225/robert-dicicco/raku/ch-2.raku b/challenge-225/robert-dicicco/raku/ch-2.raku
new file mode 100644
index 0000000000..cb7142714e
--- /dev/null
+++ b/challenge-225/robert-dicicco/raku/ch-2.raku
@@ -0,0 +1,71 @@
+#!/usr/bin/env raku
+=begin comment
+---------------------------------------
+AUTHOR: Robert DiCicco
+DATE : 2023-07-11
+Challenge 225 Task 2 Left Right Sum Diff ( Raku )
+---------------------------------------
+=end comment
+
+use v6;
+
+#my @array = (1, 2, 3, 4, 5);
+my @array = (10,4,8,3);
+my @left = ();
+my @right = ();
+my @left_right_sum_diff = ();
+
+sub ltr(@array) {
+ my $sum = 0;
+ @left.push(0);
+ for 0 .. @array.elems - 2 -> $i {
+ $sum += @array[$i];
+ @left.push($sum);
+ }
+}
+
+sub rtl(@array) {
+ my $sum = 0;
+ @right.push(0);
+ my $i = @array.elems - 1;
+ while $i > 0 {
+ $sum += @array[$i];
+ push @right, $sum;
+ $i--;
+ }
+}
+
+say "Input: \@ints = ",@array;
+ltr(@array);
+say "\t\@left = ",@left;
+rtl(@array);
+@right = @right.reverse;
+say "\t\@right = ",@right;
+
+my $i = 0;
+while $i < @array.elems {
+ @left_right_sum_diff.push(abs(@left[$i] - @right[$i]));
+ $i++;
+}
+
+say "\tOutput: @left_right_sum_diff = ",@left_right_sum_diff;
+
+=begin comment
+---------------------------------------
+Sraku LRSD.rk
+SAMPLE OUTPUT
+Input: @ints = [1 2 3 4 5]
+ @left = [0 1 3 6 10]
+ @right = [14 12 9 5 0]
+ Output: @left_right_sum_diff = [14 11 6 1 10]
+
+raku LRSD.rk
+
+Input: @ints = [10 4 8 3]
+ @left = [0 10 14 22]
+ @right = [15 11 3 0]
+ Output: @left_right_sum_diff = [15 1 11 22]
+---------------------------------------
+=end comment
+
+
diff --git a/challenge-225/robert-dicicco/ruby/ch-2.rb b/challenge-225/robert-dicicco/ruby/ch-2.rb
new file mode 100644
index 0000000000..5798fbe5c6
--- /dev/null
+++ b/challenge-225/robert-dicicco/ruby/ch-2.rb
@@ -0,0 +1,68 @@
+#!/usr/bin/env ruby
+=begin
+---------------------------------------
+AUTHOR: Robert DiCicco
+DATE : 2023-07-11
+Challenge 225 Task 2 Left Right Sum Diff ( Ruby )
+---------------------------------------
+=end
+#array = [1, 2, 3, 4, 5]
+array = [10,4,8,3]
+$left = Array.new();
+$right = [];
+$left_right_sum_diff = [];
+
+def ltr(array)
+ sum = 0
+ $left.push(0)
+ ln = array.length()
+ (0..ln-2).each do |x|
+ sum += array[x];
+ $left.push(sum);
+ end
+ puts("\t@left = #{$left}")
+ #puts("#{$Left[0]}")
+end
+
+def rtl(array)
+ sum = 0;
+ $right.push(0);
+ i = array.length - 1;
+ while i > 0
+ sum += array[i];
+ $right.push(sum);
+ i -= 1;
+ end
+ $right = $right.reverse()
+ puts("\t@right = #{$right}")
+end
+
+puts("Input: \@ints = #{array}");
+ltr(array)
+rtl(array)
+i = 0;
+while i < array.length
+ val = ($left[i] - $right[i]).abs
+ $left_right_sum_diff.push(val)
+ i += 1
+end
+puts("\tOutput: @left_right_sum_diff = #{$left_right_sum_diff}")
+
+=begin
+---------------------------------------
+SAMPLE OUTPUT
+ruby LRSD.rb
+Input: @ints = [1, 2, 3, 4, 5]
+ @left = [0, 1, 3, 6, 10]
+ @right = [14, 12, 9, 5, 0]
+ Output: @left_right_sum_diff = [14, 11, 6, 1, 10]
+
+ruby LRSD.rb
+Input: @ints = [10, 4, 8, 3]
+ @left = [0, 10, 14, 22]
+ @right = [15, 11, 3, 0]
+ Output: @left_right_sum_diff = [15, 1, 11, 22]
+---------------------------------------
+=end
+
+
diff --git a/challenge-225/ulrich-rieke/cpp/ch-2.cpp b/challenge-225/ulrich-rieke/cpp/ch-2.cpp
index 6db2f84360..4f21b9d158 100644
--- a/challenge-225/ulrich-rieke/cpp/ch-2.cpp
+++ b/challenge-225/ulrich-rieke/cpp/ch-2.cpp
@@ -17,7 +17,11 @@ std::vector<std::string> split( const std::string & startline ,
std::vector<int> find_left_array( const std::vector<int> & numbers ) {
int len = numbers.size( ) ;
- int limit = len / 2 ;
+ int limit = 0 ;
+ if ( len % 2 == 1 )
+ limit = len / 2 + 1 ;
+ else
+ limit = len / 2 ;
std::vector<int> left_array ;
left_array.push_back( 0 ) ;
int left_sum = 0 ;
@@ -30,11 +34,7 @@ std::vector<int> find_left_array( const std::vector<int> & numbers ) {
std::vector<int> find_right_array( const std::vector<int> & numbers ) {
int len = numbers.size( ) ;
- int left_limit = 0 ;
- if ( len % 2 == 1 )
- left_limit = len / 2 ;
- else
- left_limit = len / 2 - 1 ;
+ int left_limit = len / 2 - 1 ;
std::vector<int> right_array ;
int right_sum = 0 ;
for ( int i = left_limit ; i < len ; i++ )
@@ -44,7 +44,6 @@ std::vector<int> find_right_array( const std::vector<int> & numbers ) {
right_sum -= numbers[ i ] ;
right_array.push_back( right_sum ) ;
}
- right_array.push_back( 0 ) ;
return right_array ;
}
diff --git a/challenge-225/ulrich-rieke/haskell/ch-2.hs b/challenge-225/ulrich-rieke/haskell/ch-2.hs
index 0eb711011e..250409e060 100644
--- a/challenge-225/ulrich-rieke/haskell/ch-2.hs
+++ b/challenge-225/ulrich-rieke/haskell/ch-2.hs
@@ -4,8 +4,10 @@ module Challenge225_2
find_left_array :: [Int] -> [Int]
find_left_array list = [0] ++ map (\i -> sum $ take i list ) [1..limit + 1]
where
+ l :: Int
+ l = length list
limit :: Int
- limit = div ( length list ) 2
+ limit = if odd l then div l 2 + 1 else div l 2
find_right_array :: [Int] -> [Int]
find_right_array list = map (\i -> sum $ drop i rightPart ) [0..length
@@ -14,7 +16,7 @@ where
l :: Int
l = length list
left_limit :: Int
- left_limit = if odd l then div l 2 else div l 2 - 1
+ left_limit = div l 2 - 1
rightPart :: [Int]
rightPart = drop left_limit list
@@ -31,3 +33,4 @@ main = do
putStrLn "Enter some digits, separated by blanks!" ;
numberstrings <- getLine
print $ solution $ map read $ words numberstrings
+
diff --git a/challenge-225/ulrich-rieke/perl/ch-2.pl b/challenge-225/ulrich-rieke/perl/ch-2.pl
index 3ae0077215..793f108462 100644
--- a/challenge-225/ulrich-rieke/perl/ch-2.pl
+++ b/challenge-225/ulrich-rieke/perl/ch-2.pl
@@ -3,11 +3,20 @@ use strict ;
use warnings ;
use feature 'say' ;
+#to make the examples fit I assume that in order to form the left subarray
+#you go to the element given by the length of the array, integer divided
+#by 2 , + 1
sub find_left_array {
my $array = shift ;
my @left_array ;
my $len = scalar( @$array ) ;
- my $limit = int( $len / 2 ) ;
+ my $limit ;
+ if ( $len % 2 == 1 ) {
+ $limit = int( $len / 2 ) + 1 ;
+ }
+ else {
+ $limit = int( $len / 2 ) ;
+ }
push @left_array , 0 ;
my $left_sum = 0 ;
for my $i ( 0..$limit ) {
@@ -17,17 +26,15 @@ sub find_left_array {
return @left_array ;
}
+#to make the examples fit , I assume that the right subarray is formed by
+#the sum of all elements inclusively from the length of the array, integer
+#divided by 2 , - 1 , and subsequent subtractions of all further right
+#array elements from the sum
sub find_right_array {
my $array = shift ;
my @right_array ;
my $len = scalar( @$array ) ;
- my $left_limit ;
- if ( $len % 2 == 1 ) {
- $left_limit = int( $len / 2 ) ;
- }
- else {
- $left_limit = int( $len / 2 ) - 1 ;
- }
+ my $left_limit = int( $len / 2 ) - 1 ;
my $right_sum = 0 ;
for my $i( $left_limit..$len - 1 ) {
$right_sum += $array->[ $i ] ;
@@ -37,7 +44,6 @@ sub find_right_array {
$right_sum -= $array->[ $i ] ;
push @right_array , $right_sum ;
}
- push @right_array , 0 ;
return @right_array ;
}
diff --git a/challenge-225/ulrich-rieke/raku/ch-2.raku b/challenge-225/ulrich-rieke/raku/ch-2.raku
index e8a3035feb..4c5fec6cd4 100644
--- a/challenge-225/ulrich-rieke/raku/ch-2.raku
+++ b/challenge-225/ulrich-rieke/raku/ch-2.raku
@@ -1,9 +1,18 @@
use v6 ;
-
+#to make the examples fit , I assume that in finding the left subarray
+#you go to index given by the length of the array , integer-divided by 2 ,
+#- 1 if the length of the entire array is an odd number, otherwise to index
+#length divided by 2
sub find_left_array( @array ) {
my @left_array ;
my $len = @array.elems ;
- my $limit = $len div 2 ;
+ my $limit ;
+ if ( $len % 2 == 1 ) {
+ $limit = $len div 2 + 1 ;
+ }
+ else {
+ $limit = $len div 2 ;
+ }
@left_array.push( 0 ) ;
my $left_sum = 0 ;
for (0..$limit) -> $i {
@@ -13,16 +22,12 @@ sub find_left_array( @array ) {
return @left_array ;
}
+#to make the examples fit , I assume that the right subarray is gathered
+#from elements start at index ( length integer-divided by 2 , - 1 )
sub find_right_array( @array ) {
my @right_array ;
my $len = @array.elems ;
- my $left_limit ;
- if ( $len % 2 == 1 ) {
- $left_limit = $len div 2 ;
- }
- else {
- $left_limit = ( $len div 2 ) - 1 ;
- }
+ my $left_limit = $len div 2 - 1 ;
my $right_sum = 0 ;
for ($left_limit..$len - 1) -> $i {
$right_sum += @array[ $i ] ;
@@ -32,7 +37,6 @@ sub find_right_array( @array ) {
$right_sum -= @array[ $i ] ;
@right_array.push( $right_sum ) ;
}
- @right_array.push( 0 ) ;
return @right_array ;
}
diff --git a/challenge-225/ulrich-rieke/rust/ch-2.rs b/challenge-225/ulrich-rieke/rust/ch-2.rs
index 2dc9fe7cd5..61d5c987b5 100644
--- a/challenge-225/ulrich-rieke/rust/ch-2.rs
+++ b/challenge-225/ulrich-rieke/rust/ch-2.rs
@@ -2,7 +2,13 @@ use std::io ;
fn find_left_array( numbers : &Vec<i32> ) -> Vec<i32> {
let len : usize = numbers.len( ) ;
- let limit : usize = len / 2 ;
+ let limit : usize ;
+ if len % 2 == 1 {
+ limit = len / 2 + 1 ;
+ }
+ else {
+ limit = len / 2 ;
+ }
let mut left_array : Vec<i32> = Vec::new( ) ;
left_array.push( 0 ) ;
let mut left_sum : i32 = 0 ;
@@ -15,13 +21,7 @@ fn find_left_array( numbers : &Vec<i32> ) -> Vec<i32> {
fn find_right_array( numbers : &Vec<i32> ) -> Vec<i32> {
let len : usize = numbers.len( ) ;
- let left_limit : usize ;
- if len % 2 == 1 {
- left_limit = len / 2 ;
- }
- else {
- left_limit = len / 2 - 1 ;
- }
+ let left_limit : usize = len / 2 - 1 ;
let mut right_array : Vec<i32> = Vec::new( ) ;
let mut right_sum : i32 = 0 ;
for i in left_limit..len {
@@ -32,7 +32,6 @@ fn find_right_array( numbers : &Vec<i32> ) -> Vec<i32> {
right_sum -= numbers[ i ] ;
right_array.push( right_sum ) ;
}
- right_array.push( 0 ) ;
right_array
}
@@ -55,4 +54,3 @@ fn main() {
println!("{:?}" , result ) ;
}
}
-
diff --git a/stats/pwc-challenge-203.json b/stats/pwc-challenge-203.json
index d34b6d4d78..6c84652ef0 100644
--- a/stats/pwc-challenge-203.json
+++ b/stats/pwc-challenge-203.json
@@ -1,28 +1,17 @@
{
- "legend" : {
- "enabled" : 0
- },
- "xAxis" : {
- "type" : "category"
- },
- "subtitle" : {
- "text" : "[Champions: 35] Last updated at 2023-03-19 07:24:03 GMT"
- },
- "yAxis" : {
- "title" : {
- "text" : "Total Solutions"
- }
- },
- "tooltip" : {
- "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>",
- "followPointer" : 1,
- "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>"
- },
"drilldown" : {
"series" : [
{
- "name" : "Arne Sommer",
- "id" : "Arne Sommer",
+ "id" : "Adam Russell",
+ "name" : "Adam Russell",
+ "data" : [
+ [
+ "Perl",
+ 2
+ ]
+ ]
+ },
+ {
"data" : [
[
"Raku",
@@ -32,7 +21,9 @@
"Blog",
1
]
- ]
+ ],
+ "name" : "Arne Sommer",
+ "id" : "Arne Sommer"
},
{
"id" : "Athanasius",
@@ -55,8 +46,8 @@
2
]
],
- "name" : "BarrOff",
- "id" : "BarrOff"
+ "id" : "BarrOff",
+ "name" : "BarrOff"
},
{
"name" : "Bob Lied",
@@ -69,18 +60,18 @@
]
},
{
- "id" : "Carlos Oliveira",
- "name" : "Carlos Oliveira",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Carlos Oliveira",
+ "name" : "Carlos Oliveira"
},
{
- "id" : "Cheok-Yin Fung",
"name" : "Cheok-Yin Fung",
+ "id" : "Cheok-Yin Fung",
"data" : [
[
"Perl",
@@ -99,16 +90,18 @@
]
},
{
+ "name" : "Colin Crain",
+ "id" : "Colin Crain",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Colin Crain",
- "name" : "Colin Crain"
+ ]
},
{
+ "id" : "Dave Jacoby",
+ "name" : "Dave Jacoby",
"data" : [
[
"Perl",
@@ -118,9 +111,7 @@
"Blog",
1
]
- ],
- "id" : "Dave Jacoby",
- "name" : "Dave Jacoby"
+ ]
},
{
"data" : [
@@ -143,24 +134,24 @@
"name" : "Duncan C. White"
},
{
- "name" : "E. Choroba",
- "id" : "E. Choroba",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "E. Choroba",
+ "id" : "E. Choroba"
},
{
+ "name" : "Feng Chang",
+ "id" : "Feng Chang",
"data" : [
[
"Raku",
2
]
- ],
- "name" : "Feng Chang",
- "id" : "Feng Chang"
+ ]
},
{
"name" : "Flavio Poletti",
@@ -205,18 +196,18 @@
]
},
{
+ "id" : "Jorg Sommrey",
+ "name" : "Jorg Sommrey",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Jorg Sommrey",
- "id" : "Jorg Sommrey"
+ ]
},
{
- "name" : "Kjetil Skotheim",
"id" : "Kjetil Skotheim",
+ "name" : "Kjetil Skotheim",
"data" : [
[
"Perl",
@@ -225,6 +216,8 @@
]
},
{
+ "name" : "Laurent Rosenfeld",
+ "id" : "Laurent Rosenfeld",
"data" : [
[
"Perl",
@@ -238,19 +231,17 @@
"Blog",
1
]
- ],
- "id" : "Laurent Rosenfeld",
- "name" : "Laurent Rosenfeld"
+ ]
},
{
- "id" : "Lubos Kolouch",
- "name" : "Lubos Kolouch",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "Lubos Kolouch",
+ "id" : "Lubos Kolouch"
},
{
"data" : [
@@ -277,8 +268,8 @@
"id" : "Mariano Spadaccini"
},
{
- "name" : "Mark Anderson",
"id" : "Mark Anderson",
+ "name" : "Mark Anderson",
"data" : [
[
"Raku",
@@ -287,8 +278,8 @@
]
},
{
- "name" : "Paulo Custodio",
"id" : "Paulo Custodio",
+ "name" : "Paulo Custodio",
"data" : [
[
"Perl",
@@ -297,8 +288,6 @@
]
},
{
- "name" : "Peter Campbell Smith",
- "id" : "Peter Campbell Smith",
"data" : [
[
"Perl",
@@ -308,7 +297,9 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Peter Campbell Smith",
+ "name" : "Peter Campbell Smith"
},
{
"data" : [
@@ -321,10 +312,12 @@
2
]
],
- "id" : "Pip Stuart",
- "name" : "Pip Stuart"
+ "name" : "Pip Stuart",
+ "id" : "Pip Stuart"
},
{
+ "id" : "Robbie Hatley",
+ "name" : "Robbie Hatley",
"data" : [
[
"Perl",
@@ -334,13 +327,11 @@
"Blog",
1
]
- ],
- "id" : "Robbie Hatley",
- "name" : "Robbie Hatley"
+ ]
},
{
- "name" : "Robert DiCicco",
"id" : "Robert DiCicco",
+ "name" : "Robert DiCicco",
"data" : [
[
"Perl",
@@ -359,12 +350,10 @@
2
]
],
- "name" : "Robert Ransbottom",
- "id" : "Robert Ransbottom"
+ "id" : "Robert Ransbottom",
+ "name" : "Robert Ransbottom"
},
{
- "name" : "Roger Bell_West",
- "id" : "Roger Bell_West",
"data" : [
[
"Perl",
@@ -378,7 +367,9 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Roger Bell_West",
+ "name" : "Roger Bell_West"
},
{
"data" : [
@@ -387,8 +378,8 @@
1
]
],
- "name" : "Simon Green",
- "id" : "Simon Green"
+ "id" : "Simon Green",
+ "name" : "Simon Green"
},
{
"id" : "Solathian",
@@ -411,12 +402,10 @@
2
]
],
- "id" : "Thomas Kohler",
- "name" : "Thomas Kohler"
+ "name" : "Thomas Kohler",
+ "id" : "Thomas Kohler"
},
{
- "name" : "Ulrich Rieke",
- "id" : "Ulrich Rieke",
"data" : [
[
"Perl",
@@ -426,9 +415,13 @@
"Raku",
1
]
- ]
+ ],
+ "name" : "Ulrich Rieke",
+ "id" : "Ulrich Rieke"
},
{
+ "id" : "W. Luis Mochan",
+ "name" : "W. Luis Mochan",
"data" : [
[
"Perl",
@@ -438,51 +431,52 @@
"Blog",
1
]
- ],
- "id" : "W. Luis Mochan",
- "name" : "W. Luis Mochan"
+ ]
}
]
},
"series" : [
{
- "colorByPoint" : 1,
- "name" : "The Weekly Challenge - 203",
"data" : [
{
+ "y" : 2,
+ "name" : "Adam Russell",
+ "drilldown" : "Adam Russell"
+ },
+ {
"name" : "Arne Sommer",
- "drilldown" : "Arne Sommer",
- "y" : 3
+ "y" : 3,
+ "drilldown" : "Arne Sommer"
},
{
- "drilldown" : "Athanasius",
"name" : "Athanasius",
- "y" : 4
+ "y" : 4,
+ "drilldown" : "Athanasius"
},
{
- "drilldown" : "BarrOff",
+ "y" : 2,
"name" : "BarrOff",
- "y" : 2
+ "drilldown" : "BarrOff"
},
{
- "y" : 2,
"drilldown" : "Bob Lied",
- "name" : "Bob Lied"
+ "name" : "Bob Lied",
+ "y" : 2
},
{
- "name" : "Carlos Oliveira",
"drilldown" : "Carlos Oliveira",
- "y" : 2
+ "y" : 2,
+ "name" : "Carlos Oliveira"
},
{
+ "name" : "Cheok-Yin Fung",
"y" : 1,
- "drilldown" : "Cheok-Yin Fung",
- "name" : "Cheok-Yin Fung"
+ "drilldown" : "Cheok-Yin Fung"
},
{
"drilldown" : "Chicagoist",
- "name" : "Chicagoist",
- "y" : 2
+ "y" : 2,
+ "name" : "Chicagoist"
},
{
"y" : 2,
@@ -496,12 +490,12 @@
},
{
"drilldown" : "David Ferrone",
- "name" : "David Ferrone",
- "y" : 2
+ "y" : 2,
+ "name" : "David Ferrone"
},
{
- "name" : "Duncan C. White",
"drilldown" : "Duncan C. White",
+ "name" : "Duncan C. White",
"y" : 2
},
{
@@ -510,13 +504,13 @@
"drilldown" : "E. Choroba"
},
{
+ "y" : 2,
"name" : "Feng Chang",
- "drilldown" : "Feng Chang",
- "y" : 2
+ "drilldown" : "Feng Chang"
},
{
- "y" : 6,
"name" : "Flavio Poletti",
+ "y" : 6,
"drilldown" : "Flavio Poletti"
},
{
@@ -525,9 +519,9 @@
"drilldown" : "James Smith"
},
{
- "drilldown" : "Jan Krnavek",
+ "y" : 2,
"name" : "Jan Krnavek",
- "y" : 2
+ "drilldown" : "Jan Krnavek"
},
{
"drilldown" : "Jorg Sommrey",
@@ -536,110 +530,131 @@
},
{
"drilldown" : "Kjetil Skotheim",
- "name" : "Kjetil Skotheim",
- "y" : 2
+ "y" : 2,
+ "name" : "Kjetil Skotheim"
},
{
- "y" : 5,
+ "drilldown" : "Laurent Rosenfeld",
"name" : "Laurent Rosenfeld",
- "drilldown" : "Laurent Rosenfeld"
+ "y" : 5
},
{
+ "name" : "Lubos Kolouch",
"y" : 2,
- "drilldown" : "Lubos Kolouch",
- "name" : "Lubos Kolouch"
+ "drilldown" : "Lubos Kolouch"
},
{
- "y" : 8,
"drilldown" : "Luca Ferrari",
- "name" : "Luca Ferrari"
+ "name" : "Luca Ferrari",
+ "y" : 8
},
{
+ "y" : 2,
"name" : "Mariano Spadaccini",
- "drilldown" : "Mariano Spadaccini",
- "y" : 2
+ "drilldown" : "Mariano Spadaccini"
},
{
- "y" : 2,
"drilldown" : "Mark Anderson",
- "name" : "Mark Anderson"
+ "name" : "Mark Anderson",
+ "y" : 2
},
{
"y" : 2,
- "drilldown" : "Paulo Custodio",
- "name" : "Paulo Custodio"
+ "name" : "Paulo Custodio",
+ "drilldown" : "Paulo Custodio"
},
{
- "name" : "Peter Campbell Smith",
"drilldown" : "Peter Campbell Smith",
+ "name" : "Peter Campbell Smith",
"y" : 3
},
{
- "drilldown" : "Pip Stuart",
+ "y" : 4,
"name" : "Pip Stuart",
- "y" : 4
+ "drilldown" : "Pip Stuart"
},
{
"y" : 3,
- "drilldown" : "Robbie Hatley",
- "name" : "Robbie Hat