aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMohammad S Anwar <mohammad.anwar@yahoo.com>2024-04-24 19:21:32 +0100
committerMohammad S Anwar <mohammad.anwar@yahoo.com>2024-04-24 19:21:32 +0100
commit5ba428b6c66548e501eafc41c7a729456cbe10dd (patch)
treec69c034a7c50638589dd7fc816b6dc5093f55832
parente3f6f2c63e9d4d72d6c99f1e5c28771abd7470d5 (diff)
downloadperlweeklychallenge-club-5ba428b6c66548e501eafc41c7a729456cbe10dd.tar.gz
perlweeklychallenge-club-5ba428b6c66548e501eafc41c7a729456cbe10dd.tar.bz2
perlweeklychallenge-club-5ba428b6c66548e501eafc41c7a729456cbe10dd.zip
- Added solutions by Ulrich Rieke.
- Added solutions by Ali Moradi.
-rwxr-xr-xchallenge-266/ulrich-rieke/cpp/ch-1.cpp57
-rwxr-xr-xchallenge-266/ulrich-rieke/cpp/ch-2.cpp72
-rwxr-xr-xchallenge-266/ulrich-rieke/haskell/ch-1.hs20
-rwxr-xr-xchallenge-266/ulrich-rieke/haskell/ch-2.hs37
-rwxr-xr-xchallenge-266/ulrich-rieke/perl/ch-1.pl24
-rwxr-xr-xchallenge-266/ulrich-rieke/perl/ch-2.pl64
-rwxr-xr-xchallenge-266/ulrich-rieke/raku/ch-1.raku19
-rwxr-xr-xchallenge-266/ulrich-rieke/rust/ch-1.rs29
-rwxr-xr-xchallenge-266/ulrich-rieke/rust/ch-2.rs58
-rw-r--r--stats/pwc-current.json300
-rw-r--r--stats/pwc-language-breakdown-summary.json74
-rw-r--r--stats/pwc-language-breakdown.json1838
-rw-r--r--stats/pwc-leaders.json380
-rw-r--r--stats/pwc-summary-1-30.json122
-rw-r--r--stats/pwc-summary-121-150.json100
-rw-r--r--stats/pwc-summary-151-180.json32
-rw-r--r--stats/pwc-summary-181-210.json100
-rw-r--r--stats/pwc-summary-211-240.json110
-rw-r--r--stats/pwc-summary-241-270.json100
-rw-r--r--stats/pwc-summary-271-300.json38
-rw-r--r--stats/pwc-summary-301-330.json62
-rw-r--r--stats/pwc-summary-31-60.json40
-rw-r--r--stats/pwc-summary-61-90.json40
-rw-r--r--stats/pwc-summary-91-120.json46
-rw-r--r--stats/pwc-summary.json662
25 files changed, 2423 insertions, 2001 deletions
diff --git a/challenge-266/ulrich-rieke/cpp/ch-1.cpp b/challenge-266/ulrich-rieke/cpp/ch-1.cpp
new file mode 100755
index 0000000000..84477e81ec
--- /dev/null
+++ b/challenge-266/ulrich-rieke/cpp/ch-1.cpp
@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <string>
+#include <map>
+#include <utility>
+#include <ranges>
+#include <algorithm>
+
+namespace rng = std::ranges ;
+
+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 words, separated by blanks!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ std::vector<std::string> firstWords { split( line, " " ) } ;
+ std::cout << "Enter some more words, separated by blanks!\n" ;
+ line.clear( ) ;
+ std::getline( std::cin , line ) ;
+ std::vector<std::string> secondWords { split( line, " " ) } ;
+ std::map<std::string, int> frequencies ;
+ for ( auto it = firstWords.begin( ) ; it != firstWords.end( ) ; it++ )
+ frequencies[*it]++ ;
+ for ( auto it = secondWords.begin( ) ; it != secondWords.end( ) ; it++ )
+ frequencies[*it]++ ;
+ std::vector<std::pair<std::string, int>> allWords { frequencies.begin( ) ,
+ frequencies.end( ) } ;
+ std::vector<std::string> selected ;
+ if ( allWords.size( ) > 0 ) {
+ std::cout << "( " ;
+ for ( auto p : allWords | rng::views::filter([]( auto pa ){ return pa.second ==
+ 1 ; } )) {
+ selected.push_back( p.first ) ;
+ }
+ for ( auto w : selected )
+ std::cout << w << ' ' ;
+ std::cout << ")\n" ;
+ }
+ else {
+ std::cout << "()\n" ;
+ }
+ return 0 ;
+}
+
+
diff --git a/challenge-266/ulrich-rieke/cpp/ch-2.cpp b/challenge-266/ulrich-rieke/cpp/ch-2.cpp
new file mode 100755
index 0000000000..277586e813
--- /dev/null
+++ b/challenge-266/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,72 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <string>
+#include <numeric>
+
+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 ;
+}
+
+std::vector<int> enter_row( ) {
+ std::cout << "Enter some integers, separated by blanks!\n" ;
+ std::vector<int> numbers ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ std::vector<std::string> numberstrings { split( line , " " ) } ;
+ for ( auto str : numberstrings )
+ numbers.push_back( std::stoi( str ) ) ;
+ return numbers ;
+}
+
+bool is_diagonal( const std::vector<std::vector<int>> & matrix ) {
+ int len = matrix.size( ) ;
+ std::vector<int> positions( len ) ;
+ std::iota( positions.begin( ) , positions.end( ) , 0 ) ;
+ return std::all_of( positions.begin( ) , positions.end( ) ,
+ [&matrix]( int i ) { return matrix[i][i] != 0 ; } ) ;
+}
+
+bool is_antidiagonal( const std::vector<std::vector<int>> & matrix ) {
+ int len = matrix.size( ) ;
+ std::vector<int> positions( len ) ;
+ std::iota( positions.begin( ) , positions.end( ) , 0 ) ;
+ return std::all_of( positions.begin( ) , positions.end( ) , [&matrix,len]( int i )
+ { return matrix[i][len - 1 - i] != 0 ; } ) ;
+}
+
+bool rest_zero( const std::vector<std::vector<int>> & matrix ) {
+ int len = matrix.size( ) ;
+ for ( int row = 0 ; row < len ; row++ ) {
+ for ( int col = 0 ; col < len ; col++ ) {
+ if ( row != col && row + col != len - 1 && matrix[row][col] != 0 )
+ return false ;
+ }
+ }
+ return true ;
+}
+
+int main( ) {
+ std::vector<std::vector<int>> matrix ;
+ std::vector<int> row { enter_row( ) } ;
+ int len = row.size( ) ;
+ matrix.push_back( row ) ;
+ for ( int i = 0 ; i < len - 1 ; i++ ) {
+ row = enter_row( ) ;
+ matrix.push_back( row ) ;
+ }
+ if ( is_diagonal( matrix ) && is_antidiagonal( matrix ) && rest_zero( matrix ) )
+ std::cout << "true\n" ;
+ else
+ std::cout << "false\n" ;
+ return 0 ;
+}
diff --git a/challenge-266/ulrich-rieke/haskell/ch-1.hs b/challenge-266/ulrich-rieke/haskell/ch-1.hs
new file mode 100755
index 0000000000..0e6224a985
--- /dev/null
+++ b/challenge-266/ulrich-rieke/haskell/ch-1.hs
@@ -0,0 +1,20 @@
+module Challenge266
+ where
+import qualified Data.Set as S
+
+solution :: String -> String -> [String]
+solution s1 s2 =
+ let firstWords = words s1
+ secondWords = words s2
+ allWords = S.toList $ S.fromList (firstWords ++ secondWords)
+ frequencies = map (\w ->(w , (length $ filter ( == w ) firstWords) + (length $
+ filter ( == w ) secondWords ) ) ) allWords
+ in if null frequencies then [] else map fst $ filter ( (== 1 ) . snd ) frequencies
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some words, separated by blanks!"
+ firstWords <- getLine
+ putStrLn "Enter some more words, separated by blanks!"
+ secondWords <- getLine
+ print $ solution firstWords secondWords
diff --git a/challenge-266/ulrich-rieke/haskell/ch-2.hs b/challenge-266/ulrich-rieke/haskell/ch-2.hs
new file mode 100755
index 0000000000..6497043fba
--- /dev/null
+++ b/challenge-266/ulrich-rieke/haskell/ch-2.hs
@@ -0,0 +1,37 @@
+module Challenge266_2
+ where
+import Data.List ( (!!) )
+
+isSquare :: [[Int]] -> Bool
+isSquare matrix = all (\i -> length ( matrix !! i ) == l ) [0..l - 1]
+ where
+ l :: Int
+ l = length matrix
+
+condition :: [[Int]] -> Bool
+condition matrix = all ( /= 0 ) [(matrix !! r ) !! c | r <- [0..l - 1] ,
+ c <- [0..l - 1] , r == c ] && all ( /= 0 ) [(matrix !! r ) !! c | r <-
+ [0..l - 1] , c <- [0..l - 1] , r + c == l - 1] && all ( == 0 ) [(matrix !! r ) !! c |
+ r <- [0..l - 1] , c <- [0..l - 1 ] , r /= c , r + c /= l - 1 ]
+ where
+ l :: Int
+ l = length 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 some integers separated by blanks!"
+ numberstrings <- getLine
+ restLines <- enterNLines ( length ( words numberstrings ) - 1 )
+ let numstrings = (numberstrings:restLines)
+ matrix = map ( map read . words ) numstrings
+ if and [isSquare matrix , condition matrix] then print "true" else print "false"
diff --git a/challenge-266/ulrich-rieke/perl/ch-1.pl b/challenge-266/ulrich-rieke/perl/ch-1.pl
new file mode 100755
index 0000000000..d942fe778b
--- /dev/null
+++ b/challenge-266/ulrich-rieke/perl/ch-1.pl
@@ -0,0 +1,24 @@
+#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+say "Enter some words, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @firstWords = split( /\s+/ , $line ) ;
+say "Enter some more words, separated by blanks!" ;
+$line = <STDIN> ;
+chomp $line ;
+my @secondWords = split( /\s+/ , $line ) ;
+my %frequencies ;
+map { $frequencies{$_}++ } @firstWords ;
+map { $frequencies{$_}++ } @secondWords ;
+my @rareWords = grep { $frequencies{$_} == 1 } keys %frequencies ;
+if ( @rareWords ) {
+ print "(" ;
+ say join( ',' , @rareWords ) . ')' ;
+}
+else {
+ say "( )" ;
+}
diff --git a/challenge-266/ulrich-rieke/perl/ch-2.pl b/challenge-266/ulrich-rieke/perl/ch-2.pl
new file mode 100755
index 0000000000..71610fc4d8
--- /dev/null
+++ b/challenge-266/ulrich-rieke/perl/ch-2.pl
@@ -0,0 +1,64 @@
+#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+sub enter_line {
+ say "Enter some integers, separated by blanks!" ;
+ my $line = <STDIN> ;
+ chomp $line ;
+ my @numbers = split( /\s+/ , $line ) ;
+ return @numbers ;
+}
+
+sub is_diagonal {
+ my $matrix = shift ;
+ my $len = scalar( @$matrix ) ;
+ for my $i ( 0..$len - 1 ) {
+ if ( $matrix->[$i]->[$i] == 0 ) {
+ return 0 ;#diagonal shouldn't be zero so it's wrong, return 0
+ }
+ }
+ return 1 ; #unless true
+}
+
+sub is_antidiagonal {
+ my $matrix = shift ;
+ my $len = scalar( @$matrix ) ;
+ for my $row ( 0..$len - 1 ) {
+ if ( $matrix->[$row]->[$len - 1 - $row] == 0 ) {
+ return 0 ;#antidiagonal shouldn't be zero so it's wrong!
+ }
+ }
+ return 1 ;
+}
+
+sub rest_zero {
+ my $matrix = shift ;
+ my $len = scalar( @$matrix ) ;
+ for my $row( 0..$len - 1 ) {
+ for my $col ( 0..$len - 1 ) {
+ if ( $row != $col && $row + $col != $len - 1 && $matrix->[$row]->[$col]
+ != 0 ) {
+ return 0 ;
+ }
+ }
+ }
+ return 1 ;
+}
+
+my @matrix ;
+my @row = enter_line( ) ;
+my $len = scalar( @row ) ;
+push( @matrix , \@row ) ;
+#enforce entry of a square matrix!
+for (1..$len - 1) {
+ my @new_row = enter_line( ) ;
+ push( @matrix , \@new_row ) ;
+}
+if ( is_diagonal( \@matrix ) && is_antidiagonal(\@matrix) && rest_zero( \@matrix )) {
+ say "true" ;
+}
+else {
+ say "false" ;
+}
diff --git a/challenge-266/ulrich-rieke/raku/ch-1.raku b/challenge-266/ulrich-rieke/raku/ch-1.raku
new file mode 100755
index 0000000000..2613f4d66b
--- /dev/null
+++ b/challenge-266/ulrich-rieke/raku/ch-1.raku
@@ -0,0 +1,19 @@
+use v6 ;
+
+say "Enter some words, separated by blanks!" ;
+my $line = $*IN.get ;
+my @firstWords = $line.words ;
+say "Enter some more words, separated by blanks!" ;
+$line = $*IN.get ;
+my @secondWords = $line.words ;
+my %frequencies ;
+@firstWords.map( {%frequencies{$_}++ } ) ;
+@secondWords.map( {%frequencies{$_}++ } ) ;
+my @rareWords = %frequencies.keys.grep( {%frequencies{$_} == 1 } ) ;
+if ( @rareWords ) {
+ print "(" ;
+ say @rareWords.join( ',' ) ~ ")" ;
+}
+else {
+ say "()" ;
+}
diff --git a/challenge-266/ulrich-rieke/rust/ch-1.rs b/challenge-266/ulrich-rieke/rust/ch-1.rs
new file mode 100755
index 0000000000..dc3f860b93
--- /dev/null
+++ b/challenge-266/ulrich-rieke/rust/ch-1.rs
@@ -0,0 +1,29 @@
+use std::io ;
+
+fn main() {
+ println!("Enter some words, separated by blanks!");
+ let mut firstline : String = String::new( ) ;
+ io::stdin( ).read_line( &mut firstline ).unwrap( ) ;
+ let firstwords : &str = &*firstline ;
+ println!("Enter some more words, separated by blanks!" ) ;
+ let mut secondline : String = String::new( ) ;
+ io::stdin( ).read_line( &mut secondline ).unwrap( ) ;
+ let secondwords : &str = &*secondline ;
+ let first_col : Vec<&str> = firstwords.split_whitespace( ).map( | s | s.trim( ) ).
+ collect( ) ;
+ let second_col : Vec<&str> = secondwords.split_whitespace( ).map( | s | s.trim( ) ).
+ collect( ) ;
+ let mut all_words : Vec<&str> = Vec::new( ) ;
+ for w in &first_col {
+ all_words.push( w ) ;
+ }
+ for w in &second_col {
+ all_words.push( w ) ;
+ }
+ println!("{:?}" , all_words.into_iter( ).filter( | &w | {
+ (first_col.iter( ).filter( | st | **st == w ).count( ) == 1 &&
+ second_col.iter( ).filter( |st | **st == w ).count( ) == 0 ) ||
+ (first_col.iter( ).filter( | st | **st == w ).count( ) == 0 &&
+ second_col.iter( ).filter( |st | **st == w ).count( ) == 1 ) } ).
+ collect::<Vec<&str>>( ) ) ;
+}
diff --git a/challenge-266/ulrich-rieke/rust/ch-2.rs b/challenge-266/ulrich-rieke/rust/ch-2.rs
new file mode 100755
index 0000000000..fa87fe6add
--- /dev/null
+++ b/challenge-266/ulrich-rieke/rust/ch-2.rs
@@ -0,0 +1,58 @@
+use std::io;
+
+fn enter_line( ) -> Vec<i32> {
+ 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.split_whitespace( ).map ( | s |
+ s.trim( ).parse::<i32>( ).unwrap( )).collect( ) ;
+ numbers
+}
+
+fn is_diagonal( numbers : &Vec<Vec<i32>> ) -> bool {
+ let len : usize = numbers.len( ) ;
+ (0..len).all( | i | {
+ let row = &numbers[ i ] ;
+ row[ i ] != 0
+ } )
+}
+
+fn is_antidiagonal( numbers : &Vec<Vec<i32>> ) -> bool {
+ let len : usize = numbers.len( ) ;
+ (0..len).all( | i | {
+ let row = &numbers[ i ] ;
+ row[len - 1 - i ] != 0
+ } )
+}
+
+fn rest_zero( numbers : &Vec<Vec<i32>> ) -> bool {
+ let len : usize = numbers.len( ) ;
+ (0..len).all( | i | {
+ let row = &numbers[ i ] ;
+ for col in 0..len {
+ if i != col && i + col != len - 1 && row[ col ] != 0 {
+ return false ;
+ }
+ }
+ true
+ } )
+}
+
+fn main() {
+ let mut matrix : Vec<Vec<i32>> = Vec::new ( ) ;
+ let row : Vec<i32> = enter_line( ) ;
+ let len : usize = row.len( ) ;
+ matrix.push( row ) ;
+ for _ in 0..len - 1 { // this guarantees input of a square matrix
+ let new_row : Vec<i32> = enter_line( ) ;
+ matrix.push( new_row ) ;
+ }
+ if is_diagonal( &matrix ) && is_antidiagonal( &matrix ) && rest_zero(
+ &matrix ) {
+ println!( "true" ) ;
+ }
+ else {
+ println!("false") ;
+ }
+}
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 4f9da14749..880993e129 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -1,44 +1,166 @@
{
- "chart" : {
- "type" : "column"
+ "plotOptions" : {
+ "series" : {
+ "borderWidth" : 0,
+ "dataLabels" : {
+ "enabled" : 1,
+ "format" : "{point.y}"
+ }
+ }
},
- "title" : {
- "text" : "The Weekly Challenge - 266"
+ "yAxis" : {
+ "title" : {
+ "text" : "Total Solutions"
+ }
+ },
+ "series" : [
+ {
+ "data" : [
+ {
+ "name" : "Ali Moradi",
+ "drilldown" : "Ali Moradi",
+ "y" : 5
+ },
+ {
+ "name" : "David Ferrone",
+ "y" : 2,
+ "drilldown" : "David Ferrone"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "E. Choroba",
+ "name" : "E. Choroba"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Feng Chang",
+ "name" : "Feng Chang"
+ },
+ {
+ "drilldown" : "Laurent Rosenfeld",
+ "y" : 3,
+ "name" : "Laurent Rosenfeld"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Lubos Kolouch",
+ "name" : "Lubos Kolouch"
+ },
+ {
+ "y" : 11,
+ "drilldown" : "Luca Ferrari",
+ "name" : "Luca Ferrari"
+ },
+ {
+ "name" : "Mark Anderson",
+ "y" : 2,
+ "drilldown" : "Mark Anderson"
+ },
+ {
+ "name" : "Matthew Neleigh",
+ "drilldown" : "Matthew Neleigh",
+ "y" : 2
+ },
+ {
+ "name" : "Niels van Dijke",
+ "y" : 2,
+ "drilldown" : "Niels van Dijke"
+ },
+ {
+ "name" : "Peter Campbell Smith",
+ "y" : 3,
+ "drilldown" : "Peter Campbell Smith"
+ },
+ {
+ "drilldown" : "Peter Meszaros",
+ "y" : 2,
+ "name" : "Peter Meszaros"
+ },
+ {
+ "drilldown" : "Reinier Maliepaard",
+ "y" : 3,
+ "name" : "Reinier Maliepaard"
+ },
+ {
+ "name" : "Roger Bell_West",
+ "drilldown" : "Roger Bell_West",
+ "y" : 4
+ },
+ {
+ "drilldown" : "Ulrich Rieke",
+ "y" : 3,
+ "name" : "Ulrich Rieke"
+ },
+ {
+ "name" : "W. Luis Mochan",
+ "y" : 3,
+ "drilldown" : "W. Luis Mochan"
+ }
+ ],
+ "name" : "The Weekly Challenge - 266",
+ "colorByPoint" : 1
+ }
+ ],
+ "legend" : {
+ "enabled" : 0
+ },
+ "xAxis" : {
+ "type" : "category"
+ },
+ "subtitle" : {
+ "text" : "[Champions: 16] Last updated at 2024-04-24 18:16:58 GMT"
},
"drilldown" : {
"series" : [
{
+ "id" : "Ali Moradi",
+ "data" : [
+ [
+ "Perl",
+ 2
+ ],
+ [
+ "Raku",
+ 2
+ ],
+ [
+ "Blog",
+ 1
+ ]
+ ],
+ "name" : "Ali Moradi"
+ },
+ {
"id" : "David Ferrone",
- "name" : "David Ferrone",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "David Ferrone"
},
{
+ "name" : "E. Choroba",
"data" : [
[
"Perl",
2
]
],
- "id" : "E. Choroba",
- "name" : "E. Choroba"
+ "id" : "E. Choroba"
},
{
+ "name" : "Feng Chang",
"data" : [
[
"Raku",
2
]
],
- "id" : "Feng Chang",
- "name" : "Feng Chang"
+ "id" : "Feng Chang"
},
{
- "id" : "Laurent Rosenfeld",
"name" : "Laurent Rosenfeld",
"data" : [
[
@@ -53,17 +175,18 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Laurent Rosenfeld"
},
{
"name" : "Lubos Kolouch",
- "id" : "Lubos Kolouch",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Lubos Kolouch"
},
{
"data" : [
@@ -80,38 +203,38 @@
"name" : "Luca Ferrari"
},
{
+ "name" : "Mark Anderson",
+ "id" : "Mark Anderson",
"data" : [
[
"Raku",
2
]
- ],
- "id" : "Mark Anderson",
- "name" : "Mark Anderson"
+ ]
},
{
- "id" : "Matthew Neleigh",
"name" : "Matthew Neleigh",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Matthew Neleigh"
},
{
+ "id" : "Niels van Dijke",
"data" : [
[
"Perl",
2
]
],
- "name" : "Niels van Dijke",
- "id" : "Niels van Dijke"
+ "name" : "Niels van Dijke"
},
{
- "id" : "Peter Campbell Smith",
"name" : "Peter Campbell Smith",
+ "id" : "Peter Campbell Smith",
"data" : [
[
"Perl",
@@ -130,8 +253,8 @@
2
]
],
- "name" : "Peter Meszaros",
- "id" : "Peter Meszaros"
+ "id" : "Peter Meszaros",
+ "name" : "Peter Meszaros"
},
{
"name" : "Reinier Maliepaard",
@@ -148,7 +271,6 @@
]
},
{
- "name" : "Roger Bell_West",
"id" : "Roger Bell_West",
"data" : [
[
@@ -159,10 +281,24 @@
"Raku",
2
]
- ]
+ ],
+ "name" : "Roger Bell_West"
+ },
+ {
+ "id" : "Ulrich Rieke",
+ "data" : [
+ [
+ "Perl",
+ 2
+ ],
+ [
+ "Raku",
+ 1
+ ]
+ ],
+ "name" : "Ulrich Rieke"
},
{
- "name" : "W. Luis Mochan",
"id" : "W. Luis Mochan",
"data" : [
[
@@ -173,114 +309,20 @@
"Blog",
1
]
- ]
+ ],
+ "name" : "W. Luis Mochan"
}
]
},
- "yAxis" : {
- "title" : {
- "text" : "Total Solutions"
- }
- },
- "xAxis" : {
- "type" : "category"
- },
- "subtitle" : {
- "text" : "[Champions: 14] Last updated at 2024-04-24 12:15:02 GMT"
+ "chart" : {
+ "type" : "column"
},
- "legend" : {
- "enabled" : 0
+ "title" : {
+ "text" : "The Weekly Challenge - 266"
},
"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/>"
- },
- "series" : [
- {
- "colorByPoint" : 1,
- "data" : [
- {
- "drilldown" : "David Ferrone",
- "name" : "David Ferrone",
- "y" : 2
- },
- {
- "drilldown" : "E. Choroba",
- "y" : 2,
- "name" : "E. Choroba"
- },
- {
- "name" : "Feng Chang",
- "y" : 2,
- "drilldown" : "Feng Chang"
- },
- {
- "drilldown" : "Laurent Rosenfeld",
- "y" : 3,
- "name" : "Laurent Rosenfeld"
- },
- {
- "drilldown" : "Lubos Kolouch",
- "name" : "Lubos Kolouch",
- "y" : 2
- },
- {
- "drilldown" : "Luca Ferrari",
- "name" : "Luca Ferrari",
- "y" : 11
- },
- {
- "name" : "Mark Anderson",
- "y" : 2,
- "drilldown" : "Mark Anderson"
- },
- {
- "drilldown" : "Matthew Neleigh",
- "name" : "Matthew Neleigh",
- "y" : 2
- },
- {
- "drilldown" : "Niels van Dijke",
- "name" : "Niels van Dijke",
- "y" : 2
- },
- {
- "drilldown" : "Peter Campbell Smith",
- "name" : "Peter Campbell Smith",
- "y" : 3
- },
- {
- "name" : "Peter Meszaros",
- "y" : 2,
- "drilldown" : "Peter Meszaros"
- },
- {
- "drilldown" : "Reinier Maliepaard",
- "name" : "Reinier Maliepaard",
- "y" : 3
- },
- {
- "drilldown" : "Roger Bell_West",
- "name" : "Roger Bell_West",
- "y" : 4
- },
- {
- "drilldown" : "W. Luis Mochan",
- "y" : 3,
- "name" : "W. Luis Mochan"
- }
- ],
- "name" : "The Weekly Challenge - 266"
- }
- ],
- "plotOptions" : {
- "series" : {
- "borderWidth" : 0,
- "dataLabels" : {
- "enabled" : 1,
- "format" : "{point.y}"
- }
- }
+ "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/>"
}
}
diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json
index cb442cdd40..963e8f444e 100644
--- a/stats/pwc-language-breakdown-summary.json
+++ b/stats/pwc-language-breakdown-summary.json
@@ -1,41 +1,53 @@
{
+ "tooltip" : {
+ "pointFormat" : "<b>{point.y:.0f}</b>"
+ },
+ "subtitle" : {
+ "text" : "Last updated at 2024-04-24 18:16:58 GMT"
+ },
+ "title" : {
+ "text" : "The Weekly Challenge Contributions [2019 - 2024]"
+ },
+ "chart" : {
+ "type" : "column"
+ },
+ "yAxis" : {
+ "min" : 0,
+ "title" : {
+ "text" : null
+ }
+ },
"series" : [
{
+ "name" : "Contributions",
+ "dataLabels" : {
+ "align" : "right",
+ "style" : {
+ "fontFamily" : "Verdana, sans-serif",
+ "fontSize" : "13px"
+ },
+ "rotation" : -90,
+ "color" : "#FFFFFF",
+ "format" : "{point.y:.0f}",
+ "y" : 10,
+ "enabled" : "true"
+ },
"data" : [
[
"Blog",
- 4781
+ 4782
],
[
"Perl",
- 13769
+ 13773
],
[
"Raku",
-