diff options
| -rw-r--r-- | challenge-149/colin-crain/blog1.txt | 1 | ||||
| -rwxr-xr-x | challenge-149/colin-crain/perl/ch-1.pl | 60 | ||||
| -rwxr-xr-x | challenge-149/colin-crain/perl/ch-2.pl | 154 | ||||
| -rwxr-xr-x | challenge-149/colin-crain/raku/ch-1.raku | 30 | ||||
| -rwxr-xr-x | challenge-149/colin-crain/raku/ch-2.raku | 38 | ||||
| -rwxr-xr-x | challenge-149/pete-houston/perl/ch-1.pl | 48 | ||||
| -rwxr-xr-x | challenge-149/pete-houston/perl/ch-2.pl | 79 | ||||
| -rw-r--r-- | stats/pwc-current.json | 221 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown-summary.json | 62 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown.json | 2006 | ||||
| -rw-r--r-- | stats/pwc-leaders.json | 416 | ||||
| -rw-r--r-- | stats/pwc-summary-1-30.json | 24 | ||||
| -rw-r--r-- | stats/pwc-summary-121-150.json | 106 | ||||
| -rw-r--r-- | stats/pwc-summary-151-180.json | 32 | ||||
| -rw-r--r-- | stats/pwc-summary-181-210.json | 44 | ||||
| -rw-r--r-- | stats/pwc-summary-211-240.json | 46 | ||||
| -rw-r--r-- | stats/pwc-summary-241-270.json | 44 | ||||
| -rw-r--r-- | stats/pwc-summary-31-60.json | 46 | ||||
| -rw-r--r-- | stats/pwc-summary-61-90.json | 38 | ||||
| -rw-r--r-- | stats/pwc-summary-91-120.json | 126 | ||||
| -rw-r--r-- | stats/pwc-summary.json | 572 |
21 files changed, 2313 insertions, 1880 deletions
diff --git a/challenge-149/colin-crain/blog1.txt b/challenge-149/colin-crain/blog1.txt new file mode 100644 index 0000000000..563eb7702e --- /dev/null +++ b/challenge-149/colin-crain/blog1.txt @@ -0,0 +1 @@ +https://colincrain.com/2022/01/30/that-big-ol-squarell-be-just-perfect diff --git a/challenge-149/colin-crain/perl/ch-1.pl b/challenge-149/colin-crain/perl/ch-1.pl new file mode 100755 index 0000000000..8bc3c45c2f --- /dev/null +++ b/challenge-149/colin-crain/perl/ch-1.pl @@ -0,0 +1,60 @@ +#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# fib-sums.pl
+#
+# Fibonacci Digit Sum
+#
+# Submitted by: Roger Bell_West
+#
+# Given an input $N, generate the first $N numbers for which the
+# sum of their digits is a Fibonacci number.
+#
+# Example
+# f(20)=[0, 1, 2, 3, 5, 8, 10, 11, 12, 14, 17, 20, 21, 23, 26, 30, 32, 35, 41, 44]
+
+# 6591 <-- 1,000th value
+# 13380892 <-- 1,000,000th value
+#
+#
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+my $N = shift // 1081;
+my $candidate;
+my @out = (0);
+
+while ( ++$candidate ) {
+ push @out, $candidate if is_fib( digisum($candidate) );
+ last if @out == $N;
+}
+
+local $" = ', ';
+say "@out";
+
+sub digisum ( $num ) {
+ my $sum;
+ $sum += substr $num, $_-1, 1 for (1..length $num);
+ return $sum;
+}
+
+sub is_fib ( $num ) {
+ state @fibs = ( 0, 1 );
+ state %fhash = map { $_ => undef } @fibs;
+ while ( $fibs[-1]+$fibs[-2] <= $num ) {
+ my $next = $fibs[-1]+$fibs[-2];
+ push @fibs, $next;
+ $fhash{$next} = undef;
+ }
+ return 1 if exists $fhash{$num};
+ return 0;
+}
+
diff --git a/challenge-149/colin-crain/perl/ch-2.pl b/challenge-149/colin-crain/perl/ch-2.pl new file mode 100755 index 0000000000..839e27e003 --- /dev/null +++ b/challenge-149/colin-crain/perl/ch-2.pl @@ -0,0 +1,154 @@ +#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# big-ole-p-square.pl
+#
+# Largest Square
+# Submitted by: Roger Bell_West
+#
+# Given a number base, derive the largest perfect square with no
+# repeated digits and return it as a string.
+# (For base>10, use ‘A’..‘Z’.)
+#
+# Example:
+# f(2)="1"
+# f(4)="3201"
+# f(10)="9814072356"
+# f(12)="B8750A649321"
+#
+# in base 13: CC5244 squared is CBA504216873
+
+# found 198003269696 squared is: 3.92052948103069e+22
+# in base 18: HH79A9GDE squared is HGF1937D5B4E06A8C2
+# real 22m8.960s
+# user 16m5.258s
+# sys 3m7.834s
+
+# found 1404376502502 squared is: 1.97227336077975e+24
+# in base 19: 46D2400C25 squared is IHGD2B086517E3ACF94
+# real 82m49.393s
+# user 82m38.563s
+# sys 0m2.744s
+
+
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+my $base = shift // 12;
+
+decrements ( $base );
+# constructive( $base ); <-- to call the constructive permutations method
+
+
+## decrementing solution:
+## from the square root of the largest base-digit number
+## square and check for repeating digits pass/fail
+sub decrements ( $base ) {
+ my @alpha = ( 0..9, "A".."Z" );
+ my $maxbase = join '', reverse @alpha[0..$base-1];
+ my $max = int sqrt(base2dec( $maxbase, $base));
+ say "decrementing from $max";
+
+ my %h;
+ MAX: while ($max--) {
+ %h = ();
+ ## inlined convert square to base and detect repeats code
+ my $num = $max * $max;
+ while ( $num > 0 ) {
+ ++$h{$num % $base} > 1 and next MAX ;
+ $num = int( $num/$base );
+ }
+
+ ## print result found
+ say "found $max squared is: ", $max * $max;
+ my $bout = dec2base( $max, $base );
+ my $bsqout = dec2base( $max * $max, $base );
+ say "in base $base: $bout squared is $bsqout";
+ last;
+ }
+}
+
+
+sub repeats ( $num ) {
+## checks for repeating digits pass/fail
+ my %h;
+ ++$h{$_} > 1 and return 1 for split //, $num ;
+ return 0;
+}
+
+sub dec2base ( $num, $base ) {
+## converts from base-10 to base-n : n = 2..36
+ my @alpha = ( 0..9, "A".."Z" );
+ my $rem;
+ my $val = '';
+ while ( $num > 0 ) {
+ ($num, $rem) = (int( $num/$base ), $num % $base);
+ $val = $alpha[$rem] . $val;
+ }
+ return $val;
+}
+
+sub repeats_in_base ( $num, $base ) {
+## combined dec2base + repeats code, pass/fail
+ my %h;
+ while ( $num > 0 ) {
+ ++$h{$num % $base} > 1 and return 1 ;
+ $num = int( $num/$base );
+ }
+}
+
+sub base2dec( $num, $base ) {
+ my %alpha;
+ my $n ;
+ $alpha{$_} = $n++ for ( 0..9, "A".."Z" );
+ my $out;
+ my $pos = 0;
+ for ( reverse split //, $num ) {
+ $out += $alpha{$_} * $base ** $pos++;
+ }
+ return $out;
+}
+
+
+### constructing complete solutions from all digits in base
+### and testing for squareness
+
+sub constructive ( $base ) {
+ use Algorithm::Combinatorics qw( permutations );
+
+ my @arr = reverse (0..$base-1);
+ my $iter = permutations( \@arr );
+ my $c;
+ my $dec;
+ say "permuting @arr";
+
+ while (my $p = $iter->next) {
+ $dec = perm2dec( $p, $base );
+ my $sq = int sqrt $dec;
+ last if $sq * $sq == $dec;
+ }
+
+ say "constructive:";
+ say "found $dec" ;
+ my $bout = dec2base( $dec, $base );
+ say "in base $base: $bout";
+}
+
+sub perm2dec ( $arr, $base ) {
+ my $out;
+ my $pos = 0;
+ for ( reverse $arr->@* ) {
+ $out += $_ * $base ** $pos++;
+ }
+ return $out;
+}
+
+
diff --git a/challenge-149/colin-crain/raku/ch-1.raku b/challenge-149/colin-crain/raku/ch-1.raku new file mode 100755 index 0000000000..e765e25ce3 --- /dev/null +++ b/challenge-149/colin-crain/raku/ch-1.raku @@ -0,0 +1,30 @@ +#!/usr/bin/env perl6 +# +# +# fib-sums.raku +# +# +# +# © 2022 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +unit sub MAIN ( $N = 25 ) ; + +sub is_fib ( $num ) { + state @fibs = (0, 1, 1, * + * ... *); + state %fh; + state $n = 0; + while @fibs[$n] < $num { + %fh{ @fibs[++$n] } = 1; + } + + return %fh{$num}:exists + ?? 1 + !! 0 +} + +my @out = (0, | grep { is_fib( $_.comb.sum ) }, (0..*) )[0..$N-1]; +say @out; + diff --git a/challenge-149/colin-crain/raku/ch-2.raku b/challenge-149/colin-crain/raku/ch-2.raku new file mode 100755 index 0000000000..001dd97105 --- /dev/null +++ b/challenge-149/colin-crain/raku/ch-2.raku @@ -0,0 +1,38 @@ +#!/usr/bin/env perl6 +# +# +# big-ole-p-square.raku +# +# +# +# © 2022 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +unit sub MAIN ( $base = 8 ) ; + + +my $max = (1 ~ 0 x $base).parse-base($base) + .sqrt + .Int ; + +repeat { $max-- } while repeats-in-base( $max², $base ); + +say qq:to/END/; + found $max squared is {$max²} + in base $base: {$max.base($base)} squared is {$max².base($base)} + END + + +sub repeats-in-base ( $num, $base ) { + + return ($num.base($base) + .comb + .Bag + .values + .sort)[*-1] > 1 + ?? 1 + !! 0 ; +} + diff --git a/challenge-149/pete-houston/perl/ch-1.pl b/challenge-149/pete-houston/perl/ch-1.pl new file mode 100755 index 0000000000..83a5ba4608 --- /dev/null +++ b/challenge-149/pete-houston/perl/ch-1.pl @@ -0,0 +1,48 @@ +#!/usr/bin/env perl +#=============================================================================== +# +# FILE: 14901.pl +# +# USAGE: ./14901.pl N +# +# DESCRIPTION: Output the first N whole numbers for which the sum of their +# digits is a Fibonacci number. +# +# OPTIONS: N defaults to 20 if missing +# REQUIREMENTS: List::Util +# AUTHOR: Pete Houston (pete), cpan@openstrike.co.uk +# ORGANIZATION: Openstrike +# VERSION: 1.0 +# CREATED: 24/01/22 +#=============================================================================== + +use strict; +use warnings; + +use List::Util 'sum'; + +my $n = $ARGV[0] // 20; +my @fib = (0, 1); +my %is_fib = (0 => 1, 1 => 1); +my $i = -1; +my @found; + +die "Argument must be a natural number.\n" unless $n =~ /^[1-9][0-9]*$/; + +while (@found < $n) { + # Sum the digits + my $sum = sum split //, ++$i; + + while ($sum > $fib[-1]) { + + # Add an element to the Fibonacci list + my $next = $fib[-2] + $fib[-1]; + push @fib, $next; + + # Pop it in the hash too + $is_fib{$next} = 1; + } + push @found, $i if $is_fib{$sum}; +} + +print "f($n) = [" . join (', ', @found) . "]\n"; diff --git a/challenge-149/pete-houston/perl/ch-2.pl b/challenge-149/pete-houston/perl/ch-2.pl new file mode 100755 index 0000000000..0ac006778f --- /dev/null +++ b/challenge-149/pete-houston/perl/ch-2.pl @@ -0,0 +1,79 @@ +#!/usr/bin/env perl +#=============================================================================== +# +# FILE: 14902.pl +# +# USAGE: ./14902.pl N +# +# DESCRIPTION: Given a base N find the largest perfect square in that +# base with no repeated digits +# +# OPTIONS: N defaults to 10 if missing +# REQUIREMENTS: Perl 5.9.5 for Module::Load::Conditional, Convert::AnyBase, +# either List::Util 1.44 or List::MoreUtils or +# List::SomeUtils +# BUGS: Going to take a long time for large N +# NOTES: Convert::AnyBase uses Moose, so this will be quite heavy. +# AUTHOR: Pete Houston (pete), cpan@openstrike.co.uk +# ORGANIZATION: Openstrike +# VERSION: 1.0 +# CREATED: 24/01/22 +#=============================================================================== + +use strict; +use warnings; +use 5.009_005; +use bigint; + +use Convert::AnyBase; +use Module::Load::Conditional qw/check_install can_load/; + +BEGIN { + my @list = ( + { + module => 'List::Util', + version => '1.44' + }, + { + module => 'List::MoreUtils' + }, + { + module => 'List::SomeUtils' + } + ); + my $ok = 0; + for my $mod (@list) { + my $this = check_install (%$mod) or next; + next unless $this->{uptodate}; + $ok = can_load (modules => {$mod->{module} => $mod->{version}}); + $mod->{module}->import ('uniq'); + last; + } + die "Need one of the List::* modules for uniq\n" unless $ok; +} + +my $n = shift // 10; +die "Run out of symbols\n" if $n > 36; + +my $set = substr ('0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ', 0, $n); +my $cab = Convert::AnyBase->new (set => $set); + +# Start with the largest possible number +my $start = reverse $set; +my $dec = $cab->decode ($start); +my $root = sqrt ($dec); +exit 1 - print "$start\n" if $root == int $root; + +# Unlikely to be that lucky, so on down we go ... +$root = int $root; +my $sqb; +do { + $sqb = $cab->encode ($root * $root); + $root--; +} until $root < 0 || unique_digits ($sqb); +print "$sqb\n"; + +sub unique_digits { + my @x = split //, shift; + return @x == uniq @x; +} diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 7ab30ff6cd..df2e180504 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,15 +1,26 @@ { - "yAxis" : { - "title" : { - "text" : "Total Solutions" + "chart" : { + "type" : "column" + }, + "plotOptions" : { + "series" : { + "borderWidth" : 0, + "dataLabels" : { + "format" : "{point.y}", + "enabled" : 1 + } } }, "legend" : { "enabled" : 0 }, + "subtitle" : { + "text" : "[Champions: 24] Last updated at 2022-01-31 01:24:52 GMT" + }, "drilldown" : { "series" : [ { + "name" : "Abigail", "data" : [ [ "Perl", @@ -20,8 +31,7 @@ 2 ] ], - "id" : "Abigail", - "name" : "Abigail" + "id" : "Abigail" }, { "name" : "Alexander Pankoff", @@ -34,7 +44,6 @@ "id" : "Alexander Pankoff" }, { - "id" : "Athanasius", "data" : [ [ "Perl", @@ -45,10 +54,10 @@ 2 ] ], + "id" : "Athanasius", "name" : "Athanasius" }, { - "id" : "Cheok-Yin Fung", "data" : [ [ "Perl", @@ -59,21 +68,29 @@ 1 ] ], + "id" : "Cheok-Yin Fung", "name" : "Cheok-Yin Fung" }, { - "id" : "Colin Crain", "data" : [ [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ], + [ "Blog", - 1 + 2 ] ], + "id" : "Colin Crain", "name" : "Colin Crain" }, { "name" : "Dave Jacoby", - "id" : "Dave Jacoby", "data" : [ [ "Perl", @@ -83,7 +100,8 @@ "Blog", 2 ] - ] + ], + "id" : "Dave Jacoby" }, { "name" : "E. Choroba", @@ -97,7 +115,6 @@ }, { "name" : "Flavio Poletti", - "id" : "Flavio Poletti", "data" : [ [ "Perl", @@ -111,10 +128,11 @@ "Blog", 2 ] - ] + ], + "id" : "Flavio Poletti" }, { - "name" : "James Smith", + "id" : "James Smith", "data" : [ [ "Perl", @@ -125,30 +143,30 @@ 1 ] ], - "id" : "James Smith" + "name" : "James Smith" }, { - "name" : "Jan Krnavek", "id" : "Jan Krnavek", "data" : [ [ "Raku", 2 ] - ] + ], + "name" : "Jan Krnavek" }, { + "id" : "Jorg Sommrey", "data" : [ [ "Perl", 2 ] ], - "id" : "Jorg Sommrey", "name" : "Jorg Sommrey" }, { - "name" : "Laurent Rosenfeld", + "id" : "Laurent Rosenfeld", "data" : [ [ "Perl", @@ -163,19 +181,20 @@ 1 ] ], - "id" : "Laurent Rosenfeld" + "name" : "Laurent Rosenfeld" }, { - "id" : "Lubos Kolouch", + "name" : "Lubos Kolouch", "data" : [ [ "Perl", 1 ] ], - "name" : "Lubos Kolouch" + "id" : "Lubos Kolouch" }, { + "name" : "Luca Ferrari", "id" : "Luca Ferrari", "data" : [ [ @@ -186,28 +205,27 @@ "Blog", 2 ] - ], - "name" : "Luca Ferrari" + ] }, { - "name" : "Mark Anderson", + "id" : "Mark Anderson", "data" : [ [ "Raku", 2 ] ], - "id" : "Mark Anderson" + "name" : "Mark Anderson" }, { - "name" : "Matthew Neleigh", + "id" : "Matthew Neleigh", "data" : [ [ "Perl", 2 ] ], - "id" : "Matthew Neleigh" + "name" : "Matthew Neleigh" }, { "id" : "Mohammad S Anwar", @@ -224,17 +242,27 @@ "name" : "Mohammad S Anwar" }, { + "name" : "Niels van Dijke", "id" : "Niels van Dijke", "data" : [ [ "Perl", 1 ] - ], - "name" : "Niels van Dijke" + ] }, { - "name" : "Peter Campbell Smith", + "name" : "Pete Houston", + "id" : "Pete Houston", + "data" : [ + [ + "Perl", + 2 + ] + ] + }, + { + "id" : "Peter Campbell Smith", "data" : [ [ "Perl", @@ -245,19 +273,20 @@ 1 ] ], - "id" : "Peter Campbell Smith" + "name" : "Peter Campbell Smith" }, { - "name" : "Robert DiCicco", "id" : "Robert DiCicco", "data" : [ [ "Perl", 1 ] - ] + ], + "name" : "Robert DiCicco" }, { + "name" : "Roger Bell_West", "id" : "Roger Bell_West", "data" : [ [ @@ -272,11 +301,10 @@ "Blog", 1 ] - ], - "name" : "Roger Bell_West" + ] }, { - "name" : "Ulrich Rieke", + "id" : "Ulrich Rieke", "data" : [ [ "Perl", @@ -287,10 +315,10 @@ 1 ] ], - "id" : "Ulrich Rieke" + "name" : "Ulrich Rieke" }, { - "id" : "W. Luis Mochan", + "name" : "W. Luis Mochan", "data" : [ [ "Perl", @@ -301,58 +329,53 @@ 1 ] ], - "name" : "W. Luis Mochan" + "id" : "W. Luis Mochan" } ] }, - "title" : { - "text" : "The Weekly Challenge - 149" - }, - "subtitle" : { - "text" : "[Champions: 23] Last updated at 2022-01-30 17:57:27 GMT" - }, "series" : [ { + "name" : "The Weekly Challenge - 149", "data" : [ { - "drilldown" : "Abigail", "name" : "Abigail", + "drilldown" : "Abigail", "y" : 4 }, { "drilldown" : "Alexander Pankoff", - "name" : "Alexander Pankoff", - "y" : 2 + "y" : 2, + "name" : "Alexander Pankoff" }, { - "drilldown" : "Athanasius", + "name" : "Athanasius", "y" : 4, - "name" : "Athanasius" + "drilldown" : "Athanasius" }, { - "y" : 2, "name" : "Cheok-Yin Fung", - "drilldown" : "Cheok-Yin Fung" + "drilldown" : "Cheok-Yin Fung", + "y" : 2 }, { + "y" : 6, "drilldown" : "Colin Crain", - "name" : "Colin Crain", - "y" : 1 + "name" : "Colin Crain" }, { - "name" : "Dave Jacoby", "y" : 4, - "drilldown" : "Dave Jacoby" + "drilldown" : "Dave Jacoby", + "name" : "Dave Jacoby" }, { - "drilldown" : "E. Choroba", "y" : 2, + "drilldown" : "E. Choroba", "name" : "E. Choroba" }, { - "y" : 6, "name" : "Flavio Poletti", - "drilldown" : "Flavio Poletti" + "drilldown" : "Flavio Poletti", + "y" : 6 }, { "name" : "James Smith", @@ -360,19 +383,19 @@ "drilldown" : "James Smith" }, { - "drilldown" : "Jan Krnavek", "y" : 2, + "drilldown" : "Jan Krnavek", "name" : "Jan Krnavek" }, { - "drilldown" : "Jorg Sommrey", "name" : "Jorg Sommrey", - "y" : 2 + "y" : 2, + "drilldown" : "Jorg Sommrey" }, { - "drilldown" : "Laurent Rosenfeld", + "name" : "Laurent Rosenfeld", "y" : 5, - "name" : "Laurent Rosenfeld" + "drilldown" : "Laurent Rosenfeld" }, { "drilldown" : "Lubos Kolouch", @@ -380,78 +403,78 @@ "name" : "Lubos Kolouch" }, { + "name" : "Luca Ferrari", "drilldown" : "Luca Ferrari", - "y" : 4, - "name" : "Luca Ferrari" + "y" : 4 }, { - "drilldown" : "Mark Anderson", "y" : 2, + "drilldown" : "Mark Anderson", "name" : "Mark Anderson" }, { - "y" : 2, "name" : "Matthew Neleigh", + "y" : 2, "drilldown" : "Matthew Neleigh" }, { "name" : "Mohammad S Anwar", - "y" : 2, - "drilldown" : "Mohammad S Anwar" + "drilldown" : "Mohammad S Anwar", + "y" : 2 }, { - "drilldown" : "Niels van Dijke", "name" : "Niels van Dijke", - "y" : 1 + "y" : 1, + "drilldown" : "Niels van Dijke" }, { + "y" : 2, + "drilldown" : "Pete Houston", + "name" : "Pete Houston" + }, + { + "drilldown" : "Peter Campbell Smith", "y" : 3, - "name" : "Peter Campbell Smith", - "drilldown" : "Peter Campbell Smith" + "name" : "Peter Campbell Smith" }, { - "y" : 1, "name" : "Robert DiCicco", - "drilldown" : "Robert DiCicco" + "drilldown" : "Robert DiCicco", + "y" : 1 }, { - "name" : "Roger Bell_West", + "drilldown" : "Roger Bell_West", "y" : 5, - "drilldown" : "Roger Bell_West" + "name" : "Roger Bell_West" }, { "drilldown" : "Ulrich Rieke", - "name" : "Ulrich Rieke", - "y" : 3 + "y" : 3, + "name" : "Ulrich Rieke" }, { "drilldown" : "W. Luis Mochan", - "name" : "W. Luis Mochan", - "y" : 3 + "y" : 3, + "name" : "W. Luis Mochan" } ], - "colorByPoint" : 1, - "name" : "The Weekly Challenge - 149" + "colorByPoint" : 1 } ], - "plotOptions" : { - "series" : { - "dataLabels" : { - "enabled" : 1, - "format" : "{point.y}" - }, - "borderWidth" : 0 - } + "xAxis" : { + "type" : "category" }, - "chart" : { - "type" : "column" + "title" : { + "text" : "The Weekly Challenge - 149" }, "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/>", - "followPointer" : 1 + "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>" }, - "xAxis" : { - "type" : "category" + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } } } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index cf64d55dc2..1a0d1a7849 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,63 +1,63 @@ { + "xAxis" : { + "type" : "category", + "labels" : { + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + } + } + }, + "title" : { + "text" : "The Weekly Challenge Contributions [2019 - 2021]" + }, + "tooltip" : { + "pointFormat" : "<b>{point.y:.0f}</b>" + }, "yAxis" : { "title" : { "text" : null }, "min" : 0 }, + "chart" : { + "type" : "column" + }, + "subtitle" : { + "text" : "Last updated at 2022-01-31 01:24:52 GMT" + }, "legend" : { "enabled" : "false" }, "series" : [ { + "name" : "Contributions", "data" : [ [ "Blog", - 2230 + 2231 ], [ "Perl", - 7184 + 7188 ], [ "Raku", - 4320 + 4322 ] ], - "name" : "Contributions", "dataLabels" : { |