diff options
26 files changed, 3276 insertions, 2829 deletions
diff --git a/challenge-249/ulrich-rieke/cpp/ch-1.cpp b/challenge-249/ulrich-rieke/cpp/ch-1.cpp new file mode 100755 index 0000000000..49d2e3d9e3 --- /dev/null +++ b/challenge-249/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,55 @@ +#include <vector>
+#include <string>
+#include <iostream>
+#include <algorithm>
+#include <utility>
+#include <map>
+
+std::vector<std::string> split( const std::string & startline ,
+ const std::string & sep ) {
+ std::vector<std::string> separated ;
+ std::string::size_type start { 0 } ;
+ std::string::size_type pos ;
+ do {
+ pos = startline.find_first_of( sep , start ) ;
+ separated.push_back( startline.substr(start , pos - start )) ;
+ start = pos + 1 ;
+ } while ( pos != std::string::npos ) ;
+ return separated ;
+}
+
+int main( ) {
+ std::cout << "Enter an even number of integers, separated by blanks!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ std::vector<int> numbers ;
+ std::vector<std::string> numberstrings { split( line , " " ) } ;
+ for ( auto s : numberstrings )
+ numbers.push_back( std::stoi( s ) ) ;
+ std::map<int , int> frequencies ;
+ for ( auto it = numbers.begin( ) ; it != numbers.end( ) ; ++it ) {
+ frequencies[*it]++ ;
+ }
+ if ( std::all_of( frequencies.begin( ) , frequencies.end( ) , []( const
+ auto & p ) { return p.second % 2 == 0 ; } ) ) {
+ std::sort( numbers.begin( ) , numbers.end( ) ) ;
+ std::vector<std::pair<int , int>> result ;
+ int pos = 0 ;
+ int len = numbers.size( ) ;
+ while ( pos <= len - 2 ) {
+ std::pair<int, int> current { std::make_pair( numbers[ pos ] ,
+ numbers[ pos + 1 ] ) } ;
+ result.push_back( current ) ;
+ pos += 2 ;
+ }
+ std::cout << "(" ;
+ for ( auto p : result ) {
+ std::cout << "[" << p.first << ',' << p.second << "]" ;
+ }
+ std::cout << ")\n" ;
+ }
+ else {
+ std::cout << "()\n" ;
+ }
+ return 0 ;
+}
diff --git a/challenge-249/ulrich-rieke/cpp/ch-2.cpp b/challenge-249/ulrich-rieke/cpp/ch-2.cpp new file mode 100755 index 0000000000..8f52f5dcfb --- /dev/null +++ b/challenge-249/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,63 @@ +#include <string>
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <numeric>
+
+bool isValid( const std::vector<int> & permu , const std::vector<int> & the_is ,
+ const std::vector<int> & the_ds ) {
+ for ( int i = 0 ; i < the_is.size( ) ; i++ ) {
+ int pos = the_is[ i ] ;
+ if ( permu[pos] >= permu[ pos + 1] ) {
+ return false ;
+ }
+ }
+ for ( int i = 0 ; i < the_ds.size( ) ; i++ ) {
+ int pos = the_ds[ i ] ;
+ if ( permu[pos] <= permu[ pos + 1 ] ) {
+ return false ;
+ }
+ }
+ return true ;
+}
+
+int main( ) {
+ std::cout << "Please enter a string consisting of capital I and D only!\n" ;
+ std::string line ;
+ std::cin >> line ;
+ std::vector<int> ipositions ;
+ std::vector<int> dpositions ;
+ for ( int i = 0 ; i < line.length( ) ; i++ ) {
+ if ( line.substr( i , 1 ) == "I" )
+ ipositions.push_back( i ) ;
+ else
+ dpositions.push_back( i ) ;
+ }
+ int len = line.length( ) ;
+ std::vector<int> numbers ( len + 1 ) ;
+ std::iota( numbers.begin( ) , numbers.end( ) , 0 ) ;
+ std::vector<int> result ;
+ if ( dpositions.empty( ) ) {
+ result = numbers ;
+ }
+ else {
+ if ( ipositions.empty( ) ) {
+ result = numbers ;
+ std::reverse( result.begin( ) , result.end( ) ) ;
+ }
+ else {
+ while ( std::next_permutation( numbers.begin( ) , numbers.end( ) ) ) {
+ if ( isValid( numbers, ipositions, dpositions ) ) {
+ result = numbers ;
+ break ;
+ }
+ }
+ }
+ }
+ std::cout << "( " ;
+ for ( int i : result ) {
+ std::cout << i << " " ;
+ }
+ std::cout << " )\n" ;
+ return 0 ;
+}
diff --git a/challenge-249/ulrich-rieke/haskell/ch-1.hs b/challenge-249/ulrich-rieke/haskell/ch-1.hs new file mode 100755 index 0000000000..3faf18cde1 --- /dev/null +++ b/challenge-249/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,30 @@ +module Challenge249
+ where
+import Data.List ( sort )
+import qualified Data.Map.Strict as M
+import qualified Data.Set as S
+import Data.List.Split ( chunksOf )
+
+count :: Eq a => a -> [a] -> Int
+count _ [] = 0
+count d ( x:xs )
+ |d == x = 1 + count d xs
+ |otherwise = count d xs
+
+findMap :: String -> M.Map Int Int
+findMap s =
+ let numbers = map read $ words s
+ freqSet = map (\i -> (i , count i numbers )) $ S.toList $ S.fromList numbers
+ in M.fromList freqSet
+
+solution :: M.Map Int Int -> [Int] -> [[Int]]
+solution theMap numbers = if all even $ M.elems theMap then chunksOf 2 sorted else []
+ where
+ sorted = sort numbers
+
+main :: IO ( )
+main = do
+ putStrLn "Enter an even number of integers, separated by blanks!"
+ numberstrings <- getLine
+ let numbers = map read $ words numberstrings
+ print $ solution (findMap numberstrings) numbers
diff --git a/challenge-249/ulrich-rieke/haskell/ch-2.hs b/challenge-249/ulrich-rieke/haskell/ch-2.hs new file mode 100755 index 0000000000..a6a19e3eac --- /dev/null +++ b/challenge-249/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,22 @@ +module Challenge249_2
+ where
+import Data.List ( (!!) , permutations , findIndices , findIndex )
+
+solution :: String -> [Int]
+solution s =
+ let allIs = findIndices (\c -> c == 'I') s
+ allDs = findIndices (\c -> c == 'D') s
+ allPermus = permutations [0..length s]
+ in case findIndex (\perm -> myCondition perm allIs allDs ) allPermus of
+ Just pos -> allPermus !! pos
+ Nothing -> []
+
+myCondition :: [Int] -> [Int] -> [Int] -> Bool
+myCondition permu theIs theDs = (all (\i -> permu !! i < permu !! ( i + 1 ) )
+ theIs) && ( all (\n -> permu !! n > permu !! ( n + 1 )) theDs )
+
+main :: IO ( )
+main = do
+ putStrLn "Enter a string consisting of capital I's and D's only!"
+ string <- getLine
+ print $ solution string
diff --git a/challenge-249/ulrich-rieke/perl/ch-1.pl b/challenge-249/ulrich-rieke/perl/ch-1.pl new file mode 100755 index 0000000000..eef0d00241 --- /dev/null +++ b/challenge-249/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,33 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( all ) ;
+
+say "Enter an even number of integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my %frequencies ;
+my @numbers = split( /\s+/ , $line ) ;
+for my $num ( @numbers ) {
+ $frequencies{ $num }++ ;
+}
+if ( all { $_ % 2 == 0 } values %frequencies ) {
+ my @sorted = sort { $a <=> $b } @numbers ;
+ my $len = scalar( @numbers ) ;
+ my @result ;
+ my $pos = 0 ;
+ while ( $pos <= $len - 2 ) {
+ my $pair = [$sorted[ $pos ] , $sorted[ $pos + 1 ]] ;
+ push @result, $pair ;
+ $pos += 2 ;
+ }
+ print "(" ;
+ for my $pair( @result ) {
+ print ( "(" . join( ',' , @$pair ) . ")" ) ;
+ }
+ say ")" ;
+}
+else {
+ say "()" ;
+}
diff --git a/challenge-249/ulrich-rieke/perl/ch-2.pl b/challenge-249/ulrich-rieke/perl/ch-2.pl new file mode 100755 index 0000000000..b38a3f48a4 --- /dev/null +++ b/challenge-249/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,45 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use Algorithm::Combinatorics qw ( permutations ) ;
+
+sub isValid {
+ my $permutation = shift ;
+ my $ipositions = shift ;
+ my $dpositions = shift ;
+ for my $pos ( @$ipositions ) {
+ if ( $permutation->[$pos] >= $permutation->[ $pos + 1 ] ) {
+ return 0 ;
+ }
+ }
+ for my $pos ( @$dpositions ) {
+ if ( $permutation->[$pos] <= $permutation->[ $pos + 1 ]) {
+ return 0 ;
+ }
+ }
+ return 1 ;
+}
+
+say "Enter a string consisting of capital I and D only!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @is ;
+my @ds ;
+my $len = length $line ;
+for my $pos( 0..$len - 1 ) {
+ if ( substr( $line, $pos , 1 ) eq "I" ) {
+ push @is , $pos ;
+ }
+ else {
+ push @ds, $pos ;
+ }
+}
+my @positions = (0..$len) ;
+my $iter = permutations( \@positions ) ;
+while ( my $c = $iter->next ) {
+ if ( isValid( $c , \@is , \@ds ) ) {
+ say ( "(" . join( ',' , @$c ) . ")" ) ;
+ last ;
+ }
+}
diff --git a/challenge-249/ulrich-rieke/raku/ch-1.raku b/challenge-249/ulrich-rieke/raku/ch-1.raku new file mode 100755 index 0000000000..5022f89788 --- /dev/null +++ b/challenge-249/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,34 @@ +use v6 ;
+
+say "Enter an even number of integers, separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+while (not @numbers.elems %% 2 ) {
+ say "Enter an even number of integers!" ;
+ $line = $*IN.get ;
+ @numbers = $line.words.map( {.Int} ) ;
+}
+my %frequencies ;
+for @numbers -> $num {
+ %frequencies{ $num }++ ;
+}
+if (%frequencies.values.grep( { $_ %% 2 } ).elems == %frequencies.values.elems) {
+ my @sorted = @numbers.sort( { $^a <=> $^b } ) ;
+ my $len = @sorted.elems ;
+ my $pos = 0 ;
+ my @result ;
+ while ( $pos <= $len - 2 ) {
+ my $pair = [@sorted[ $pos ] , @sorted[ $pos + 1 ]] ;
+ @result.push( $pair ) ;
+ $pos += 2 ;
+ }
+ print "(" ;
+ for @result -> $p {
+ print "( $p[0] , $p[1] )" ;
+ }
+ say ")" ;
+}
+else {
+ say "()" ;
+}
+
diff --git a/challenge-249/ulrich-rieke/raku/ch-2.raku b/challenge-249/ulrich-rieke/raku/ch-2.raku new file mode 100755 index 0000000000..1000e75ebe --- /dev/null +++ b/challenge-249/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,36 @@ +use v6 ;
+
+sub is_valid( $permu , @theIs , @theDs ) {
+ for @theIs -> $pos {
+ if ( $permu[$pos] >= $permu[ $pos + 1 ] ) {
+ return False ;
+ }
+ }
+ for @theDs -> $pos {
+ if ( $permu[ $pos ] <= $permu[ $pos + 1 ] ) {
+ return False ;
+ }
+ }
+ return True ;
+}
+
+say "Enter a string consisting of capital D and I only!" ;
+my $line = $*IN.get ;
+my @is ;
+my @ds ;
+my $len = $line.chars ;
+for (0..$len - 1 ) -> $pos {
+ if ( $line.substr( $pos , 1 ) eq "I" ) {
+ @is.push( $pos ) ;
+ }
+ else {
+ @ds.push( $pos ) ;
+ }
+}
+for (0..$len).permutations -> $permu {
+ if ( is_valid( $permu , @is , @ds ) ) {
+ say ( "(" ~ join( ',' , $permu ) ~ ")" ) ;
+ last ;
+ }
+}
+
diff --git a/challenge-249/ulrich-rieke/rust/ch-1.rs b/challenge-249/ulrich-rieke/rust/ch-1.rs new file mode 100755 index 0000000000..b0a7bded81 --- /dev/null +++ b/challenge-249/ulrich-rieke/rust/ch-1.rs @@ -0,0 +1,30 @@ +use std::io ; +use std::collections::HashMap ; + +fn main() { + println!("Enter an even number of integers, separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let entered_line : &str = &*inline ; + let mut numbers : Vec<i32> = entered_line.split_whitespace( ).map ( | s | + s.trim( ).parse::<i32>( ).unwrap( ) ).collect( ) ; + let mut frequencies : HashMap<i32, u32> = HashMap::new( ) ; + for i in & numbers { + frequencies.entry( *i ).and_modify( |e| *e += 1 ).or_insert( 1 ) ; + } + if frequencies.values( ).all( | n | n % 2 == 0 ) { + numbers.sort( ) ; + let mut result : Vec<(i32 , i32)> = Vec::new( ) ; + let len = numbers.len( ) ; + let mut pos : usize = 0 ; + while pos <= len - 2 { + let pair : (&i32 , &i32) = ( &numbers[ pos ] , &numbers[ pos + 1 ] ) ; + result.push( (*pair.0 , *pair.1 ) ) ; + pos += 2 ; + } + println!("{:?}" , result ) ; + } + else { + println!("()") ; + } +} diff --git a/challenge-249/ulrich-rieke/rust/ch-2.rs b/challenge-249/ulrich-rieke/rust/ch-2.rs new file mode 100755 index 0000000000..df414008a0 --- /dev/null +++ b/challenge-249/ulrich-rieke/rust/ch-2.rs @@ -0,0 +1,42 @@ +use itertools::Itertools ; +use std::io ; + +fn is_valid( permu : &Vec<usize> , i_positions : &Vec<usize> , + d_positions : &Vec<usize> ) -> bool { + for n in i_positions { + if permu[*n] >= permu[ *n + 1 ] { + return false ; + } + } + for d in d_positions { + if permu[*d] <= permu[ *d + 1 ] { + return false ; + } + } + true +} + +fn main() { + println!("Enter a string consisting of capital I and D only!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let entered_line : &str = &*inline ; + let trimmed = entered_line.trim( ) ; + let len = trimmed.chars( ).count( ) ; + let mut the_is : Vec<usize> = Vec::new( ) ; + let mut the_ds : Vec<usize> = Vec::new( ) ; + trimmed.chars( ).enumerate( ).for_each( | x | { + if x.1 == 'I' { + the_is.push( x.0 ) ; + } + else { + the_ds.push( x.0 ) ; + } + } ) ; + for v in (0..=len).permutations( len + 1 ) { + if is_valid( &v , &the_is , &the_ds ) { + println!("{:?}" , v ) ; + break ; + } + } +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index cbae757799..a9683c70d6 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -2,31 +2,33 @@ "chart" : { "type" : "column" }, - "title" : { - "text" : "The Weekly Challenge - 249" - }, "series" : [ { "data" : [ { + "drilldown" : "Arne Sommer", "y" : 3, - "name" : "Arne Sommer", - "drilldown" : "Arne Sommer" + "name" : "Arne Sommer" }, { - "name" : "David Ferrone", - "drilldown" : "David Ferrone", - "y" : 2 + "name" : "Dave Jacoby", + "y" : 3, + "drilldown" : "Dave Jacoby" }, { + "name" : "David Ferrone", "y" : 2, + "drilldown" : "David Ferrone" + }, + { "name" : "E. Choroba", - "drilldown" : "E. Choroba" + "drilldown" : "E. Choroba", + "y" : 2 }, { - "drilldown" : "Mark Anderson", "name" : "Mark Anderson", - "y" : 2 + "y" : 2, + "drilldown" : "Mark Anderson" }, { "name" : "Packy Anderson", @@ -35,37 +37,58 @@ }, { "y" : 3, - "name" : "Peter Campbell Smith", - "drilldown" : "Peter Campbell Smith" + "drilldown" : "Peter Campbell Smith", + "name" : "Peter Campbell Smith" }, { - "y" : 2, "name" : "Peter Meszaros", - "drilldown" : "Peter Meszaros" + "drilldown" : "Peter Meszaros", + "y" : 2 }, { - "name" : "Roger Bell_West", "drilldown" : "Roger Bell_West", - "y" : 4 + "y" : 4, + "name" : "Roger Bell_West" + }, + { + "name" : "Stephen G. Lynn", + "drilldown" : "Stephen G. Lynn", + "y" : 3 }, { - "name" : "Thomas Kohler", + "y" : 4, "drilldown" : "Thomas Kohler", + "name" : "Thomas Kohler" + }, + { + "name" : "Ulrich Rieke", + "drilldown" : "Ulrich Rieke", "y" : 4 }, { - "drilldown" : "W. Luis Mochan", "name" : "W. Luis Mochan", + "drilldown" : "W. Luis Mochan", "y" : 3 } ], - "colorByPoint" : 1, - "name" : "The Weekly Challenge - 249" + "name" : "The Weekly Challenge - 249", + "colorByPoint" : 1 } ], + "legend" : { + "enabled" : 0 + }, "xAxis" : { "type" : "category" }, + "subtitle" : { + "text" : "[Champions: 13] Last updated at 2023-12-27 11:03:53 GMT" + }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, "drilldown" : { "series" : [ { @@ -83,34 +106,48 @@ "id" : "Arne Sommer" }, { + "id" : "Dave Jacoby", + "name" : "Dave Jacoby", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Blog", + 1 + ] + ] + }, + { "id" : "David Ferrone", + "name" : "David Ferrone", "data" : [ [ "Perl", 2 ] - ], - "name" : "David Ferrone" + ] }, { - "name" : "E. Choroba", "data" : [ [ "Perl", 2 ] ], + "name" : "E. Choroba", "id" : "E. Choroba" }, { + "id" : "Mark Anderson", "name" : "Mark Anderson", "data" : [ [ "Raku", 2 ] - ], - "id" : "Mark Anderson" + ] }, { "name" : "Packy Anderson", @@ -131,7 +168,6 @@ "id" : "Packy Anderson" }, { - "name" : "Peter Campbell Smith", "id" : "Peter Campbell Smith", "data" : [ [ @@ -142,19 +178,21 @@ "Blog", 1 ] - ] + ], + "name" : "Peter Campbell Smith" }, { - "id" : "Peter Meszaros", + "name" : "Peter Meszaros", "data" : [ [ "Perl", 2 ] ], - "name" : "Peter Meszaros" + "id" : "Peter Meszaros" }, { + "name" : "Roger Bell_West", "data" : [ [ "Perl", @@ -165,8 +203,21 @@ 2 ] ], - "id" : "Roger Bell_West", - "name" : "Roger Bell_West" + "id" : "Roger Bell_West" + }, + { + "id" : "Stephen G. Lynn", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Blog", + 1 + ] + ], + "name" : "Stephen G. Lynn" }, { "id" : "Thomas Kohler", @@ -183,6 +234,20 @@ "name" : "Thomas Kohler" }, { + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "name" : "Ulrich Rieke", + "id" : "Ulrich Rieke" + }, + { "name" : "W. Luis Mochan", "data" : [ [ @@ -198,29 +263,21 @@ } ] }, - "subtitle" : { - "text" : "[Champions: 10] Last updated at 2023-12-26 20:08:10 GMT" - }, - "yAxis" : { - "title" : { - "text" : "Total Solutions" - } + "title" : { + "text" : "The Weekly Challenge - 249" }, "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 + "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>", + "followPointer" : 1 }, "plotOptions" : { "series" : { - "borderWidth" : 0, "dataLabels" : { "enabled" : 1, "format" : "{point.y}" - } + }, + "borderWidth" : 0 } } } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 8e43e2be1b..fd9aa792ca 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,63 +1,63 @@ { + "title" : { + "text" : "The Weekly Challenge Contributions [2019 - 2023]" + }, + "tooltip" : { + "pointFormat" : "<b>{point.y:.0f}</b>" + }, + "yAxis" : { + "title" : { + "text" : null + }, + "min" : 0 + }, + "subtitle" : { + "text" : "Last updated at 2023-12-27 11:03:53 GMT" + }, + "xAxis" : { + "labels" : { + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + } + }, + "type" : "category" + }, + "legend" : { + "enabled" : "false" + }, "chart" : { "type" : "column" }, "series" : [ { + "dataLabels" : { + "format" : "{point.y:.0f}", + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + }, + "y" : 10, + "rotation" : -90, + "enabled" : "true", + "align" : "right", + "color" : "#FFFFFF" + }, "data" : [ [ "Blog", - 4335 + 4337 ], [ "Perl", - 12816 + 12822 ], [ "Raku", - 7388 + 7390 ] ], - "dataLabels" : { - "enabled" : "true", - "color" : "#FFFFFF", - "style" : { - "fontSize" : "13px", - "fontFamily" : "Verdana, sans-serif" - }, - "rotation" : -90, - "format" : "{point.y:.0f}", - "align" : "right", - "y" : 10 - }, "name" : "Contributions" } - ], - "title" : { - "text" : "The Weekly Challenge Contributions [2019 - 2023]" - }, - "xAxis" : { - "labels" : { - "style" : { - "fontSize" : "13px", - "fontFamily" : "Verdana, sans-serif" - } - }, - "type" : "category" - }, - "yAxis" : { - "title" : { - "text" : null - }, - "min" : 0 - }, - "tooltip" : { - "pointFormat" : "<b>{point.y:.0f}</b>" - }, - "legend" : { - "enabled" : "false" - }, - "subtitle" : { - "text" : "Last updated at 2023-12-26 20:08:10 GMT" - } + ] } diff --git a/stats/pwc-language-breakdown.json b/stats/pwc-language-breakdown.json index 667787333a..3edc534cd2 100644 --- a/stats/pwc-language-breakdown.json +++ b/stats/pwc-language-breakdown.json @@ -1,1264 +1,16 @@ { - "chart" : { - "type" : "column" - }, - "title" : { - "text" : "The Weekly Challenge Language" - }, - "series" : [ - { - "data" : [ - { - "drilldown" : "001", - "name" : "#001", - "y" : 164 - }, - { - "y" : 129, - "drilldown" : "002", - "name" : "#002" - }, - { - "y" : 87, - "drilldown" : "003", - "name" : "#003" - }, - { - "name" : "#004", - "drilldown" : "004", - "y" : 103 - }, - { - "y" : 80, - "name" : "#005", - "drilldown" : "005" - }, - { - "y" : 61, - "drilldown" : "006", - "name" : "#006" - }, - { - "name" : "#007", - "drilldown" : "007", - "y" : 69 - }, - { - "drilldown" : "008", - "name" : "#008", - "y" : 82 - }, - { - "drilldown" : "009", - "name" : "#009", - "y" : 80 - }, - { - "y" : 69, - "drilldown" : "010", - "name" : "#010" - }, - { - "y" : 89, - "name" : "#011", - "drilldown" : "011" - }, - { - "name" : "#012", - "drilldown" : "012", - "y" : 92 - }, - { - "y" : 87, - "name" : "#013", - "drilldown" : "013" - }, - { - "name" : "#014", - "drilldown" : "014", - "y" : 102 - }, - { - "name" : "#015", - "drilldown" : "015", - "y" : 101 - }, - { - "y" : 75, - "drilldown" : "016", - "name" : "#016" - }, - { - "name" : "#017", - "drilldown" : "017", - "y" : 86 - }, - { - "drilldown" : "018", - "name" : "#018", - "y" : 83 - }, - { - "y" : 105, - "drilldown" : "019", - "name" : "#019" - }, - { - "drilldown" : "020", - "name" : "#020", - "y" : 103 - }, - { |