diff options
| -rw-r--r-- | challenge-123/ulrich-rieke/cpp/ch-1.cpp | 35 | ||||
| -rw-r--r-- | challenge-123/ulrich-rieke/cpp/ch-2.cpp | 45 | ||||
| -rw-r--r-- | challenge-123/ulrich-rieke/haskell/ch-2.hs | 26 | ||||
| -rw-r--r-- | challenge-123/ulrich-rieke/perl/ch-1.pl | 37 | ||||
| -rw-r--r-- | challenge-123/ulrich-rieke/perl/ch-2.pl | 46 | ||||
| -rw-r--r-- | challenge-123/ulrich-rieke/raku/ch-1.raku | 31 | ||||
| -rw-r--r-- | challenge-123/ulrich-rieke/raku/ch-2.raku | 31 | ||||
| -rw-r--r-- | stats/pwc-current.json | 131 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown-summary.json | 76 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown.json | 1714 | ||||
| -rw-r--r-- | stats/pwc-leaders.json | 724 | ||||
| -rw-r--r-- | stats/pwc-summary-1-30.json | 40 | ||||
| -rw-r--r-- | stats/pwc-summary-121-150.json | 100 | ||||
| -rw-r--r-- | stats/pwc-summary-151-180.json | 110 | ||||
| -rw-r--r-- | stats/pwc-summary-181-210.json | 30 | ||||
| -rw-r--r-- | stats/pwc-summary-211-240.json | 96 | ||||
| -rw-r--r-- | stats/pwc-summary-31-60.json | 104 | ||||
| -rw-r--r-- | stats/pwc-summary-61-90.json | 96 | ||||
| -rw-r--r-- | stats/pwc-summary-91-120.json | 108 | ||||
| -rw-r--r-- | stats/pwc-summary.json | 514 |
20 files changed, 2182 insertions, 1912 deletions
diff --git a/challenge-123/ulrich-rieke/cpp/ch-1.cpp b/challenge-123/ulrich-rieke/cpp/ch-1.cpp new file mode 100644 index 0000000000..af79006582 --- /dev/null +++ b/challenge-123/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,35 @@ +#include <iostream> +#include <cmath> +#include <set> +#include <algorithm> +#include <cstdlib> + +bool isUgly( int n , const std::set<int> firstPrimes ) { + std::set<int> divisors ; + int current = 2 ; + while ( n > 1 ) { + if ( n % current == 0 ) { + divisors.insert( current ) ; + n /= current ; + } + else + current++ ; + } + return std::all_of( divisors.begin( ) , divisors.end( ) , + [&firstPrimes]( int i ) { return firstPrimes.find( i ) != + firstPrimes.end( ) ; } ) ; +} + +int main( int argc , char * argv[ ] ) { + int n = std::atoi( argv[ 1 ] ) ; + std::set<int> somePrimes { 2 , 3 , 5 } ; + int current = 1 ; + int sumUglies = 1 ; + while ( sumUglies < n ) { + current++ ; + if ( isUgly( current , somePrimes ) ) + sumUglies++ ; + } + std::cout << current << std::endl ; + return 0 ; +} diff --git a/challenge-123/ulrich-rieke/cpp/ch-2.cpp b/challenge-123/ulrich-rieke/cpp/ch-2.cpp new file mode 100644 index 0000000000..c3ab8c3c04 --- /dev/null +++ b/challenge-123/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,45 @@ +#include <string> +#include <iostream> +#include <utility> +#include <vector> +#include <cmath> +#include <set> +using Point = std::pair<int, int> ; + +double computeDistance( const Point & p1 , const Point & p2 ) { + return std::sqrt( std::pow( static_cast<double>(p2.first - p1.first) , + 2.0) + std::pow( static_cast<double>(p2.second - p1.second) , + 2.0 ) ) ; +} + +int main( ) { + std::vector<Point> points ; + int num = 0 ; + for ( int i = 0 ; i < 4 ; i++ ) { + Point p { 0 , 0 } ; + std::cout << "For " << i + 1 << ". point, enter x: \n" ; + std::cin >> num ; + p.first = num ; + std::cout << " and y: \n" ; + std::cin >> num ; + p.second = num ; + points.push_back( p ) ; + } + std::set<double> distances ; + for ( int i = 0 ; i < 3 ; i++ ) { + distances.insert( computeDistance( points[ i ] , points[ i++ ] )) ; + } + distances.insert( computeDistance( points[ 0 ] , points[ 3 ] )) ; + std::set<double> diagonals ; + diagonals.insert( computeDistance( points[ 0 ] , points[ 2 ] )) ; + diagonals.insert( computeDistance( points[ 1 ] , points[ 3 ] )) ; + if ( distances.size( ) == 1 && diagonals.size( ) == 1 ) { + std::cout << std::endl ; + std::cout << 1 << std::endl ; + } + else { + std::cout << std::endl ; + std::cout << 0 << std::endl ; + } + return 0 ; +} diff --git a/challenge-123/ulrich-rieke/haskell/ch-2.hs b/challenge-123/ulrich-rieke/haskell/ch-2.hs new file mode 100644 index 0000000000..089186becf --- /dev/null +++ b/challenge-123/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,26 @@ +module Challenge123_2 + where +import GHC.Float +import qualified Data.Set as S +import Data.List ( (!!) ) + +findDistance :: (Int, Int) -> (Int , Int) -> Double +findDistance p1 p2 = float2Double $ sqrt +((fromIntegral ((fst p2 - fst p1) ^ 2 )) + (fromIntegral +((snd p2 - snd p1 ) ^ 2))) + +allDistances :: [(Int , Int)] -> [Double] +allDistances points = map (\i -> findDistance ( points !! i ) +( points !! (i + 1) ) ) [0 .. 2] ++ [findDistance ( points !! 0 ) + (points !! 3 )] + +allDiagonals :: [(Int , Int)] -> [Double] +allDiagonals points = [ findDistance ( points !! 0 ) ( points !! 2 ) , +findDistance ( points !! 1 ) ( points !! 3 ) ] + +solution :: [(Int , Int)] -> Int +solution points = if myCondition then 1 else 0 +where + myCondition :: Bool + myCondition = ((length $ S.toList $ S.fromList $ allDistances points) == 1) + && (( length $ S.toList $ S.fromList $ allDiagonals points ) == 1) diff --git a/challenge-123/ulrich-rieke/perl/ch-1.pl b/challenge-123/ulrich-rieke/perl/ch-1.pl new file mode 100644 index 0000000000..6b23273aed --- /dev/null +++ b/challenge-123/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,37 @@ +#!/usr/bin/perl ; +use strict ; +use warnings ; +use feature 'say' ; + +#we keep dividing the number passed as argument until it is equal to 1 +#we start with the divisor 2 +#in the end we check if only 2 , 3 or 5 occurred as divisors +#after joining the divisors into a string we apply a regular expression +#to it +sub isUgly { + my $num = shift ; + my %divisors ; + my $current = 2 ; + while ( $num > 1 ) { + if ( ($num % $current) == 0 ) { + $divisors{$current}++ ; + $num /= $current ; + } + else { + $current++ ; + } + } + my $str = join( '' , sort { $a <=> $b } keys %divisors ) ; + return ( $str =~ /\b[235]+\b/ ) ; +} + +my $n = $ARGV[ 0 ] ; +my $current = 1 ; #1 assumed to be an ugly number +my $sumUglies = 1 ;#see above +while ( $sumUglies < $n ) { + $current++ ; + if (isUgly ( $current ) ) { + $sumUglies++ ; + } +} +say $current ; diff --git a/challenge-123/ulrich-rieke/perl/ch-2.pl b/challenge-123/ulrich-rieke/perl/ch-2.pl new file mode 100644 index 0000000000..b0d1c86ef5 --- /dev/null +++ b/challenge-123/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,46 @@ +#!/usr/bin/perl ; +use strict ; +use warnings ; +use feature 'say' ; + +#distance of 2 points +sub computeDistance { + my $point1 = shift ; + my $point2 = shift ; + my @coordinates1 = @$point1 ; + my @coordinates2 = @$point2 ; + return sqrt( (($coordinates2[0] - $coordinates1[0]) ** 2 ) + + ((($coordinates2[1] - $coordinates1[1] ) ** 2) )) ; +} + +my @points ; +say "Enter point coordinates ( numbers , separated by blanks )!" ; +for my $i ( 1 .. 4 ) { + say "Enter $i. point!" ; + my $line = <STDIN> ; + chomp $line ; + my @point = split( /\s+/ , $line ) ; + push @points , \@point ; +} +my %distances ; +#it is required that all neighbouring points have the same distance +for my $i (0 .. 2) { + my $distance = computeDistance( $points[ $i ] , $points[ $i + 1 ] ) ; + $distances{ $distance }++ ; +} +my $distance = computeDistance( $points[0] , $points[ 3 ] ) ; +$distances{ $distance }++ ; +#it is required that the diagonals have the same length +my %diagonals ; +$distance = computeDistance( $points[ 0 ] , $points[ 2 ] ) ; +$diagonals{ $distance }++ ; +$distance = computeDistance( $points[ 1 ] , $points[ 3 ] ) ; +$diagonals{ $distance }++ ; +#there should be only one length in the %distances and %diagonals hashes +if ( (scalar( keys %distances ) == 1 ) && ( scalar( keys %diagonals ) + == 1 )) { + say 1 ; +} +else { + say 0 ; +} diff --git a/challenge-123/ulrich-rieke/raku/ch-1.raku b/challenge-123/ulrich-rieke/raku/ch-1.raku new file mode 100644 index 0000000000..539435eaca --- /dev/null +++ b/challenge-123/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,31 @@ +use v6 ; + +#find all divisors starting with 2, keep dividing until the number +#passed as argument is equal to 1 +sub isUgly( Int $N is copy --> Bool ) { + my @divisors ; + my $current = 2 ; + while ( $N > 1 ) { + if ( $N %% $current ) { + @divisors.push( $current ) ; + $N div= $current ; + } + else { + $current++ ; + } + } + return @divisors.Set (<=) (2 , 3 , 5 ).Set ; +} + +sub MAIN( Int $n ) { + my $current = 1 ; + my $sumUglies = 1 ;#we consider 1 an ugly number , so we start with 1 +#ugly number + while ( $sumUglies < $n ) { + $current++ ; + if ( isUgly( $current ) ) { + $sumUglies++ ; + } + } + say $current ; +} diff --git a/challenge-123/ulrich-rieke/raku/ch-2.raku b/challenge-123/ulrich-rieke/raku/ch-2.raku new file mode 100644 index 0000000000..aefc150fe3 --- /dev/null +++ b/challenge-123/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,31 @@ +use v6 ; + +sub computeDistance( @point1 , @point2 --> Num ) { + return sqrt ( (( @point2[0] - @point1[ 0 ]) ** 2) + (( @point2[1] - + @point1[1] ) ** 2) ) ; +} + +my @points ; +say "Enter the coordinates of four points( blank between x and y! ) ! " ; +for (1 .. 4 ) -> $i { + say "Enter $i. point:" ; + my $line = $*IN.get ; + my @point = $line.split( /\s+/ ) ; + @points.push( @point ) ; +} +#we know it is a square if the differences of all pairwise neighbours are +#the same and if the diagonals have the same length +my @distances ; +for (1 .. 3 ) -> $i { + @distances.push( computeDistance( @points[ $i - 1 ] , @points[ $i ] ) ) ; +} +@distances.push( computeDistance( @points[ 3 ] , @points[ 0 ] )) ; +my @diagonals ; +@diagonals.push( computeDistance( @points[ 0 ] , @points[ 2 ] ) ) ; +@diagonals.push( computeDistance( @points[ 1 ] , @points[ 3 ] ) ) ; +if ( @distances.unique.elems == 1 && @diagonals.unique.elems == 1 ) { + say 1 ; +} +else { + say 0 ; +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index a460e37505..8cc79693d4 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,11 +1,29 @@ { - "subtitle" : { - "text" : "[Champions: 11] Last updated at 2021-07-27 22:56:31 GMT" + "title" : { + "text" : "The Weekly Challenge - 123" }, - "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/>" + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "legend" : { + "enabled" : 0 + }, + "xAxis" : { + "type" : "category" + }, + "chart" : { + "type" : "column" + }, + "plotOptions" : { + "series" : { + "dataLabels" : { + "format" : "{point.y}", + "enabled" : 1 + }, + "borderWidth" : 0 + } }, "drilldown" : { "series" : [ @@ -20,6 +38,7 @@ ] }, { + "id" : "Dave Jacoby", "data" : [ [ "Perl", @@ -30,11 +49,10 @@ 1 ] ], - "id" : "Dave Jacoby", "name" : "Dave Jacoby" }, { - "id" : "James Smith", + "name" : "James Smith", "data" : [ [ "Perl", @@ -45,7 +63,7 @@ 1 ] ], - "name" : "James Smith" + "id" : "James Smith" }, { "name" : "Lucas Ransan", @@ -58,24 +76,24 @@ ] }, { - "name" : "Mark Anderson", "data" : [ [ "Raku", 2 ] ], - "id" : "Mark Anderson" + "id" : "Mark Anderson", + "name" : "Mark Anderson" }, { - "name" : "Markus Holzer", + "id" : "Markus Holzer", "data" : [ [ "Raku", 2 ] ], - "id" : "Markus Holzer" + "name" : "Markus Holzer" }, { "id" : "Niels van Dijke", @@ -102,7 +120,7 @@ "name" : "Roger Bell_West" }, { - "name" : "Simon Green", + "id" : "Simon Green", "data" : [ [ "Perl", @@ -113,16 +131,16 @@ 1 ] ], - "id" : "Simon Green" + "name" : "Simon Green" }, { - "id" : "Simon Proctor", "data" : [ [ "Raku", 2 ] ], + "id" : "Simon Proctor", "name" : "Simon Proctor" }, { @@ -138,54 +156,56 @@ ] ], "id" : "Stuart Little" + }, + { + "name" : "Ulrich Rieke", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "id" : "Ulrich Rieke" } ] }, - "chart" : { - "type" : "column" - }, - "title" : { - "text" : "The Weekly Challenge - 123" - }, - "plotOptions" : { - "series" : { - "borderWidth" : 0, - "dataLabels" : { - "format" : "{point.y}", - "enabled" : 1 - } - } - }, - "legend" : { - "enabled" : 0 + "tooltip" : { + "followPointer" : 1, + "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>", + "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>" }, "series" : [ { + "name" : "The Weekly Challenge - 123", "data" : [ { - "y" : 2, "name" : "Cheok-Yin Fung", - "drilldown" : "Cheok-Yin Fung" + "drilldown" : "Cheok-Yin Fung", + "y" : 2 }, { + "y" : 3, "name" : "Dave Jacoby", - "drilldown" : "Dave Jacoby", - "y" : 3 + "drilldown" : "Dave Jacoby" }, { - "name" : "James Smith", "drilldown" : "James Smith", + "name" : "James Smith", "y" : 3 }, { - "y" : 2, + "drilldown" : "Lucas Ransan", "name" : "Lucas Ransan", - "drilldown" : "Lucas Ransan" + "y" : 2 }, { - "drilldown" : "Mark Anderson", + "y" : 2, "name" : "Mark Anderson", - "y" : 2 + "drilldown" : "Mark Anderson" }, { "y" : 2, @@ -203,31 +223,30 @@ "name" : "Roger Bell_West" }, { - "y" : 3, + "name" : "Simon Green", "drilldown" : "Simon Green", - "name" : "Simon Green" + "y" : 3 }, { - "drilldown" : "Simon Proctor", "name" : "Simon Proctor", + "drilldown" : "Simon Proctor", "y" : 2 }, { - "drilldown" : "Stuart Little", + "y" : 4, "name" : "Stuart Little", - "y" : 4 + "drilldown" : "Stuart Little" + }, + { + "y" : 4, + "name" : "Ulrich Rieke", + "drilldown" : "Ulrich Rieke" } ], - "colorByPoint" : 1, - "name" : "The Weekly Challenge - 123" + "colorByPoint" : 1 } ], - "yAxis" : { - "title" : { - "text" : "Total Solutions" - } - }, - "xAxis" : { - "type" : "category" + "subtitle" : { + "text" : "[Champions: 12] Last updated at 2021-07-27 23:14:25 GMT" } } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 2846561510..221783e35a 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,30 +1,21 @@ { - "chart" : { - "type" : "column" - }, "tooltip" : { "pointFormat" : "<b>{point.y:.0f}</b>" }, - "subtitle" : { - "text" : "Last updated at 2021-07-27 22:56:31 GMT" - }, - "xAxis" : { - "type" : "category", - "labels" : { - "style" : { - "fontSize" : "13px", - "fontFamily" : "Verdana, sans-serif" - } - } - }, - "yAxis" : { - "title" : { - "text" : null - }, - "min" : 0 - }, "series" : [ { + "dataLabels" : { + "rotation" : -90, + "align" : "right", + "y" : 10, + "format" : "{point.y:.0f}", + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + }, + "enabled" : "true", + "color" : "#FFFFFF" + }, "name" : "Contributions", "data" : [ [ @@ -33,31 +24,40 @@ ], [ "Perl", - 5871 + 5873 ], [ "Raku", - 3668 + 3670 ] - ], - "dataLabels" : { - "color" : "#FFFFFF", - "enabled" : "true", - "y" : 10, - "format" : "{point.y:.0f}", - "rotation" : -90, - "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" - }, - "align" : "right" - } + ] } ], - "legend" : { - "enabled" : "false" + "subtitle" : { + "text" : "Last updated at 2021-07-27 23:14:25 GMT" }, "title" : { "text" : "The Weekly Challenge Contributions [2019 - 2021]" + }, + "yAxis" : { + "min" : 0, + "title" : { + "text" : null + } + }, + "legend" : { + "enabled" : "false" + }, + "xAxis" : { + "type" : "category", + "labels" : { + "style" : { + "fontSize" : "13px", + "fontFamily" : "Verdana, sans-serif" + } + } + }, + "chart" : { + "type" : "column" } } diff --git a/stats/pwc-language-breakdown.json b/stats/pwc-language-breakdown.json index 64fefe7f72..b667fc9ae1 100644 --- a/stats/pwc-language-breakdown.json +++ b/stats/pwc-language-breakdown.json @@ -1,660 +1,8 @@ { - "legend" : { - "enabled" : "false" - }, - "plotOptions" : { - "series" : { - "dataLabels" : { - "enabled" : 1, - "format" : "{point.y}" - }, - "borderWidth" : 0 - } - }, - "title" : { - "text" : "The Weekly Challenge Language" - }, - "yAxis" : { - "title" : { - "text" : "Total Solutions" - } - }, - "xAxis" : { - "type" : "category" - }, - "series" : [ - { - "colorByPoint" : "true", - "data" : [ - { - "name" : "#001", - "drilldown" : "001", - "y" : 161 - }, - { - "y" : 125, - "drilldown" : "002", - "name" : "#002" - }, - { - "y" : 81, - "drilldown" : "003", - "name" : "#003" - }, - { - "y" : 99, - "name" : "#004", - "drilldown" : "004" - }, - { - "drilldown" : "005", - "name" : "#005", - "y" : 78 - }, - { - "y" : 58, - "name" : "#006", - "drilldown" : "006" - }, - { - "y" : 64, - "drilldown" : "007", - "name" : "#007" - }, - { - "drilldown" : "008", - "name" : "#008", - "y" : 78 - }, - { - "y" : 76, - "drilldown" : "009", - "name" : "#009" - }, - { - "y" : 65, - "drilldown" : "010", - "name" : "#010" - }, - { - "y" : 85, - "drilldown" : "011", - "name" : "#011" - }, - { - "y" : 89, - "name" : "#012", - "drilldown" : "012" - }, - { - "y" : 85, - "name" : "#013", - "drilldown" : "013" - }, - { - "y" : 101, - "drilldown" : "014", - "name" : "#014" - }, - { - "name" : "#015", - "drilldown" : "015", - "y" : 99 - }, - { - "name" : "#016", - "drilldown" : "016", - "y" : 71 - }, - { - "name" : "#017", - "drilldown" : "017", - "y" : 84 - }, - { - "name" : "#018", - "drilldown" : "018", - "y" : 81 - }, - { - "drilldown" : "019", - "name" : "#019", - "y" : 103 - }, - { - "y" : 101, - "drilldown" : "020", - "name" : "#020" - }, - { - "name" : "#021", - "drilldown" : "021", - "y" : 72 - }, - { - "y" : 68, - "name" : "#022", - "drilldown" : "022" - }, - { - "y" : 97, - "drilldown" : "023", - "name" : "#023" - }, - { - "name" : "#024", - "drilldown" : "024", - "y" : 74 - }, - { - "drilldown" : "025", - "name" : "#025", - "y" : 59 - }, - { - "drilldown" : "026", - "name" : "#026", - "y" : 74 - }, - { - "name" : "#027", - "drilldown" : "027", - "y" : 60 - }, - { - "y" : 80, - "drilldown" : "028", - "name" : "#028" - }, - { - "y" : 79, - "drilldown" : "029", - "name" : "#029" - }, - { - "y" : 117, - "name" : "#030", - "drilldown" : "030" - }, - { - "drilldown" : "031", - "name" : "#031", - "y" : 89 - }, - { - "name" : "#032", - "drilldown" : "032", - "y" : 94 - }, - { - "y" : 110, - "name" : "#033", - "drilldown" : "033" - }, - { - "y" : 64, - "drilldown" : "034", - "name" : "#034" - }, - { - "y" : 64, - "drilldown" : "035", - "name" : "#035" - }, - { - "name" : "#036", - "drilldown" : "036", - "y" : 68 - }, - { - "y" : 67, - "drilldown" : "037", - "name" : "#037" - }, - { - "y" : 68, - "name" : "#038", - "drilldown" : "038" - }, - { - "y" : 62, - "drilldown" : "039", - "name" : "#039" - }, - { - "y" : 73, - "drilldown" : "040", - "name" : "#040" - }, - { - "y" : 76, - "drilldown" : "041", - "name" : "#041" - }, - { - "drilldown" : "042", - "name" : "#042", - "y" : 92 - }, - { - "drilldown" : "043", - "name" : "#043", - "y" : 68 - }, - { - "y" : 85, - "name" : "#044", - "drilldown" : "044" - }, - { - "y" : 96, - "name" : "#045", - "drilldown" : "045" - }, - { - "drilldown" : "046", - "name" : "#046", - "y" : 87 - }, - { - "y" : 84, - "name" : "#047", - "drilldown" : "047" - }, - { - "name" : "#048", - "drilldown" : "048", - "y" : 108 - }, - { - "y" : 89, - "name" : "#049", - "drilldown" : "049" - }, - { - "name" : "#050", - "drilldown" : "050", - "y" : 98 - }, - { - "y" : 89, - "drilldown" : "051", - "name" : "#051" - }, - { - "drilldown" : "052", - "name" : "#052", - "y" : 91 - }, - { - "y" : 101, - "name" : "#053", - "drilldown" : "053" - }, - { - "y" : 103, - "name" : "#054", - "drilldown" : "054" - }, - { - "y" : 88, - "drilldown" : "055", - "name" : "#055" - }, - { - "y" : 95, - "name" : "#056", - "drilldown" : "056" - }, - { - "drilldown" : "057", - "name" : "#057", - "y" : 80 - }, - { - "y" : 69, - "drilldown" : "058", - "name" : "#058" - }, - { - "name" : "#059", - "drilldown" : "059", - "y" : 89 - }, - { - "drilldown" : "060", - "name" : "#060", - "y" : 85 - }, - { - "y" : 81, - "drilldown" : "061", - "name" : "#061" - }, - { - "y" : 58, - "name" : "#062", - "drilldown" : "062" - }, - { - "y" : 89, - "drilldown" : "063", - "name" : "#063" - }, - { - "y" : 80, - "name" : "#064", - "drilldown" : "064" - }, - { - "y" : 73, - "name" : "#065", - "drilldown" : "065" - }, - { - "y" : 84, - "drilldown" : "066", - "name" : "#066" - }, - { - "drilldown" : "067", - "name" : "#067", - "y" : 90 - }, - { - "name" : "#068", - "drilldown" : "068", - "y" : 75 - }, - { - "drilldown" : "069", - "name" : "#069", - "y" : 83 - }, - { - "name" : "#070", - "drilldown" : "070", - "y" : 93 - }, - { - "drilldown" : "071", - "name" : "#071", - "y" : 78 - }, - { - "y" : 112, - "drilldown" : "072", - "name" : "#072" - }, - { - "y" : 110, - "drilldown" : "073", |
