diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2024-05-21 17:16:45 +0100 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2024-05-21 17:16:45 +0100 |
| commit | b02c0dd369d99493663d945511dbd082e764058b (patch) | |
| tree | 56c5df5c1e69e01f90ff8011468c6645043bacc4 | |
| parent | 1e9f82f695904c56e432233daa87d179cb8fc384 (diff) | |
| download | perlweeklychallenge-club-b02c0dd369d99493663d945511dbd082e764058b.tar.gz perlweeklychallenge-club-b02c0dd369d99493663d945511dbd082e764058b.tar.bz2 perlweeklychallenge-club-b02c0dd369d99493663d945511dbd082e764058b.zip | |
- Added solutions by Steven Wilson.
- Added solutions by Mark Anderson.
- Added solutions by Ulrich Rieke.
26 files changed, 3397 insertions, 2947 deletions
diff --git a/challenge-270/ulrich-rieke/cpp/ch-1.cpp b/challenge-270/ulrich-rieke/cpp/ch-1.cpp new file mode 100755 index 0000000000..55779dbe03 --- /dev/null +++ b/challenge-270/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,54 @@ +#include <iostream>
+#include <vector>
+#include <string>
+#include <limits>
+#include <numeric>
+#include <algorithm>
+
+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 some 0 and 1 , separated by blanks!\n" ;
+ std::cout << "Enter <return> to end!\n" ;
+ std::vector<std::vector<int>> matrix ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ while ( line.length( ) > 0 ) {
+ std::vector<std::string> numberline { split( line , " " ) } ;
+ std::vector<int> numbers ;
+ for ( auto s : numberline )
+ numbers.push_back( std::stoi( s ) ) ;
+ matrix.push_back( numbers ) ;
+ std::getline( std::cin , line ) ;
+ }
+ int validRows = std::count_if( matrix.begin( ) , matrix.end( ) , [](
+ auto row ) {return std::accumulate( row.begin( ) , row.end( ),
+ 0 ) == 1 ; } ) ;
+ int validCols = 0 ;
+ for ( int col = 0 ; col < matrix[0].size( ) ; col++ ) {
+ std::vector<int> transposed ;
+ for ( int row = 0 ; row < matrix.size( ) ; row++ ) {
+ transposed.push_back( matrix[row][col] ) ;
+ }
+ if ( std::accumulate( transposed.begin( ) , transposed.end( ) , 0 )
+ == 1 )
+ validCols++ ;
+ }
+ std::cout << std::min( validRows , validCols ) << '\n' ;
+ return 0 ;
+}
+
+
+
+
diff --git a/challenge-270/ulrich-rieke/cpp/ch-2.cpp b/challenge-270/ulrich-rieke/cpp/ch-2.cpp new file mode 100755 index 0000000000..89ca63f7b1 --- /dev/null +++ b/challenge-270/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,60 @@ +#include <vector>
+#include <iostream>
+#include <algorithm>
+#include <numeric>
+#include <string>
+
+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 some integers, separated by blanks, e to end!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ std::vector<int> numbers ;
+ std::vector<std::string> numberlines { split( line, " " ) } ;
+ for ( auto s : numberlines )
+ numbers.push_back( std::stoi( s ) ) ;
+ std::cout << "Enter an integer x for one-level operation!\n" ;
+ int x ;
+ std::cin >> x ;
+ std::cout << " and an y for two-level operations!\n" ;
+ int y ;
+ std::cin >> y ;
+ int comp = numbers[0] ;
+ if ( std::all_of( numbers.begin( ) , numbers.end( ) , [comp]( int i ) {
+ return i == comp ; } ) )
+ std::cout << 0 << '\n' ;
+ else {
+ int maximum = *std::max_element( numbers.begin( ) , numbers.end( ) ) ;
+ std::vector<int> smaller ;
+ for ( int i : numbers ) {
+ if ( i < maximum )
+ smaller.push_back( i ) ;
+ }
+ std::transform( smaller.begin( ) , smaller.end( ) , smaller.begin( ) , [maximum](
+ int i ) { return maximum - i ; } ) ;
+ int total_diff = std::accumulate( smaller.begin( ) , smaller.end( ) , 0 ) ;
+ if ( smaller.size( ) == 1 )
+ std::cout << total_diff * x << '\n' ;
+ else {
+ std::vector<int> costs ;
+ for ( int twos = 0 ; twos < total_diff / 2 + 1 ; twos++ ) {
+ int ones = total_diff - twos * 2 ;
+ costs.push_back( ones * x + twos * y ) ;
+ }
+ std::cout << *std::min_element( costs.begin( ) , costs.end( ) ) << '\n' ;
+ }
+ }
+ return 0 ;
+}
diff --git a/challenge-270/ulrich-rieke/haskell/ch-1.hs b/challenge-270/ulrich-rieke/haskell/ch-1.hs new file mode 100755 index 0000000000..06ee0a1e7b --- /dev/null +++ b/challenge-270/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,34 @@ +module Challenge270
+ where
+import Data.List ( transpose , (!!) )
+
+solution :: [[Int]] -> Int
+solution matrix = min validRows validColumns
+ where
+ validRows :: Int
+ validRows = length $ filter (\i -> (sum $ matrix !! i) == 1) [0..length
+ matrix - 1 ]
+ validColumns :: Int
+ validColumns = length $ filter (\i -> ( sum $ transposed !! i ) == 1 )
+ [0..length ( matrix !! 0 ) - 1 ]
+ where
+ transposed = transpose matrix
+
+enterNLines :: Int -> IO [String]
+enterNLines n
+ |n <= 0 = return []
+ |otherwise = do
+ putStrLn "Enter some integers, separated by blanks!"
+ x <- getLine
+ xs <- enterNLines ( n - 1 )
+ let ret = (x:xs)
+ return ret
+
+main :: IO ( )
+main = do
+ putStrLn "Enter a binary matrix of 0 and 1, separated by blanks!"
+ putStrLn "How many rows do you want to enter?"
+ numberline <- getLine
+ matrix <- enterNLines $ read numberline
+ print $ solution ( map ( map read . words ) matrix )
+
diff --git a/challenge-270/ulrich-rieke/haskell/ch-2.hs b/challenge-270/ulrich-rieke/haskell/ch-2.hs new file mode 100755 index 0000000000..3c34d3bc25 --- /dev/null +++ b/challenge-270/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,30 @@ +module Challenge270_2
+ where
+
+findCombinations :: [Int] -> [([Int] , [Int])]
+findCombinations list =
+ let max = maximum list
+ smaller = filter ( /= max ) list
+ totalDiff = sum $ map (\i -> max - i ) smaller
+ in if (length smaller > 1) then [(replicate o 1 , replicate t 2) | o <-
+ [0..totalDiff] , t <- [0..div totalDiff 2] , sum ( replicate o 1 ++
+ replicate t 2 ) == totalDiff] else [(replicate totalDiff 1, [])]
+
+findBestCombi :: [([Int] , [Int] )] -> Int -> Int -> Int
+findBestCombi one_two_combinations oneprice twoprice = minimum $ map (\p ->
+ (length $ fst p) * oneprice + ( length $ snd p ) * twoprice )
+ one_two_combinations
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some integers , separated by blanks!"
+ numberstrings <- getLine
+ putStrLn "Enter a price for one-level operations!"
+ xstring <- getLine
+ putStrLn "Enter a price for two-level operations!"
+ ystring <- getLine
+ let numbers = map read $ words numberstrings
+ x = read xstring
+ y = read ystring
+ if all (\i -> i == head numbers ) numbers then print 0 else print $
+ findBestCombi (findCombinations numbers ) x y
diff --git a/challenge-270/ulrich-rieke/perl/ch-1.pl b/challenge-270/ulrich-rieke/perl/ch-1.pl new file mode 100755 index 0000000000..9bb3016f3c --- /dev/null +++ b/challenge-270/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,43 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( sum ) ;
+
+#we enter an array. The number we look for is the smaller of the number of
+#rows containing only one 1 and the number of columns containing only one 1
+say "Enter some 0 and 1 separated by blanks!" ;
+say "Enter <return> to end entry!" ;
+my @matrix ;
+my $line = <STDIN> ;
+chomp $line ;
+while ( length $line > 0 ) {
+ my @numbers = split( /\s+/ , $line ) ;
+ push( @matrix , \@numbers ) ;
+ $line = <STDIN> ;
+ chomp( $line ) ;
+}
+my $validRows = 0 ;
+for my $row( 0..scalar( @matrix ) - 1 ) {
+ if ( sum( @{$matrix[$row]} ) == 1 ) {
+ $validRows++ ;
+ }
+}
+my $validColumns = 0 ;
+for my $col( 0..scalar( @{$matrix[0]} ) - 1 ) {
+ my @transposed ;
+ for my $row( 0..scalar( @matrix ) - 1 ) {
+ my $elt = $matrix[$row]->[$col] ;
+ push( @transposed, $elt ) ;
+ }
+ if ( sum( @transposed ) == 1 ) {
+ $validColumns++ ;
+ }
+}
+if ( $validRows < $validColumns ) {
+ say $validRows ;
+}
+else {
+ say $validColumns ;
+}
+
diff --git a/challenge-270/ulrich-rieke/perl/ch-2.pl b/challenge-270/ulrich-rieke/perl/ch-2.pl new file mode 100755 index 0000000000..c6a2d03ecb --- /dev/null +++ b/challenge-270/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,36 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( all sum min max ) ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+say "Enter an integer x and y to denote the costs of level operations!" ;
+$line = <STDIN> ;
+chomp $line ;
+my ( $x , $y ) = split( /\s+/ , $line ) ;
+if ( all { $_ == $numbers[0] } @numbers ) {
+ say 0 ;
+}
+else {
+ my $max = max( @numbers ) ;
+ my @smaller = grep { $_ < $max } @numbers ;
+ my @differences = map { $max - $_ } @smaller ;
+ my $totaldiff = sum @differences ;
+ my $len = scalar( @smaller ) ;
+ if ( $len == 1 ) {
+ say ( $totaldiff * $x ) ;
+ }
+ else {
+ my @costs ;
+ for my $twos (0..int( $totaldiff / 2 ) ) {#that may two's
+ my $ones = $totaldiff - $twos * 2 ; #corresponding number of ones
+ push( @costs , $ones * $x + $twos * $y ) ;
+ }
+ say min( @costs ) ;
+ }
+}
+
diff --git a/challenge-270/ulrich-rieke/raku/ch-1.raku b/challenge-270/ulrich-rieke/raku/ch-1.raku new file mode 100755 index 0000000000..dc8d4bca72 --- /dev/null +++ b/challenge-270/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,36 @@ +use v6 ;
+
+my @matrix ;
+say "Enter a binary matrix of 0 and 1 separated by blanks!" ;
+say "Enter <return> to end entry!" ;
+my $line = $*IN.get ;
+while ( $line.chars > 0 ) {
+ @matrix.push( $line.words.map( {.Int} ) ) ;
+ $line = $*IN.get ;
+}
+#the given task corresponds to the following : find all rows and columns
+#with only one 1 in them ( their row or column sum is 1 ), the smaller of
+#the row and column total with this requirement is our solution
+my $validRows = 0 ;
+for (0..@matrix.elems - 1 ) -> $row {
+ my $seq = @matrix[ $row ] ;
+ my $sum = 0 ;
+ for ( 0..$seq.elems - 1 ) -> $elt {
+ $sum += $seq[$elt] ;
+ }
+ if ( $sum == 1 ) {
+ $validRows++ ;
+ }
+}
+my $validColumns = 0 ;
+for (0..@matrix[0].elems - 1) -> $col {
+ my @transposed ;
+ for (0..@matrix.elems - 1 ) -> $row {
+ my $elt = @matrix[$row][$col] ;
+ @transposed.push( $elt ) ;
+ }
+ if ( @transposed.sum == 1 ) {
+ $validColumns++ ;
+ }
+}
+say min( $validRows , $validColumns ) ;
diff --git a/challenge-270/ulrich-rieke/raku/ch-2.raku b/challenge-270/ulrich-rieke/raku/ch-2.raku new file mode 100755 index 0000000000..2bca6bd58c --- /dev/null +++ b/challenge-270/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,37 @@ +use v6 ;
+
+#the strategy is as follows : if all integers are the same , 0 is the result
+#otherwise sum of the differences of all numbers that are smaller than the
+#greatest number( differences from this greatest number )
+#then see how you can combine 1's and 2's to get this difference number
+#multiply all possible combinations of 1 and 2 with x and y respectively and
+#find the smallest number
+
+say "Enter some integers, separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+say "Enter two integers x and y to denote costs for one and two-level operations!" ;
+my $costline = $*IN.get ;
+my ($x , $y ) = $costline.words.map( {.Int} ) ;
+#if all numbers are equal we print out 0
+if ( @numbers.grep( { $_ == @numbers[0] } ).elems == @numbers.elems ) {
+ say 0 ;
+}
+else {
+ my $maximum = @numbers.max ;
+ my @smaller = @numbers.grep( {$_ < $maximum} ) ;
+ my $totaldiff = [+] @smaller.map( {$maximum - $_} ) ;
+ my $len = @smaller.elems ;
+ if ( $len == 1 ) { #we can only do level-1-operations !
+ say ( $totaldiff * $x ) ;
+ }
+ else {
+ my @costs ;
+ for (0..$totaldiff div 2 ) -> $twos {
+ my $ones = $totaldiff - $twos * 2 ;
+#enter the costs to the @costs array !
+ @costs.push( $ones * $x + $twos * $y )
+ }
+ say @costs.min ;
+ }
+}
diff --git a/challenge-270/ulrich-rieke/rust/ch-1.rs b/challenge-270/ulrich-rieke/rust/ch-1.rs new file mode 100755 index 0000000000..496d4b71f8 --- /dev/null +++ b/challenge-270/ulrich-rieke/rust/ch-1.rs @@ -0,0 +1,51 @@ +use std::io ; +use std::cmp ; +use std::io::BufRead ; + +fn main() ->io::Result<( )> { + println!("Enter n row of m binary digits, separated by blanks!"); + println!("Enter <return> to end!") ; + let mut lines = io::stdin( ).lock( ).lines( ) ; + let mut all_input : String = String::new( ) ; + while let Some( line ) = lines.next( ) { + let last_input = line.unwrap( ) ; + if last_input.len( ) == 0 { + break ; + } + else { + all_input.push_str( &last_input ) ; + all_input.push_str( "\n" ) ; + } + } + let all_lines : &str = all_input.as_str( ) ; + let rows : Vec<&str> = all_lines.trim( ).split( "\n" ).collect( ) ; + let mut matrix : Vec<Vec<u8>> = Vec::new( ) ; + for r in &rows { + if r.len( ) > 0 { + let row_nums : Vec<u8> = r.split_whitespace( ).map( | s | + s.trim( ).parse::<u8>( ).unwrap( ) ).collect( ) ; + matrix.push( row_nums ) ; + } + } + let rownum : usize = matrix.len( ) ; + let colnum : usize = matrix[0].len( ) ; + let mut spec_rows : usize = 0 ; + let mut spec_cols : usize = 0 ; + for r in 0..rownum { + if matrix[r].iter( ).sum::<u8>( ) == 1 { + spec_rows += 1 ; + } + } + for c in 0..colnum { + let mut transposed : Vec<u8> = Vec::new( ) ; + for r in 0..rownum { + transposed.push( matrix[r][c] ) ; + } + if transposed.iter( ).sum::<u8>( ) == 1 { + spec_cols += 1 ; + } + } + println!("{}" , cmp::min( spec_rows, spec_cols ) ) ; + Ok(()) +} + diff --git a/challenge-270/ulrich-rieke/rust/ch-2.rs b/challenge-270/ulrich-rieke/rust/ch-2.rs new file mode 100755 index 0000000000..1cf042b980 --- /dev/null +++ b/challenge-270/ulrich-rieke/rust/ch-2.rs @@ -0,0 +1,65 @@ +use std::io ; + +fn find_best_combi( combinations : Vec<Vec<i32>> , x : i32 , y : i32 ) -> + i32 { + let mut costs : Vec<i32> = Vec::new( ) ; + for combi in combinations { + let ones = combi.iter( ).filter( | &d | *d == 1 ).count( ) ; + let twos = combi.iter( ).filter( | &d | *d == 2 ).count( ) ; + let cost : i32 = ones as i32 * x + twos as i32 * y ; + costs.push( cost ) ; + } + costs.into_iter( ).min( ).unwrap( ) + } + +fn find_combinations( a_sum : i32 ) -> Vec<Vec<i32>> { + let mut all_combis : Vec<Vec<i32>> = Vec::new( ) ; + for d in 0..=a_sum / 2 { + let mut single_combi : Vec<i32> = Vec::new( ) ; + let ones = a_sum - d * 2 ; + for _ in 0..ones { + single_combi.push( 1 ) ; + } + for _ in 0..d { + single_combi.push( 2 ) ; + } + all_combis.push( single_combi ) ; + } + all_combis +} + +fn main() { + println!("Enter some integers, separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let entered_line : &str = &*inline ; + let numbers : Vec<i32> = entered_line.trim( ).split_whitespace( ).map( + | s | s.parse::<i32>( ).unwrap( ) ).collect( ) ; + println!("Enter an integer x and an integer y , meaning the costs!") ; + inline.clear( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let xline : &str = &*inline ; + let costs : Vec<i32> = xline.trim( ).split_whitespace( ).map( | s | + s.parse::<i32>( ).unwrap( ) ).collect( ) ; + let x : i32 = costs[0] ; + let y : i32 = costs[ 1 ] ; + //find all ways to add 1 and 2 so that the sum of the differences of all + //numbers smaller than the maximum number is equalled! + if numbers.len( ) == 1 || numbers.iter( ).all( | i | *i == numbers[0] ) { + println!("0") ; + } + else { + let max : i32 = *numbers.iter( ).max( ).unwrap( ) ; + let smaller : Vec<i32> = numbers.into_iter( ).filter( | &d | d < max ). + collect( ) ; + let total_diff : i32 = smaller.iter( ).map( | i | max - *i ).sum( ) ; + if smaller.len( ) == 1 { + println!("{}" , total_diff * x ) ; + } + else { + let combinations : Vec<Vec<i32>> = find_combinations( total_diff ) ; + let result : i32 = find_best_combi( combinations , x , y ) ; + println!("{}" , result ) ; + } + } +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 2ec49b0371..cd081670a4 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,48 +1,30 @@ { - "title" : { - "text" : "The Weekly Challenge - 270" - }, - "tooltip" : { - "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/>", - "followPointer" : 1 - }, - "subtitle" : { - "text" : "[Champions: 7] Last updated at 2024-05-21 12:59:24 GMT" + "xAxis" : { + "type" : "category" }, "chart" : { "type" : "column" }, - "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" : [ { - "id" : "David Ferrone", "name" : "David Ferrone", "data" : [ [ "Perl", 1 ] - ] - }, - { - "data" : [ - [ - "Raku", - 1 - ] ], - "name" : "Mark Anderson", - "id" : "Mark Anderson" + "id" : "David Ferrone" }, { - "id" : "Niels van Dijke", "name" : "Niels van Dijke", + "id" : "Niels van Dijke", "data" : [ [ "Perl", @@ -51,8 +33,6 @@ ] }, { - "id" : "Peter Campbell Smith", - "name" : "Peter Campbell Smith", "data" : [ [ "Perl", @@ -62,19 +42,22 @@ "Blog", 1 ] - ] + ], + "id" : "Peter Campbell Smith", + "name" : "Peter Campbell Smith" }, { - "id" : "Peter Meszaros", - "name" : "Peter Meszaros", "data" : [ [ "Perl", 2 ] - ] + ], + "id" : "Peter Meszaros", + "name" : "Peter Meszaros" }, { + "name" : "Roger Bell_West", "data" : [ [ "Perl", @@ -85,10 +68,10 @@ 2 ] ], - "name" : "Roger Bell_West", "id" : "Roger Bell_West" }, { + "name" : "Thomas Kohler", "data" : [ [ "Perl", @@ -99,67 +82,88 @@ 2 ] ], - "id" : "Thomas Kohler", - "name" : "Thomas Kohler" + "id" : "Thomas Kohler" + }, + { + "id" : "Ulrich Rieke", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "name" : "Ulrich Rieke" } ] }, - "xAxis" : { - "type" : "category" - }, - "legend" : { - "enabled" : 0 + "title" : { + "text" : "The Weekly Challenge - 270" }, "plotOptions" : { "series" : { "dataLabels" : { - "enabled" : 1, - "format" : "{point.y}" + "format" : "{point.y}", + "enabled" : 1 }, "borderWidth" : 0 } }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "legend" : { + "enabled" : 0 + }, "series" : [ { - "name" : "The Weekly Challenge - 270", - "colorByPoint" : 1, "data" : [ { - "name" : "David Ferrone", "drilldown" : "David Ferrone", + "name" : "David Ferrone", "y" : 1 }, { - "name" : "Mark Anderson", - "y" : 1, - "drilldown" : "Mark Anderson" - }, - { - "name" : "Niels van Dijke", + "drilldown" : "Niels van Dijke", "y" : 2, - "drilldown" : "Niels van Dijke" + "name" : "Niels van Dijke" }, { - "y" : 3, "drilldown" : "Peter Campbell Smith", - "name" : "Peter Campbell Smith" + "name" : "Peter Campbell Smith", + "y" : 3 }, { - "name" : "Peter Meszaros", + "drilldown" : "Peter Meszaros", "y" : 2, - "drilldown" : "Peter Meszaros" + "name" : "Peter Meszaros" }, { - "name" : "Roger Bell_West", "drilldown" : "Roger Bell_West", - "y" : 4 + "y" : 4, + "name" : "Roger Bell_West" }, { - "y" : 4, "drilldown" : "Thomas Kohler", - "name" : "Thomas Kohler" + "name" : "Thomas Kohler", + "y" : 4 + }, + { + "drilldown" : "Ulrich Rieke", + "name" : "Ulrich Rieke", + "y" : 4 } - ] + ], + "colorByPoint" : 1, + "name" : "The Weekly Challenge - 270" } - ] + ], + "subtitle" : { + "text" : "[Champions: 7] Last updated at 2024-05-21 16:13:20 GMT" + } } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index a92ff11b81..6e06cbf55c 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,46 +1,24 @@ { + "chart" : { + "type" : "column" + }, "tooltip" : { "pointFormat" : "<b>{point.y:.0f}</b>" }, "title" : { "text" : "The Weekly Challenge Contributions [2019 - 2024]" }, - "yAxis" : { - "title" : { - "text" : null - }, - "min" : 0 - }, - "chart" : { - "type" : "column" - }, - "subtitle" : { - "text" : "Last updated at 2024-05-21 12:59:24 GMT" - }, "xAxis" : { + "type" : "category", "labels" : { "style" : { "fontFamily" : "Verdana, sans-serif", "fontSize" : "13px" } - }, - "type" : "category" + } }, "series" : [ { - "dataLabels" : { - "y" : 10, - "color" : "#FFFFFF", - "rotation" : -90, - "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" - }, - "format" : "{point.y:.0f}", - "enabled" : "true", - "align" : "right" - }, - "name" : "Contributions", "data" : [ [ "Blog", @@ -48,16 +26,38 @@ ], [ "Perl", - 13968 + 13970 ], [ "Raku", - 8103 + 8104 ] - ] + ], + "dataLabels" : { + "format" : "{point.y:.0f}", + "color" : "#FFFFFF", + "align" : "right", + "y" : 10, + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + }, + "rotation" : -90, + "enabled" : "true" + }, + "name" : "Contributions" } ], + "subtitle" : { + "text" : "Last updated at 2024-05-21 16:13:20 GMT" + }, "legend" : { "enabled" : "false" + }, + "yAxis" : { + "title" : { + "text" : null + }, + "min" : 0 } } diff --git a/stats/pwc-language-breakdown.json b/stats/pwc-language-breakdown.json index f24fb30796..e419184c2f 100644 --- a/stats/pwc-language-breakdown.json +++ b/stats/pwc-language-breakdown.json @@ -1,1378 +1,16 @@ { - "legend" : { - "enabled" : "false" - }, - "series" : [ - { - "colorByPoint" : "true", - "data" : [ - { - "name" : "#001", - "drilldown" : "001", - "y" : 168 - }, - { - "name" : "#002", - "drilldown" : "002", - "y" : 133 - }, - { - "drilldown" : "003", - "y" : 91, - "name" : "#003" - }, - { - "name" : "#004", - "drilldown" : "004", - "y" : 106 - }, - { - "name" : "#005", - "drilldown" : "005", - "y" : 82 - }, - { |