diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2020-08-01 04:23:31 +0100 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2020-08-01 04:23:31 +0100 |
| commit | 3b0c79ec93149d7dfd7adf3e1cc08f7de1a42287 (patch) | |
| tree | a9437f5c0311ffe42f75c3b7c75aadbbecaf16b9 | |
| parent | 555e3458d7fee0bcc0f9e57087d7b3a9ef6e198f (diff) | |
| download | perlweeklychallenge-club-3b0c79ec93149d7dfd7adf3e1cc08f7de1a42287.tar.gz perlweeklychallenge-club-3b0c79ec93149d7dfd7adf3e1cc08f7de1a42287.tar.bz2 perlweeklychallenge-club-3b0c79ec93149d7dfd7adf3e1cc08f7de1a42287.zip | |
- Added solutions by Colin Crain.
| -rw-r--r-- | challenge-071/colin-crain/blog.txt | 1 | ||||
| -rw-r--r-- | challenge-071/colin-crain/perl/ch-1.pl | 48 | ||||
| -rw-r--r-- | challenge-071/colin-crain/perl/ch-2.pl | 155 | ||||
| -rw-r--r-- | challenge-071/colin-crain/raku/ch-1.raku | 50 | ||||
| -rw-r--r-- | challenge-071/colin-crain/raku/ch-2.raku | 143 | ||||
| -rw-r--r-- | stats/pwc-current.json | 215 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown-summary.json | 62 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown.json | 1048 | ||||
| -rw-r--r-- | stats/pwc-leaders.json | 464 | ||||
| -rw-r--r-- | stats/pwc-summary-1-30.json | 120 | ||||
| -rw-r--r-- | stats/pwc-summary-121-150.json | 106 | ||||
| -rw-r--r-- | stats/pwc-summary-151-180.json | 52 | ||||
| -rw-r--r-- | stats/pwc-summary-31-60.json | 46 | ||||
| -rw-r--r-- | stats/pwc-summary-61-90.json | 98 | ||||
| -rw-r--r-- | stats/pwc-summary-91-120.json | 98 | ||||
| -rw-r--r-- | stats/pwc-summary.json | 40 |
16 files changed, 1583 insertions, 1163 deletions
diff --git a/challenge-071/colin-crain/blog.txt b/challenge-071/colin-crain/blog.txt new file mode 100644 index 0000000000..f3def02ee2 --- /dev/null +++ b/challenge-071/colin-crain/blog.txt @@ -0,0 +1 @@ +https://colincrain.wordpress.com/2020/07/31/traversing-peaks-for-the-missing-link/ diff --git a/challenge-071/colin-crain/perl/ch-1.pl b/challenge-071/colin-crain/perl/ch-1.pl new file mode 100644 index 0000000000..e6af8e7afe --- /dev/null +++ b/challenge-071/colin-crain/perl/ch-1.pl @@ -0,0 +1,48 @@ +#! /opt/local/bin/perl +# +# peak_power.pl +# +# TASK #1 › Peak Element +# Submitted by: Mohammad S Anwar +# You are given positive integer $N (>1). +# +# Write a script to create an arr of size $N with random unique elements between 1 and 50. +# +# In the end it should print peak elements in the arr, if found. +# +# An arr element is called peak if it is bigger than it’s neighbour. +# +# Example 1 +# Array: [ 18, 45, 38, 25, 10, 7, 21, 6, 28, 48 ] +# Peak: [ 48, 45, 21 ] +# Example 2 +# Array: [ 47, 11, 32, 8, 1, 9, 39, 14, 36, 23 ] +# Peak: [ 47, 32, 39, 36 ] +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +use warnings; +use strict; +use feature ":5.26"; + +## ## ## ## ## MAIN: + +my $n = shift @ARGV // 10; + +## encapsulating the arr in 0s first +## makes the comparisons at the ends of cleaner +my @arr = (0); +push @arr, int(rand(50))+1 for (1..$n); +push @arr, 0; + +say "input array: @arr[1..@arr-2]"; + +## map over the array indices, grepping the comparison and then +## converting back into values +my @output = map { $arr[$_] } + grep { ($arr[$_-1] < $arr[$_] && $arr[$_] > $arr[$_+1]) } + (1..@arr-2); + +say "peak values: @output"; diff --git a/challenge-071/colin-crain/perl/ch-2.pl b/challenge-071/colin-crain/perl/ch-2.pl new file mode 100644 index 0000000000..1abaf9a7b8 --- /dev/null +++ b/challenge-071/colin-crain/perl/ch-2.pl @@ -0,0 +1,155 @@ +#! /opt/local/bin/perl +# +# missing_link.pl +# +# TASK #2 › Trim Linked List +# Submitted by: Mohammad S Anwar +# You are given a singly linked list and a positive integer $N (>0). +# +# Write a script to remove the $Nth node from the end of the linked list and print the linked list. +# +# If $N is greater than the size of the linked list then remove the first node of the list. +# +# NOTE: Please use pure linked list implementation. +# +# Example +# Given Linked List: 1 -> 2 -> 3 -> 4 -> 5 +# +# when $N = 1 +# Output: 1 -> 2 -> 3 -> 4 +# +# when $N = 2 +# Output: 1 -> 2 -> 3 -> 5 +# +# when $N = 3 +# Output: 1 -> 2 -> 4 -> 5 +# +# when $N = 4 +# Output: 1 -> 3 -> 4 -> 5 +# +# when $N = 5 +# Output: 2 -> 3 -> 4 -> 5 +# +# when $N = 6 +# Output: 2 -> 3 -> 4 -> 5 +# +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +use warnings; +use strict; +use feature ":5.26"; +use Moo; + +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## CLASSES: + +package Node; +use Moo; + + has value => ( is => 'rw' ); + has next => ( is => 'rw' ); + + sub terminate { + $_[0]->{value} = undef; + } + + sub lookahead { + ## looks forward n nodes in list + ## returns: 1 if node is not last node + ## 0 if node is last node + ## -1 if list not long enough + my ($self, $distance) = @_; + if (! defined $self->next && $distance > 0) { + return -1; + } + if ($distance == 0) { + return $self->next ? 1 : 0; + } + return lookahead($self->next, $distance - 1); + } + + + +package LinkedList; +use Moo; + + has 'start_node' => ( is => 'rw' ); + + sub populate_from_array { + ## convert array into a linked list + ## sets start_node + my ($self, @input) = @_; + my ($node, $next); + while (scalar @input > 0) { + my $value = pop @input; + $node = new Node(value => $value, next => $next); + $next = $node; + } + $self->start_node($node); + } + + sub arrow_print { + ## pretty print the list + my $self = shift; + my $node = $self->start_node; + + my @output; + while (defined $node) { + push @output, $node->value; + $node = $node->next; + + } + say join ' → ', @output; + } + + sub remove_next { + ## splices out the next node and relinks + my ($self, $node) = @_; + my $unlinked = $node->next; + $node->next( $node->next->next ); + $unlinked->terminate; + } + + sub remove_head { + ## remove the starting node and resets start to second node + my $self = shift; + my $unlink = $self->start_node; + $self->start_node($self->start_node->next); + $unlink->terminate; + } + + +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## MAIN: + +package main; +use Node; +use LinkedList; + +my ($n, @input) = @ARGV; +say "input @input +target $n +---------------------------------- +"; + +my $list = new LinkedList; +$list->populate_from_array(@input); +$list->arrow_print; + +## unlink the n-th node from the end +my $node = $list->start_node; +while ( -looking_ahead ) { + my $res = $node->lookahead( $n ) ; + if ( $res < 1 ) { + $res == 0 && $list->remove_next($node); + $res == -1 && $list->remove_head; + last; + } + $node = $node->next; +} + +$list->arrow_print; + + + diff --git a/challenge-071/colin-crain/raku/ch-1.raku b/challenge-071/colin-crain/raku/ch-1.raku new file mode 100644 index 0000000000..f7b0d92cbc --- /dev/null +++ b/challenge-071/colin-crain/raku/ch-1.raku @@ -0,0 +1,50 @@ +#!/usr/bin/env perl6 +# +# +# peak_power.raku +# +# TASK #1 › Peak Element +# Submitted by: Mohammad S Anwar +# You are given positive integer $N (>1). +# +# Write a script to create an arr of size $N with random +# unique elements between 1 and 50. +# +# In the end it should print peak elements in the arr, if +# found. +# +# An arr element is called peak if it is bigger than it’s +# neighbour. +# +# Example 1 +# Array: [ 18, 45, 38, 25, 10, 7, 21, 6, 28, 48 ] +# Peak: [ 48, 45, 21 ] +# +# Example 2 +# Array: [ 47, 11, 32, 8, 1, 9, 39, 14, 36, 23 ] +# Peak: [ 47, 32, 39, 36 ] +# +# +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +sub MAIN (Int $n where {$n > 0} = 10 ) { + + # create our random array: + # bookending the arr in 0s + # makes the comparisons at the ends cleaner + my @a = 0, |(^$n).map({ (1..50).pick }), 0 ; + + say "input array: @a[1..@a-2]"; + + ## the indices for the original array elements + ## map back to their array values iff comparison passes + my @output = (1..^@a.end) + .map: { @a[$_] if @a[$_-1] < @a[$_] && @a[$_] > @a[$_+1] }; + + say "peak values: ", @output.join: ' '; + +} + diff --git a/challenge-071/colin-crain/raku/ch-2.raku b/challenge-071/colin-crain/raku/ch-2.raku new file mode 100644 index 0000000000..7598c71558 --- /dev/null +++ b/challenge-071/colin-crain/raku/ch-2.raku @@ -0,0 +1,143 @@ +#!/usr/bin/env perl6 +# +# +# missing-link.raku +# +# TASK #2 › Trim Linked List +# Submitted by: Mohammad S Anwar +# You are given a singly linked list and a positive +# integer $N (>0). +# +# Write a script to remove the $Nth node from the end +# of the linked list and print the linked list. +# +# If $N is greater than the size of the linked list +# then remove the first node of the list. +# +# NOTE: Please use pure linked list implementation. +# +# Example +# Given Linked List: 1 -> 2 -> 3 -> 4 -> 5 +# +# when $N = 1 +# Output: 1 -> 2 -> 3 -> 4 +# +# when $N = 2 +# Output: 1 -> 2 -> 3 -> 5 +# +# when $N = 3 +# Output: 1 -> 2 -> 4 -> 5 +# +# when $N = 4 +# Output: 1 -> 3 -> 4 -> 5 +# +# when $N = 5 +# Output: 2 -> 3 -> 4 -> 5 +# +# when $N = 6 +# Output: 2 -> 3 -> 4 -> 5 +# +# +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +class Node { + has Any $.value is rw; + has Node $.next is rw; + + method terminate { + $.next = Nil + } + + method lookahead ( Int $distance ) { + ## looks forward n nodes in list + ## returns: + ## 1 if node is not last node + ## 0 if node is last node + ## -1 if list not long enough + when ! $.next.defined && $distance > 0 { return -1 } + when $distance == 0 && $.next.defined { return 1 } + when $distance == 0 { return 0 } + + return $.next.lookahead($distance - 1); + } + +} + +class LinkedList { + has Node $.first is rw; + has Node $!last; + + method populate_from_array ( @array ) { + my $node; + my $next; + while @array.elems > 0 { + $node = Node.new(value => @array.pop); + $!last //= $node; + $node.next = $next if $next.defined; + $next = $node; + } + $.first = $node; + } + + method arrow_print () { + my @output; + my $node = $.first; + loop { + @output.push: $node.value; + last if ! $node.next.defined; + $node = $node.next; + } + @output.join(' → ').say; + } + + method remove_next ( Node $node ) { + ## splices out the next node and relinks around + return unless $node.next; + my $x = $node.next; + $node.next = $node.next.next; + $x.terminate; + } + + method remove_head { + ## remove the first node and resets first to second node + my $x = $.first; + $.first = $x.next; + $x.terminate; + } + +} + +multi MAIN () { + say "Usage: ./missing-link.raku location a1 a2 a3 ... + location > 0"; +} + +multi MAIN ( Int $n where { $n > 0 }, *@array ) { + + ## convert the input commandline array into a linked list + my $list = LinkedList.new; + $list.populate_from_array( @array ); + $list.arrow_print; + + ## unlink the n-th node from the end + my $node = $list.first; + + LOOK: + loop { + given $node.lookahead( $n ) { + when 0 { $list.remove_next( $node ); last LOOK } + when -1 { $list.remove_head; last LOOK } + $node = $node.next; + } + } + + $list.arrow_print; +} + + + diff --git a/stats/pwc-current.json b/stats/pwc-current.json index e308d1219a..06570cf95c 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,31 +1,20 @@ { + "xAxis" : { + "type" : "category" + }, + "subtitle" : { + "text" : "[Champions: 18] Last updated at 2020-08-01 03:22:32 GMT" + }, "yAxis" : { "title" : { "text" : "Total Solutions" } }, - "title" : { - "text" : "Perl Weekly Challenge - 071" - }, - "legend" : { - "enabled" : 0 - }, - "chart" : { - "type" : "column" - }, - "subtitle" : { - "text" : "[Champions: 17] Last updated at 2020-08-01 03:06:31 GMT" - }, - "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/>" - }, "drilldown" : { "series" : [ { - "id" : "Ben Davies", "name" : "Ben Davies", + "id" : "Ben Davies", "data" : [ [ "Raku", @@ -34,24 +23,32 @@ ] }, { - "id" : "Bob Lied", - "name" : "Bob Lied", "data" : [ [ "Perl", 2 ] - ] + ], + "id" : "Bob Lied", + "name" : "Bob Lied" }, { "data" : [ [ "Perl", 2 + ], + [ + "Raku", + 2 + ], + [ + "Blog", + 1 ] ], - "name" : "Dave Jacoby", - "id" : "Dave Jacoby" + "name" : "Colin Crain", + "id" : "Colin Crain" }, { "data" : [ @@ -60,8 +57,18 @@ 2 ] ], + "id" : "Dave Jacoby", + "name" : "Dave Jacoby" + }, + { + "id" : "E. Choroba", "name" : "E. Choroba", - "id" : "E. Choroba" + "data" : [ + [ + "Perl", + 2 + ] + ] }, { "data" : [ @@ -82,6 +89,8 @@ "id" : "Jaldhar H. Vyas" }, { + "id" : "Javier Luque", + "name" : "Javier Luque", "data" : [ [ "Perl", @@ -95,21 +104,21 @@ "Blog", 1 ] - ], - "id" : "Javier Luque", - "name" : "Javier Luque" + ] }, { + "name" : "Jorg Sommrey", + "id" : "Jorg Sommrey", "data" : [ [ "Perl", 2 ] - ], - "id" : "Jorg Sommrey", - "name" : "Jorg Sommrey" + ] }, { + "id" : "Luca Ferrari", + "name" : "Luca Ferrari", "data" : [ [ "Raku", @@ -119,23 +128,21 @@ "Blog", 2 ] - ], - "id" : "Luca Ferrari", - "name" : "Luca Ferrari" + ] }, { - "name" : "Mark Anderson", - "id" : "Mark Anderson", "data" : [ [ "Raku", 1 ] - ] + ], + "id" : "Mark Anderson", + "name" : "Mark Anderson" }, { - "name" : "Mohammad S Anwar", "id" : "Mohammad S Anwar", + "name" : "Mohammad S Anwar", "data" : [ [ "Perl", @@ -148,24 +155,24 @@ ] }, { - "id" : "Niels van Dijke", - "name" : "Niels van Dijke", "data" : [ [ "Perl", 2 ] - ] + ], + "id" : "Niels van Dijke", + "name" : "Niels van Dijke" }, { - "name" : "Noud Aldenhoven", - "id" : "Noud Aldenhoven", "data" : [ [ "Raku", 2 ] - ] + ], + "name" : "Noud Aldenhoven", + "id" : "Noud Aldenhoven" }, { "data" : [ @@ -182,32 +189,32 @@ 1 ] ], - "id" : "Roger Bell_West", - "name" : "Roger Bell_West" + "name" : "Roger Bell_West", + "id" : "Roger Bell_West" }, { + "name" : "Simon Proctor", + "id" : "Simon Proctor", "data" : [ [ "Raku", 2 ] - ], - "name" : "Simon Proctor", - "id" : "Simon Proctor" + ] }, { - "id" : "Ulrich Rieke", - "name" : "Ulrich Rieke", "data" : [ [ "Raku", 2 ] - ] + ], + "id" : "Ulrich Rieke", + "name" : "Ulrich Rieke" }, { - "name" : "Walt Mankowski", "id" : "Walt Mankowski", + "name" : "Walt Mankowski", "data" : [ [ "Perl", @@ -220,8 +227,8 @@ ] }, { - "name" : "Wanderdoc", "id" : "Wanderdoc", + "name" : "Wanderdoc", "data" : [ [ "Perl", @@ -231,88 +238,113 @@ } ] }, - "xAxis" : { - "type" : "category" + "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/>" + }, + "title" : { + "text" : "Perl Weekly Challenge - 071" + }, + "plotOptions" : { + "series" : { + "dataLabels" : { + "enabled" : 1, + "format" : "{point.y}" + }, + "borderWidth" : 0 + } + }, + "chart" : { + "type" : "column" + }, + "legend" : { + "enabled" : 0 }, "series" : [ { - "name" : "Perl Weekly Challenge - 071", "colorByPoint" : 1, + "name" : "Perl Weekly Challenge - 071", "data" : [ { - "name" : "Ben Davies", "y" : 2, + "name" : "Ben Davies", "drilldown" : "Ben Davies" }, { "drilldown" : "Bob Lied", - "y" : 2, - "name" : "Bob Lied" + "name" : "Bob Lied", + "y" : 2 + }, + { + "drilldown" : "Colin Crain", + "name" : "Colin Crain", + "y" : 5 }, { "y" : 2, - "drilldown" : "Dave Jacoby", - "name" : "Dave Jacoby" + "name" : "Dave Jacoby", + "drilldown" : "Dave Jacoby" }, { "y" : 2, - "drilldown" : "E. Choroba", - "name" : "E. Choroba" + "name" : "E. Choroba", + "drilldown" : "E. Choroba" }, { - "drilldown" : "Jaldhar H. Vyas", "y" : 5, - "name" : "Jaldhar H. Vyas" + "name" : "Jaldhar H. Vyas", + "drilldown" : "Jaldhar H. Vyas" }, { - "name" : "Javier Luque", "y" : 5, + "name" : "Javier Luque", "drilldown" : "Javier Luque" }, { - "y" : 2, "drilldown" : "Jorg Sommrey", - "name" : "Jorg Sommrey" + "name" : "Jorg Sommrey", + "y" : 2 }, { "y" : 4, - "drilldown" : "Luca Ferrari", - "name" : "Luca Ferrari" + "name" : "Luca Ferrari", + "drilldown" : "Luca Ferrari" }, { "name" : "Mark Anderson", - "drilldown" : "Mark Anderson", - "y" : 1 + "y" : 1, + "drilldown" : "Mark Anderson" }, { - "name" : "Mohammad S Anwar", + "drilldown" : "Mohammad S Anwar", "y" : 4, - "drilldown" : "Mohammad S Anwar" + "name" : "Mohammad S Anwar" }, { - "name" : "Niels van Dijke", + "drilldown" : "Niels van Dijke", "y" : 2, - "drilldown" : "Niels van Dijke" + "name" : "Niels van Dijke" }, { - "y" : 2, "drilldown" : "Noud Aldenhoven", - "name" : "Noud Aldenhoven" + "name" : "Noud Aldenhoven", + "y" : 2 }, { - "name" : "Roger Bell_West", "drilldown" : "Roger Bell_West", - "y" : 3 + "y" : 3, + "name" : "Roger Bell_West" }, { - "drilldown" : "Simon Proctor", "y" : 2, - "name" : "Simon Proctor" + "name" : "Simon Proctor", + "drilldown" : "Simon Proctor" }, { "name" : "Ulrich Rieke", - "drilldown" : "Ulrich Rieke", - "y" : 2 + "y" : 2, + "drilldown" : "Ulrich Rieke" }, { "drilldown" : "Walt Mankowski", @@ -320,20 +352,11 @@ "name" : "Walt Mankowski" }, { - "drilldown" : "Wanderdoc", "y" : 2, - "name" : "Wanderdoc" + "name" : "Wanderdoc", + "drilldown" : "Wanderdoc" } ] } - ], - "plotOptions" : { - "series" : { - "borderWidth" : 0, - "dataLabels" : { - "format" : "{point.y}", - "enabled" : 1 - } - } - } + ] } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index b004c9773c..ee89bcfbad 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,63 +1,63 @@ { - "title" : { - "text" : "Perl Weekly Challenge Contributions [2019 - 2020]" - }, - "yAxis" : { - "title" : { - "text" : null - }, - "min" : 0 - }, - "legend" : { - "enabled" : "false" - }, - "chart" : { - "type" : "column" - }, - "tooltip" : { - "pointFormat" : "<b>{point.y:.0f}</b>" - }, - "subtitle" : { - "text" : "Last updated at 2020-08-01 03:06:31 GMT" - }, "series" : [ { "data" : [ [ "Blog", - 844 + 845 ], [ "Perl", - 2924 + 2926 ], [ "Raku", - 1886 + 1888 ] ], "dataLabels" : { - "format" : "{point.y:.0f}", + "rotation" : -90, "color" : "#FFFFFF", "style" : { "fontFamily" : "Verdana, sans-serif", "fontSize" : "13px" }, - "align" : "right", "enabled" : "true", - "rotation" : -90, + "format" : "{point.y:.0f}", + "align" : "right", "y" : 10 }, "name" : "Contributions" } ], + "legend" : { + "enabled" : "false" + }, + "chart" : { + "type" : "column" + }, + "title" : { + "text" : "Perl Weekly Challenge Contributions [2019 - 2020]" + }, + "tooltip" : { + "pointFormat" : "<b>{point.y:.0f}</b>" + }, + "yAxis" : { + "title" : { + "text" : null + }, + "min" : 0 + }, + "subtitle" : { + "text" : "Last updated at 2020-08-01 03:22:32 GMT" + }, "xAxis" : { - "type" : "category", "labels" : { "style" : { - "fontSize" : "13px", - "fontFamily" : "Verdana, sans-serif" + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" } - } + }, + "type" : "category" } } diff --git a/stats/pwc-language-breakdown.json b/stats/pwc-language-breakdown.json index 789179aa7d..8ba4cf8f5f 100644 --- a/stats/pwc-language-breakdown.json +++ b/stats/pwc-language-breakdown.json @@ -1,11 +1,400 @@ { - "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2020-08-01 03:06:31 GMT" + "plotOptions" : { + "series" : { + "dataLabels" : { + "format" : "{point.y}", + "enabled" : 1 + }, + "borderWidth" : 0 + } + }, + "chart" : { + "type" : "column" }, + "legend" : { + "enabled" : "false" + }, + "series" : [ + { + "name" : "Perl Weekly Challenge Languages", + "colorByPoint" : "true", + "data" : [ + { + "drilldown" : "001", + "name" : "#001", + "y" : 142 + }, + { + "drilldown" : "002", + "y" : 109, + "name" : "#002" + }, + { + "y" : 71, + "name" : "#003", + "drilldown" : "003" + }, + { + "y" : 91, + "name" : "#004", + "drilldown" : "004" + }, + { + "y" : 72, + "name" : "#005", + "drilldown" : "005" + }, + { + "drilldown" : "006", + "y" : 52, + "name" : "#006" + }, + { + "y" : 59, + "name" : "#007", + "drilldown" : "007" + }, + { + "name" : "#008", + "y" : 72, + "drilldown" : "008" + }, + { + "drilldown" : "009", + "name" : "#009", + "y" : 68 + }, + { + "y" : 60, + "name" : "#010", + "drilldown" : "010" + }, + { + "drilldown" : "011", + "y" : 79, + "name" : "#011" + }, + { + "drilldown" : "012", + "name" : "#012", + "y" : 83 + }, + { + "drilldown" : "013", + "name" : "#013", + "y" : 76 + }, + { + "y" : 96, + "name" : "#014", + "drilldown" : "014" + }, + { + "name" : "#015", + "y" : 93, + "drilldown" : "015" + }, + { + "drilldown" : "016", + "y" : 66, + "name" : "#016" + }, |
