diff options
| author | Mohammad Sajid Anwar <mohammad.anwar@yahoo.com> | 2025-10-14 19:26:38 +0100 |
|---|---|---|
| committer | Mohammad Sajid Anwar <mohammad.anwar@yahoo.com> | 2025-10-14 19:26:38 +0100 |
| commit | 711c8a87733d4422fc8fed8926699835105d2a52 (patch) | |
| tree | 98251548187eed5ca76de596f16d28c3213a5611 | |
| parent | 7dd24e5b7352f6067facff32b6e703dac66a5b63 (diff) | |
| download | perlweeklychallenge-club-711c8a87733d4422fc8fed8926699835105d2a52.tar.gz perlweeklychallenge-club-711c8a87733d4422fc8fed8926699835105d2a52.tar.bz2 perlweeklychallenge-club-711c8a87733d4422fc8fed8926699835105d2a52.zip | |
- Added solutions by Conor Hoekstra.
- Added solutions by Peter Meszaros.
- Added solutions by Roger Bell_West.
- Added solutions by Ulrich Rieke.
- Added solutions by Steven Wilson.
- Added solutions by Andrew Shitov.
35 files changed, 428 insertions, 70 deletions
diff --git a/challenge-343/ulrich-rieke/cpp/ch-1.cpp b/challenge-343/ulrich-rieke/cpp/ch-1.cpp new file mode 100755 index 0000000000..09bb86a185 --- /dev/null +++ b/challenge-343/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,29 @@ +#include <iostream>
+#include <vector>
+#include <sstream>
+#include <string>
+#include <algorithm>
+#include <cstdlib>
+
+std::vector<std::string> split( const std::string & text , const char delimiter ) {
+ std::vector<std::string> tokens ;
+ std::istringstream istr { text } ;
+ std::string word ;
+ while ( std::getline( istr , word , delimiter ) )
+ tokens.push_back( word ) ;
+ return tokens ;
+}
+
+//we want to find the minimum absolute value!
+int main( ) {
+ std::cout << "Enter some integers separated by whitespace!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ auto tokens { split( line , ' ' ) } ;
+ std::vector<int> differences ;
+ for ( auto s : tokens )
+ differences.push_back( std::abs(std::stoi( s ) )) ;
+ std::cout << *std::min_element( differences.begin( ) , differences.end( ) ) <<
+ '\n' ;
+ return 0 ;
+}
diff --git a/challenge-343/ulrich-rieke/cpp/ch-2.cpp b/challenge-343/ulrich-rieke/cpp/ch-2.cpp new file mode 100755 index 0000000000..448d806b1c --- /dev/null +++ b/challenge-343/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,53 @@ +#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <algorithm>
+#include <utility>
+#include <iterator>
+
+std::vector<std::string> split( const std::string & text , const char delimiter ) {
+ std::vector<std::string> tokens ;
+ std::istringstream istr { text } ;
+ std::string word ;
+ while ( std::getline( istr , word , delimiter ))
+ tokens.push_back( word ) ;
+ return tokens ;
+}
+
+//order by number of 1 in the second element of each matrix row
+//if these are equal see whether the entry in the second element of the
+//first row that is denoted by the first element in the second row equals 0
+bool mySorter( const std::pair<int , std::vector<int>> & firstRow ,
+ const std::pair<int , std::vector<int>> & secondRow ) {
+ int firstOnes = std::count( firstRow.second.begin( ) , firstRow.second.end( ) , 1 ) ;
+ int secondOnes = std::count( secondRow.second.begin( ) , secondRow.second.end( ) ,
+ 1 ) ;
+ if ( firstOnes != secondOnes ) {
+ return firstOnes < secondOnes ;
+ }
+ else {
+ return firstRow.second[secondRow.first] == 0 ;
+ }
+}
+
+int main( ) {
+ std::cout << "Enter a quadratic matrix of n row of n 0 or 1, <enter> to end!\n" ;
+ std::string line ;
+ std::vector<std::pair<int , std::vector<int>>> matrix ;
+ int counter = 0 ;
+ std::getline( std::cin , line ) ;
+ while ( ! line.empty( ) ) {
+ auto tokens { split( line , ' ' ) } ;
+ std::vector<int> numbers ;
+ for ( auto s : tokens )
+ numbers.push_back( std::stoi( s ) ) ;
+ matrix.push_back( std::make_pair( counter , numbers )) ;
+ counter++ ;
+ std::cout << "Enter a quadratic matrix of n rows of n 0 or 1 , <enter> to end!\n";
+ std::getline( std::cin , line ) ;
+ }
+ std::sort( matrix.begin( ) , matrix.end( ) , mySorter ) ;
+ std::cout << "Team " << std::prev( matrix.end( ))->first << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-343/ulrich-rieke/haskell/ch-1.hs b/challenge-343/ulrich-rieke/haskell/ch-1.hs new file mode 100755 index 0000000000..619f8a6357 --- /dev/null +++ b/challenge-343/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,12 @@ +module Challenge343
+ where
+
+solution :: [Int] -> Int
+solution = minimum . map abs
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some integers separated by blanks!"
+ numberline <- getLine
+ print $ solution $ map read $ words numberline
+
diff --git a/challenge-343/ulrich-rieke/haskell/ch-2.hs b/challenge-343/ulrich-rieke/haskell/ch-2.hs new file mode 100755 index 0000000000..4fafc02135 --- /dev/null +++ b/challenge-343/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,27 @@ +module Challenge343_2
+ where
+import Data.List( sortBy , (!!) )
+
+getSomeLines :: IO [String]
+getSomeLines = do
+ line <- getLine
+ if null line then return []
+ else
+ (line : ) <$> getSomeLines
+
+toMatrix :: [String] -> [(Int , [Int])]
+toMatrix input = zip [0 , 1 ..] ( map ( map read . words ) input )
+
+mySorter :: (Int , [Int]) -> (Int , [Int]) -> Ordering
+mySorter firstPair secondPair =
+ let firstOnes = length $ filter ( == 1 ) $ snd firstPair
+ secondOnes = length $ filter ( == 1 ) $ snd secondPair
+ in if firstOnes /= secondOnes then compare firstOnes secondOnes else
+ if ( snd firstPair ) !! ( fst secondPair ) == 0 then LT else GT
+
+main :: IO ( )
+main = do
+ putStrLn "Enter n lines of n 0 and 1 , enter <return> to end!"
+ allLines <- getSomeLines
+ let matrix = toMatrix allLines
+ putStrLn ("Team " ++ show (fst $ last $ sortBy mySorter matrix))
diff --git a/challenge-343/ulrich-rieke/perl/ch-1.pl b/challenge-343/ulrich-rieke/perl/ch-1.pl new file mode 100755 index 0000000000..ee125d5691 --- /dev/null +++ b/challenge-343/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,14 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use POSIX ;
+use List::Util qw ( min ) ;
+
+#find the minimum absolute value!
+say "Enter some integers separated by whitespace!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s/ , $line ) ;
+my @differences = map { abs( $_) } @numbers ;
+say min( @differences ) ;
diff --git a/challenge-343/ulrich-rieke/perl/ch-2.pl b/challenge-343/ulrich-rieke/perl/ch-2.pl new file mode 100755 index 0000000000..6346873052 --- /dev/null +++ b/challenge-343/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,32 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+#sort in ascending order of the number of 1 in the rows
+#if these are equal sort in ascending order of the numbers that are
+#in b's column of a and in a's column of b
+sub mySorter {
+ scalar( grep { $_ == 1 } @{$a->[1]} ) <=> scalar( grep
+ { $_ == 1 } @{$b->[1]} ) ||
+ ${$a->[1]}[$b->[0]] <=> ${$b->[1]}[$a->[0]] ;
+}
+
+say "Enter a quadratic matrix of 0 and 1 , <enter> to end!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @matrix ;
+my $counter = 0 ;
+while ( $line ) {
+ my @input = split( /\s/ , $line ) ;
+ my @row ;
+ push( @row , $counter ) ;
+ push( @row , \@input ) ;
+ push( @matrix , \@row ) ;
+ $counter++ ;
+ say "Enter a quadratic matrix of 0 and 1 , <enter> to end!" ;
+ $line = <STDIN> ;
+ chomp $line ;
+}
+my @sorted = sort mySorter @matrix ;
+say "Team " . $sorted[-1][0] ;
diff --git a/challenge-343/ulrich-rieke/python/ch-1.py b/challenge-343/ulrich-rieke/python/ch-1.py new file mode 100755 index 0000000000..efef60996f --- /dev/null +++ b/challenge-343/ulrich-rieke/python/ch-1.py @@ -0,0 +1,7 @@ +#!/usr/bin/env python3
+
+line = input( "Enter some integers separated by blanks!\n" ) ;
+differences = []
+for w in line.split( ' ' ):
+ differences.append(abs(int(w)))
+print( min( differences ))
diff --git a/challenge-343/ulrich-rieke/python/ch-2.py b/challenge-343/ulrich-rieke/python/ch-2.py new file mode 100755 index 0000000000..df60f95bfa --- /dev/null +++ b/challenge-343/ulrich-rieke/python/ch-2.py @@ -0,0 +1,23 @@ +#!/usr/bin/env python3
+from functools import cmp_to_key
+
+def mySorter( a , b):
+ firstOnes = a[1].count(1)
+ secondOnes = b[1].count(1)
+ if firstOnes != secondOnes:
+ return firstOnes - secondOnes
+ else:
+ return a[1][b[0]] - b[1][a[0]]
+
+line = input( "Enter a quadratic matrix of n rows with n 1 and 0 each, <return> to end!\n")
+matrix = []
+counter = 0
+while line:
+ row = []
+ for w in line.split(' '):
+ row.append(int(w))
+ matrix.append((counter , row))
+ counter += 1
+ line = input( "Enter a quadratic matrix of n rows with n 1 and 0 each, <return> to end!\n")
+sortedMatrix = sorted(matrix , key=cmp_to_key(mySorter))
+print( "Team " + str(sortedMatrix[-1][0]))
diff --git a/challenge-343/ulrich-rieke/raku/ch-1.raku b/challenge-343/ulrich-rieke/raku/ch-1.raku new file mode 100755 index 0000000000..89b5f066dc --- /dev/null +++ b/challenge-343/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,7 @@ +use v6 ;
+#find minimum absolute value
+say "Enter some integers separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+my @differences = @numbers.map( {.abs} ) ;
+say @differences.min ;
diff --git a/challenge-343/ulrich-rieke/raku/ch-2.raku b/challenge-343/ulrich-rieke/raku/ch-2.raku new file mode 100755 index 0000000000..280ba9b1f1 --- /dev/null +++ b/challenge-343/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,39 @@ +use v6 ;
+
+sub mySorter( @firstPair , @secondPair ) {
+ my $firstOnes = @firstPair[1].grep( {$_ == 1} ).elems ;
+ my $secondOnes = @secondPair[1].grep( {$_ == 1 } ).elems ;
+ if ( $firstOnes != $secondOnes ) {
+ if ( $firstOnes < $secondOnes ) {
+ return Order::Less ;
+ }
+ else {
+ return Order::More ;
+ }
+ }
+ else {
+ if ( @firstPair[1][@secondPair[0]] == 0 ) {
+ return Order::Less ;
+ }
+ else {
+ return Order::More ;
+ }
+ }
+}
+
+say "Enter some numbers 0 and 1 , <enter> to end!" ;
+my $line = $*IN.get ;
+my @matrix ;
+my $counter = 0 ;
+while ( $line ) {
+ my @numbers = $line.words.map( {.Int} ) ;
+ my @row ;
+ @row.push( $counter ) ;
+ @row.push( @numbers ) ;
+ @matrix.push( @row ) ;
+ $counter++ ;
+ say "Enter some numbers 0 and 1 , <enter> to end!" ;
+ $line = $*IN.get ;
+}
+my @sorted = @matrix.sort( &mySorter ) ;
+say "Team " ~ @sorted[*-1][0] ;
diff --git a/challenge-343/ulrich-rieke/rust/ch-1.rs b/challenge-343/ulrich-rieke/rust/ch-1.rs new file mode 100755 index 0000000000..758d7c10d9 --- /dev/null +++ b/challenge-343/ulrich-rieke/rust/ch-1.rs @@ -0,0 +1,10 @@ +use std::io ; + +fn main() { + println!("Enter some integers separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let numbers : Vec<i32> = inline.trim( ).split_whitespace( ).map( |s| + s.parse::<i32>( ).unwrap( )).map( |s| s.abs( )).collect() ; + println!("{}" , numbers.into_iter( ).min( ).unwrap( ) ) ; +} diff --git a/challenge-343/ulrich-rieke/rust/ch-2.rs b/challenge-343/ulrich-rieke/rust/ch-2.rs new file mode 100755 index 0000000000..ab01b524ea --- /dev/null +++ b/challenge-343/ulrich-rieke/rust/ch-2.rs @@ -0,0 +1,37 @@ +use std::io ; +use std::cmp::Ordering ; + +fn main() { + println!("Please enter some rows with 0 and 1 , all with the same number of digits!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let mut matrix : Vec<(usize, Vec<u8>)> = Vec::new( ) ; + let mut rownum : usize = 0 ; + while inline != "\n".to_string( ) { + let row : Vec<u8> = inline.trim( ).split_whitespace( ).map( |s| s.parse::<u8>(). + unwrap( ) ).collect( ) ; + matrix.push( (rownum , row.clone( ) ) ) ; + rownum += 1 ; + println!("Enter more numbers , <enter> to end!") ; + inline.clear( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + } + //order in ascending order by number of 1's in each row + //if these are equal let the value in the b.0.th column of a.1 decide + //if it is 0 then it comes first in ascending order + matrix.sort_by( |a , b| { + let first_ones : usize = a.1.iter( ).filter( |&n| *n == 1 ).count( ) ; + let second_ones : usize = b.1.iter( ).filter( |&n| *n == 1 ).count( ) ; + if first_ones != second_ones { + first_ones.cmp( &second_ones ) + } + else { + if a.1.iter( ).nth( b.0 ) == Some(&0) { + Ordering::Less + } + else { + Ordering::Greater + } + }}) ; + println!("Team {}" , matrix[matrix.len( ) - 1].0) ; +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 2d79786669..81b0ca9924 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -31,6 +31,16 @@ { "data" : [ [ + "Raku", + 1 + ] + ], + "id" : "Andrew Shitov", + "name" : "Andrew Shitov" + }, + { + "data" : [ + [ "Perl", 2 ] @@ -143,6 +153,30 @@ [ "Perl", 2 + ] + ], + "id" : "Peter Meszaros", + "name" : "Peter Meszaros" + }, + { + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "id" : "Roger Bell_West", + "name" : "Roger Bell_West" + }, + { + "data" : [ + [ + "Perl", + 2 ], [ "Blog", @@ -151,6 +185,20 @@ ], "id" : "Thomas Kohler", "name" : "Thomas Kohler" + }, + { + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "id" : "Ulrich Rieke", + "name" : "Ulrich Rieke" } ] }, @@ -181,6 +229,11 @@ "y" : 2 }, { + "drilldown" : "Andrew Shitov", + "name" : "Andrew Shitov", + "y" : 1 + }, + { "drilldown" : "David Ferrone", "name" : "David Ferrone", "y" : 2 @@ -226,16 +279,31 @@ "y" : 3 }, { + "drilldown" : "Peter Meszaros", + "name" : "Peter Meszaros", + "y" : 2 + }, + { + "drilldown" : "Roger Bell_West", + "name" : "Roger Bell_West", + "y" : 4 + }, + { "drilldown" : "Thomas Kohler", "name" : "Thomas Kohler", "y" : 4 + }, + { + "drilldown" : "Ulrich Rieke", + "name" : "Ulrich Rieke", + "y" : 4 } ], "name" : "The Weekly Challenge - 343" } ], "subtitle" : { - "text" : "[Champions: 12] Last updated at 2025-10-14 09:16:16 GMT" + "text" : "[Champions: 16] Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge - 343" diff --git a/stats/pwc-language-breakdown-2019.json b/stats/pwc-language-breakdown-2019.json index 04afa289db..1bfce9254c 100644 --- a/stats/pwc-language-breakdown-2019.json +++ b/stats/pwc-language-breakdown-2019.json @@ -970,7 +970,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2020.json b/stats/pwc-language-breakdown-2020.json index 17c238ed0a..324472c764 100644 --- a/stats/pwc-language-breakdown-2020.json +++ b/stats/pwc-language-breakdown-2020.json @@ -1223,7 +1223,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2021.json b/stats/pwc-language-breakdown-2021.json index 3469afa74d..8c63b2c8ff 100644 --- a/stats/pwc-language-breakdown-2021.json +++ b/stats/pwc-language-breakdown-2021.json @@ -1223,7 +1223,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2022.json b/stats/pwc-language-breakdown-2022.json index dd6fd9fd6b..5796d50e70 100644 --- a/stats/pwc-language-breakdown-2022.json +++ b/stats/pwc-language-breakdown-2022.json @@ -1223,7 +1223,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2023.json b/stats/pwc-language-breakdown-2023.json index 7bbba9e0ef..1fd638a6a8 100644 --- a/stats/pwc-language-breakdown-2023.json +++ b/stats/pwc-language-breakdown-2023.json @@ -1200,7 +1200,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2024.json b/stats/pwc-language-breakdown-2024.json index bcef9822fe..0b256eab88 100644 --- a/stats/pwc-language-breakdown-2024.json +++ b/stats/pwc-language-breakdown-2024.json @@ -1246,7 +1246,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-2025.json b/stats/pwc-language-breakdown-2025.json index ae2686c1b4..20fe2c48c1 100644 --- a/stats/pwc-language-breakdown-2025.json +++ b/stats/pwc-language-breakdown-2025.json @@ -8,11 +8,11 @@ "data" : [ [ "Perl", - 21 + 27 ], [ "Raku", - 5 + 10 ], [ "Blog", @@ -763,7 +763,7 @@ { "drilldown" : "343", "name" : "343", - "y" : 32 + "y" : 43 }, { "drilldown" : "342", @@ -970,7 +970,7 @@ } ], "subtitle" : { - "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Language" diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 8b736738c4..cb205db6ce 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -10,11 +10,11 @@ "data" : [ [ "Perl", - 17666 + 17672 ], [ "Raku", - 9801 + 9806 ], [ "Blog", @@ -37,7 +37,7 @@ } ], "subtitle" : { - "text" : "Last updated at 2025-10-14 09:16:16 GMT" + "text" : "Last updated at 2025-10-14 18:26:32 GMT" }, "title" : { "text" : "The Weekly Challenge Contributions [2019 - 2025]" diff --git a/stats/pwc-leaders.json b/stats/pwc-leaders.json index 7913e15530..374927741a 100644 --- a/stats/pwc-leaders.json +++ b/stats/pwc-leaders.json @@ -40,11 +40,11 @@ "data" : [ [ "Perl", - 643 + 645 ], [ "Raku", - 599 + 601 ], [ "Blog", @@ -112,11 +112,11 @@ "data" : [ [ "Perl", - 522 + 524 ], [ "Raku", - 530 + 532 ] ], "id" : "Ulrich Rieke", @@ -618,6 +618,16 @@ "data" : [ [ "Perl", + 288 + ] + ], + "id" : "Peter Meszaros", + "name" : "Peter Meszaros" + }, + { + "data" : [ + [ + "Perl", 169 ], [ @@ -646,16 +656,6 @@ "data" : [ [ "Perl", - 286 - ] - ], - "id" : "Peter Meszaros", - "name" : "Peter Meszaros" - }, - { - "data" : [ - [ - "Perl", 47 ], [ @@ -766,7 +766,7 @@ ], [ "Raku", - 128 + 129 ], [ "Blog", @@ -807,7 +807,7 @@ { "drilldown" : "Roger Bell_West", "name" : "3: Roger Bell_West", - "y" : 3126 + "y" : 3134 }, { "drilldown" : "Laurent Rosenfeld", @@ -827,7 +827,7 @@ { "drilldown" : "Ulrich Rieke", "name" : "7: Ulrich Rieke", - "y" : 2104 + "y" : 2112 }, { "drilldown" : "Flavio Poletti", @@ -990,21 +990,21 @@ "y" : 610 }, { + "drilldown" : "Peter Meszaros", + "name" : "40: Peter Meszaros", + "y" : 576 + }, + { "drilldown" : "Abigail", - "name" : "40: Abigail", + "name" : "41: Abigail", "y" : 574 }, { "drilldown" : "Robert DiCicco", - "name" : "41: Robert DiCicco", + "name" : "42: Robert DiCicco", "y" : 574 }, { - "drilldown" : "Peter Meszaros", - "name" : "42: Peter Meszaros", - " |
