From 4bd44dfd597811f71468831c7ee80a9101e7f30a Mon Sep 17 00:00:00 2001 From: Mohammad S Anwar Date: Fri, 15 May 2020 17:11:56 +0100 Subject: - Added solutions by Colin Crain. --- challenge-060/colin-crain/blog.txt | 1 + challenge-060/colin-crain/perl/ch-1.pl | 150 +++++ challenge-060/colin-crain/perl/ch-2.pl | 137 +++++ challenge-060/colin-crain/raku/ch-1.p6 | 140 +++++ challenge-060/colin-crain/raku/ch-2.p6 | 142 +++++ stats/pwc-current.json | 177 +++--- stats/pwc-language-breakdown-summary.json | 78 +-- stats/pwc-language-breakdown.json | 872 +++++++++++++++--------------- stats/pwc-leaders.json | 726 ++++++++++++------------- stats/pwc-summary-1-30.json | 58 +- stats/pwc-summary-121-150.json | 50 +- stats/pwc-summary-151-180.json | 46 +- stats/pwc-summary-31-60.json | 42 +- stats/pwc-summary-61-90.json | 44 +- stats/pwc-summary-91-120.json | 94 ++-- stats/pwc-summary.json | 378 ++++++------- 16 files changed, 1864 insertions(+), 1271 deletions(-) create mode 100644 challenge-060/colin-crain/blog.txt create mode 100644 challenge-060/colin-crain/perl/ch-1.pl create mode 100644 challenge-060/colin-crain/perl/ch-2.pl create mode 100644 challenge-060/colin-crain/raku/ch-1.p6 create mode 100644 challenge-060/colin-crain/raku/ch-2.p6 diff --git a/challenge-060/colin-crain/blog.txt b/challenge-060/colin-crain/blog.txt new file mode 100644 index 0000000000..fcbefdbaee --- /dev/null +++ b/challenge-060/colin-crain/blog.txt @@ -0,0 +1 @@ +https://colincrain.wordpress.com/2020/05/15/an-excellent-gathering/ diff --git a/challenge-060/colin-crain/perl/ch-1.pl b/challenge-060/colin-crain/perl/ch-1.pl new file mode 100644 index 0000000000..5bc0295132 --- /dev/null +++ b/challenge-060/colin-crain/perl/ch-1.pl @@ -0,0 +1,150 @@ +#! /opt/local/bin/perl +# +# excellent_columns.pl +# +# PWC 60 TASK #1 › Excel Column +# Reviewed by: Ryan Thompson +# Write a script that accepts a number and returns the Excel Column +# Name it represents and vice-versa. +# +# Excel columns start at A and increase lexicographically using the 26 +# letters of the English alphabet, A..Z. After Z, the columns pick up +# an extra “digit”, going from AA, AB, etc., which could (in theory) +# continue to an arbitrary number of digits. In practice, Excel sheets +# are limited to 16,384 columns. +# +# Example +# +# Input Number: 28 Output: AB +# +# Input Column Name: AD Output: 30 +# +# METHOD +# +# So it’s base 26, using capital letters for the symbols. Cool. +# +# Ok, well, sort of. Turns out it’s a little different, a little +# more complicated than that. +# +# “How so?” you say. Glad you asked. It seems we have a little +# problem with Z. +# +# “Z?” you say. Yes, Z. +# +# As usual, the first order of business is to unpack the challenge +# and nail down a few outstanding questions. Then the problem will +# make a little more sense. +# +# All we are told in the text about Excel is that the column +# identifiers start with A and continue through Z, then recommence +# labelling with AA to AZ, etcetera. In order for the mapping 28 → +# AB to occur, 27 maps to AA, and what’s left is A-Z mapping to 1 to +# 26. So the indexing starts at 1. Fair enough. +# +# The cycle is undoubtably 26; converting to base 26 seems a +# reasonable start. We can then substitute the letters A-Z for the +# normal representation 0-9 followed by A-P. The problems start +# immediately, with the number 1026, or if you look at it another +# way, 0. +# +# To make visualization a little easier it might make sense to +# relate to base 10, our standard counting system. To count in base +# 10, we use the 10 digits 0 through 9, then we start to +# positionally combine these digits to make the numbers 10, 11, and +# so on. So if we choose to use letters for our digits, do we map +# the letters to 0-9 or 1-10? In either case we are confounded by +# 10, being the last member of the mapping, but being composed of +# two digits in the number system. +# +# But back to base 26 and Z, if we use the tried and true method of +# dividing out the base, we’ll never get a remainder of 26, but +# rather 0. So do we make 0 → Z ? Then 26 → AZ, which is wrong. Z +# has to be 26, because the next number, 27 is AA (think 11 here if +# you must, the association is correct) Similarly, fudging our +# numbers by 1 in other ways, either reducing the input or the +# remainder to match 0 indexing fails as well, either starting on +# the wrong letter or erring at the transition to two digits. +# Sometimes we start at B, or later we get BA instead of AA. There’s +# a lot of ways down this mountain, I assure you. We are being +# confounded by the fact that our counting is indexed to 1 and our +# base is indexed to 0. +# +# The solution is to shift the input number to a 0-based lookup +# within the dividing out itself, by subtracting 1 from the number +# during the computation of the remainder. Then 26 becomes 25 and +# the arithmetic all works out; 27 follows 26 as it should be and AA +# follows Z. This gives us the correct translation, finally. Mixing +# indexing systems is always a red flag for danger, and adding in +# modular arithmetic to the mix just adds to the confusion. +# +# To do the conversion from Excel to decimal is a little less +# complicated, fortunately for us. To run the dividing out in +# reverse we first need to establish a lookup mapping the letters +# A-Z to 1-26, and then we progress through the string taking off +# letters from the right and summing the product of the lookup value +# and 26 to the power of the (0-based) position for each place. In +# base-10, this multiplier is 1, 10, 100 and so on. In base-26 we +# use 26^0, 26^1, 26^2… To implement this, we dice the string into +# an array of chars, reverse() the array and shift() from the left. +# Then we can keep track of the loops, counting from 0, to get the +# appropriate power. +# +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +use warnings; +use strict; +use feature ":5.26"; + +## ## ## ## ## MAIN: + +my ($input, $EXAMPLE) = @ARGV; + +if ($input =~ /^\d*$/) { + say dec2excel($input); +} +elsif ($input =~ /^[A-Z]*$/) { + say excel2dec($input); +} +else { + say "input: decimal number or capital alphabetic sequence of characters A-Z"; +} + +$EXAMPLE && printf "%-2d %-2s %-2d %-2s\n", $_, dec2excel($_), + excel2dec(dec2excel($_)), b26($_) for (1..90); + + +## ## ## ## ## SUBS: + +sub dec2excel { + my $num = shift; + my @alpha = ( "A".."Z" ); + my $out = ""; + my $rem = 0; + while ( $num > 0 ) { + ## magic here, note we do the math on num - 1 + ($num, $rem) = (int( ($num-1)/26 ), ($num-1) % 26); + $out = $alpha[$rem] . $out; + } + return $out; + +} + +sub excel2dec { + my $excel = shift; + my @alpha = ( "A".."Z" ); + my %alpha = map { $alpha[$_] => $_+1 } (0..25); + + my @rev_26 = reverse( map { $alpha{$_} } split //, $excel ); + + my $out; + for (0..@rev_26 - 1) { + my $val = shift @rev_26; + $out += $val * (26 ** $_); + } + return $out; +} diff --git a/challenge-060/colin-crain/perl/ch-2.pl b/challenge-060/colin-crain/perl/ch-2.pl new file mode 100644 index 0000000000..a933c10a59 --- /dev/null +++ b/challenge-060/colin-crain/perl/ch-2.pl @@ -0,0 +1,137 @@ +#! /opt/local/bin/perl +# +# gathering_digits_down_under.pl +# +# PWC 60 TASK #2 +# Find Numbers +# Challenge by: Ryan Thompson +# Write a script that accepts list of positive numbers (@L) and two +# positive numbers $X and $Y. +# +# The script should print all possible numbers made by concatenating +# the numbers from @L, whose length is exactly $X but value is less +# than $Y. +# +# Example +# Input: +# +# @L = (0, 1, 2, 5); +# $X = 2; +# $Y = 21; +# +# Output: +# +# 10, 11, 12, 15, 20 +# +# METHOD +# +# This is another example of what I call concrete number theory, where +# we conflate the ideas of numbers and the symbols used to represent +# them. We’re going to assemble digits positionally rather than +# mathematically, and then evaluate those resultant numbers according +# to some criteria. In this case the number of positions is equal to +# an input x, and the resultant number is less than an input y. +# +# To manufacture the number, we’re going to combine elements from an +# input array. Considering the choices as sets, we are looking for +# permutations of combinations with repetitions of length k elements +# from set n. This is known in Set Theory as +# +# k-element variations of n-elements with repetition +# +# +# as distinguished from variations without repetition. For a list of n +# elements we have +# +# VR(n,k) = n^k +# +# variations; because every position can contain every element at any +# time, so the product is +# +# n × n × n … +# +# for as many positions as required. There is one small caveat to +# this, however, and that is the number 0. +# +# Despite the given specification given a list of positive numbers, +# zero is neither positive nor negative, so does not belong according +# to that rule. However the example list explicitly includes it, so we +# will follow suit and allow it, despite the specification. Sometimes +# we must figure out that what the customer wants is not exactly what +# they asked for. +# +# To create our master list of variations, we’ll create a list, and +# then iterate through the elements one at a time, adding an new value +# and creating a new set of variations for every option. Bu carefully +# keeping track of indexes we can just keep just one list as a queue, +# shifting elements off the front and adding new variations on the +# end. As we allow repetition, it makes no sense to duplicate elements +# in the input; it’s a set, not an ordered list. Thus if the number 2 +# is an element, if 2 is repeated later in the input it still can be +# present in any position, so it makes no difference. We’ll allow it, +# because you can’t control people, but roll our eyes a bit and filter +# out duplicates. Also, it we sort our list before we start, the +# results will come out sorted, which is nice. +# +# We will use our now sorted and filtered list to start our list of +# variations. At this point, the first digit of the final number, we +# will need to address 0 again, because earlier we specifically +# allowed it. The problem is if we have a leading zero on a number, it +# will not, by convention, be considered in the final construction, +# and as such will shorten the positional count of the result, +# violating that criterium. As far as convention goes, in case there +# was any question remaining whether leading zeros are allowed +# (because I can certainly see a case for it) we refer again to the +# text. The example given in the challenge does not include the +# results 00, 01, 02, or 05. Ok, so that’s a no-no, and we must for +# the initial value exclude 0 if it is present. After this it’s fine, +# as it won’t affect position. So we will need to selectively filter +# it out only for the initialization. We can either check the value at +# index 0, because the list is positive and sorted, then remove it if +# present, or grep the sorted array on the values themselves, which +# will fail on 0. Kind of a high-pass filter. +# +# But before we’re done there also exists a singular pathological case +# to handle where x = 1 and the list includes 0. If we are not +# allowing leading 0s, does a solitary 0 count as a valid answer? +# Sure, it’s not a leading zero if it’s the only value present, even +# if that value is the absence of value. Really this relates back to +# the acceptance of 0 as a valid number at all, which is a much more +# recent, non-obvious and complicated development than many people +# understand, and entirely worthy of a discussion unto itself*. In +# another way it reminds me of pluralizing cats: no cats, 1 cat, 2 +# cats. The progression is unexpectedly complex. So we eliminate the +# leading 0 of the first result set, but need to add it back in one +# case, when x = 1. +# +# ----- +# *Kaplan, Robert (2000) The Nothing That Is: A Natural History of +# Zero, Oxford: Oxford University Press. +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +use warnings; +use strict; +use feature ":5.26"; + +## ## ## ## ## MAIN: + +my ($x, $y, @array) = @ARGV; + +## removes leading 0 unless x = 1 +my @result = $x == 1 ? @array + : grep { $_ } @array; + +for (2..$x) { + my $end = @result-1; + for ( 0..$end ) { + my $num = shift @result; + for my $next ( @array ) { + push @result, "$num$next"; + } + } +} + +say "$_" for grep { $_ < $y } @result; diff --git a/challenge-060/colin-crain/raku/ch-1.p6 b/challenge-060/colin-crain/raku/ch-1.p6 new file mode 100644 index 0000000000..82957cb418 --- /dev/null +++ b/challenge-060/colin-crain/raku/ch-1.p6 @@ -0,0 +1,140 @@ +use v6.d; + +# +# excellent_columns.raku +# +# PWC 60 TASK #1 › Excel Column +# Challenge by: Ryan Thompson +# Write a script that accepts a number and returns the Excel Column +# Name it represents and vice-versa. +# +# Excel columns start at A and increase lexicographically using the 26 +# letters of the English alphabet, A..Z. After Z, the columns pick up +# an extra “digit”, going from AA, AB, etc., which could (in theory) +# continue to an arbitrary number of digits. In practice, Excel sheets +# are limited to 16,384 columns. +# +# Example +# +# Input Number: 28 Output: AB +# +# Input Column Name: AD Output: 30 +# +# METHOD +# +# So it’s base 26, using capital letters for the symbols. Cool. +# +# Ok, well, sort of. Turns out it’s a little different, a little +# more complicated than that. +# +# “How so?” you say. Glad you asked. It seems we have a little +# problem with Z. +# +# “Z?” you say. Yes, Z. +# +# As usual, the first order of business is to unpack the challenge +# and nail down a few outstanding questions. Then the problem will +# make a little more sense. +# +# All we are told in the text about Excel is that the column +# identifiers start with A and continue through Z, then recommence +# labelling with AA to AZ, etcetera. In order for the mapping 28 → +# AB to occur, 27 maps to AA, and what’s left is A-Z mapping to 1 to +# 26. So the indexing starts at 1. Fair enough. +# +# The cycle is undoubtably 26; converting to base 26 seems a +# reasonable start. We can then substitute the letters A-Z for the +# normal representation 0-9 followed by A-P. The problems start +# immediately, with the number 1026, or if you look at it another +# way, 0. +# +# To make visualization a little easier it might make sense to +# relate to base 10, our standard counting system. To count in base +# 10, we use the 10 digits 0 through 9, then we start to +# positionally combine these digits to make the numbers 10, 11, and +# so on. So if we choose to use letters for our digits, do we map +# the letters to 0-9 or 1-10? In either case we are confounded by +# 10, being the last member of the mapping, but being composed of +# two digits in the number system. +# +# But back to base 26 and Z, if we use the tried and true method of +# dividing out the base, we’ll never get a remainder of 26, but +# rather 0. So do we make 0 → Z ? Then 26 → AZ, which is wrong. Z +# has to be 26, because the next number, 27 is AA (think 11 here if +# you must, the association is correct) Similarly, fudging our +# numbers by 1 in other ways, either reducing the input or the +# remainder to match 0 indexing fails as well, either starting on +# the wrong letter or erring at the transition to two digits. +# Sometimes we start at B, or later we get BA instead of AA. There’s +# a lot of ways down this mountain, I assure you. We are being +# confounded by the fact that our counting is indexed to 1 and our +# base is indexed to 0. +# +# The solution is to shift the input number to a 0-based lookup +# within the dividing out itself, by subtracting 1 from the number +# during the computation of the remainder. Then 26 becomes 25 and +# the arithmetic all works out; 27 follows 26 as it should be and AA +# follows Z. This gives us the correct translation, finally. Mixing +# indexing systems is always a red flag for danger, and adding in +# modular arithmetic to the mix just adds to the confusion. +# +# To do the conversion from Excel to decimal is a little less +# complicated, fortunately for us. To run the dividing out in +# reverse we first need to establish a lookup mapping the letters +# A-Z to 1-26, and then we progress through the string taking off +# letters from the right and summing the product of the lookup value +# and 26 to the power of the (0-based) position for each place. In +# base-10, this multiplier is 1, 10, 100 and so on. In base-26 we +# use 26^0, 26^1, 26^2… To implement this, we dice the string into +# an array of chars, reverse() the array and shift() from the left. +# Then we can keep track of the loops, counting from 0, to get the +# appropriate power. +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +sub MAIN ( Str:D $input, $EXAMPLE = 0) { + + my $usage = qq:to/__END__/; + Usage: + argument is decimal number or capital alphabetic sequence of characters A-Z + optional second argument to produce list of all possible excel columns 1 to 16,384 + __END__ + + given $input { + when /^\d*$/ { dec2excel($input).say } + when /^<[A..Za..z]>*$/ { excel2dec($input.uc).say } + default { $usage.say } + } + + $EXAMPLE && printf "%-2d %-2s %-2d\n", $_, dec2excel( $_ ), + excel2dec(dec2excel($_)) for (1..16_384); + +} + +sub dec2excel ($num is copy) { +## Int number --> Str excel column + my @alpha = ("A" .. "Z"); + my $out = ''; + my $rem; + + while $num > 0 { + ($num, $rem) = (($num-1)/26 ).floor, ($num-1) % 26; + $out = @alpha[$rem] ~ $out; + } + return $out; +} + +sub excel2dec ($excel) { +## Str excel column --> Int number + my %alpha; + %alpha{"A".."Z"} = 1..26; + my @reverse_26 = $excel.comb.map({ %alpha{$_} }).reverse; + my $out; + + for (0..@reverse_26.end) { + my $val = @reverse_26.shift; + $out += $val * (26 ** $_); + } + return $out; +} diff --git a/challenge-060/colin-crain/raku/ch-2.p6 b/challenge-060/colin-crain/raku/ch-2.p6 new file mode 100644 index 0000000000..26e642a623 --- /dev/null +++ b/challenge-060/colin-crain/raku/ch-2.p6 @@ -0,0 +1,142 @@ +use v6.d; + +# +# gathering_digits_down_under.raku +# +# PWC 60 TASK #2 +# Find Numbers +# Challenge by: Ryan Thompson +# Write a script that accepts list of positive numbers (@L) and two +# positive numbers $X and $Y. +# +# The script should print all possible numbers made by concatenating +# the numbers from @L, whose length is exactly $X but value is less +# than $Y. +# +# Example +# Input: +# +# @L = (0, 1, 2, 5); +# $X = 2; +# $Y = 21; +# +# Output: +# +# 10, 11, 12, 15, 20 +# +# METHOD +# +# This is another example of what I call concrete number theory, where +# we conflate the ideas of numbers and the symbols used to represent +# them. We’re going to assemble digits positionally rather than +# mathematically, and then evaluate those resultant numbers according +# to some criteria. In this case the number of positions is equal to +# an input x, and the resultant number is less than an input y. +# +# To manufacture the number, we’re going to combine elements from an +# input array. Considering the choices as sets, we are looking for +# permutations of combinations with repetitions of length k elements +# from set n. This is known in Set Theory as +# +# k-element variations of n-elements with repetition +# +# +# as distinguished from variations without repetition. For a list of n +# elements we have +# +# VR(n,k) = n^k +# +# variations; because every position can contain every element at any +# time, so the product is +# +# n × n × n … +# +# for as many positions as required. There is one small caveat to +# this, however, and that is the number 0. +# +# Despite the given specification given a list of positive numbers, +# zero is neither positive nor negative, so does not belong according +# to that rule. However the example list explicitly includes it, so we +# will follow suit and allow it, despite the specification. Sometimes +# we must figure out that what the customer wants is not exactly what +# they asked for. +# +# To create our master list of variations, we’ll create a list, and +# then iterate through the elements one at a time, adding an new value +# and creating a new set of variations for every option. Bu carefully +# keeping track of indexes we can just keep just one list as a queue, +# shifting elements off the front and adding new variations on the +# end. As we allow repetition, it makes no sense to duplicate elements +# in the input; it’s a set, not an ordered list. Thus if the number 2 +# is an element, if 2 is repeated later in the input it still can be +# present in any position, so it makes no difference. We’ll allow it, +# because you can’t control people, but roll our eyes a bit and filter +# out duplicates. Also, it we sort our list before we start, the +# results will come out sorted, which is nice. +# +# We will use our now sorted and filtered list to start our list of +# variations. At this point, the first digit of the final number, we +# will need to address 0 again, because earlier we specifically +# allowed it. The problem is if we have a leading zero on a number, it +# will not, by convention, be considered in the final construction, +# and as such will shorten the positional count of the result, +# violating that criterium. As far as convention goes, in case there +# was any question remaining whether leading zeros are allowed +# (because I can certainly see a case for it) we refer again to the +# text. The example given in the challenge does not include the +# results 00, 01, 02, or 05. Ok, so that’s a no-no, and we must for +# the initial value exclude 0 if it is present. After this it’s fine, +# as it won’t affect position. So we will need to selectively filter +# it out only for the initialization. We can either check the value at +# index 0, because the list is positive and sorted, then remove it if +# present, or grep the sorted array on the values themselves, which +# will fail on 0. Kind of a high-pass filter. +# +# But before we’re done there also exists a singular pathological case +# to handle where x = 1 and the list includes 0. If we are not +# allowing leading 0s, does a solitary 0 count as a valid answer? +# Sure, it’s not a leading zero if it’s the only value present, even +# if that value is the absence of value. Really this relates back to +# the acceptance of 0 as a valid number at all, which is a much more +# recent, non-obvious and complicated development than many people +# understand, and entirely worthy of a discussion unto itself*. In +# another way it reminds me of pluralizing cats: no cats, 1 cat, 2 +# cats. The progression is unexpectedly complex. So we eliminate the +# leading 0 of the first result set, but need to add it back in one +# case, when x = 1. +# +# ----- +# *Kaplan, Robert (2000) The Nothing That Is: A Natural History of +# Zero, Oxford: Oxford University Press. +# +# +# +# 2020 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + +sub MAIN ( $x, $y, *@array) { +## @array is array to be rearranged +## $x is new number length +## $y is larger than new number + + @array = @array.sort({$^a <=> $^b}); + + ## removes leading 0, unless x = 1 + my @result = $x == 1 ?? @array + !! @array.grep: { $_ }; + + for 2..$x { + ## note the length of the queue at this moment + my $end = @result.end; + for 0..$end { + my $num = @result.shift; + for @array -> $next { + @result.push: 10 * $num + $next; + } + } + } + + .say for @result.grep: { $_ < $y }; +} + + diff --git a/stats/pwc-current.json b/stats/pwc-current.json index 6d87591452..4d8ce678c7 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,28 +1,38 @@ { - "legend" : { - "enabled" : 0 - }, - "tooltip" : { - "followPointer" : 1, - "headerFormat" : "{series.name}
", - "pointFormat" : "{point.name}: {point.y:f}
" - }, "xAxis" : { "type" : "category" }, - "yAxis" : { - "title" : { - "text" : "Total Solutions" + "plotOptions" : { + "series" : { + "borderWidth" : 0, + "dataLabels" : { + "enabled" : 1, + "format" : "{point.y}" + } } }, - "subtitle" : { - "text" : "[Champions: 15] Last updated at 2020-05-15 07:53:42 GMT" - }, "drilldown" : { "series" : [ { - "name" : "Arne Sommer", + "id" : "Arne Sommer", + "data" : [ + [ + "Raku", + 2 + ], + [ + "Blog", + 1 + ] + ], + "name" : "Arne Sommer" + }, + { "data" : [ + [ + "Perl", + 2 + ], [ "Raku", 2 @@ -32,19 +42,21 @@ 1 ] ], - "id" : "Arne Sommer" + "name" : "Colin Crain", + "id" : "Colin Crain" }, { - "id" : "Dave Jacoby", + "name" : "Dave Jacoby", "data" : [ [ "Perl", 2 ] ], - "name" : "Dave Jacoby" + "id" : "Dave Jacoby" }, { + "id" : "E. Choroba", "data" : [ [ "Perl", @@ -55,11 +67,9 @@ 1 ] ], - "id" : "E. Choroba", "name" : "E. Choroba" }, { - "name" : "Javier Luque", "id" : "Javier Luque", "data" : [ [ @@ -74,20 +84,20 @@ "Blog", 1 ] - ] + ], + "name" : "Javier Luque" }, { - "id" : "Jorg Sommrey", "data" : [ [ "Perl", 2 ] ], - "name" : "Jorg Sommrey" + "name" : "Jorg Sommrey", + "id" : "Jorg Sommrey" }, { - "name" : "Luca Ferrari", "id" : "Luca Ferrari", "data" : [ [ @@ -98,27 +108,28 @@ "Blog", 2 ] - ] + ], + "name" : "Luca Ferrari" }, { + "name" : "Mark Anderson", "data" : [ [ "Raku", 2 ] ], - "id" : "Mark Anderson", - "name" : "Mark Anderson" + "id" : "Mark Anderson" }, { "name" : "Markus Holzer", - "id" : "Markus Holzer", "data" : [ [ "Raku", 2 ] - ] + ], + "id" : "Markus Holzer" }, { "id" : "Mohammad S Anwar", @@ -131,7 +142,7 @@ "name" : "Mohammad S Anwar" }, { - "id" : "Roger Bell_West", + "name" : "Roger Bell_West", "data" : [ [ "Perl", @@ -146,7 +157,7 @@ 1 ] ], - "name" : "Roger Bell_West" + "id" : "Roger Bell_West" }, { "data" : [ @@ -155,11 +166,10 @@ 2 ] ], - "id" : "Saif Ahmed", - "name" : "Saif Ahmed" + "name" : "Saif Ahmed", + "id" : "Saif Ahmed" }, { - "name" : "Sangeet Kar", "data" : [ [ "Perl", @@ -170,17 +180,18 @@ 2 ] ], + "name" : "Sangeet Kar", "id" : "Sangeet Kar" }, { "id" : "Ulrich Rieke", + "name" : "Ulrich Rieke", "data" : [ [ "Raku", 2 ] - ], - "name" : "Ulrich Rieke" + ] }, { "data" : [ @@ -189,38 +200,28 @@ 2 ] ], - "id" : "Wanderdoc", - "name" : "Wanderdoc" + "name" : "Wanderdoc", + "id" : "Wanderdoc" }, { + "id" : "Yet Ebreo", "name" : "Yet Ebreo", "data" : [ [ "Perl", 2 ] - ], - "id" : "Yet Ebreo" + ] } ] }, - "chart" : { - "type" : "column" - }, - "title" : { - "text" : "Perl Weekly Challenge - 060" - }, - "plotOptions" : { - "series" : { - "borderWidth" : 0, - "dataLabels" : { - "enabled" : 1, - "format" : "{point.y}" - } - } + "subtitle" : { + "text" : "[Champions: 16] Last updated at 2020-05-15 16:11:46 GMT" }, "series" : [ { + "colorByPoint" : 1, + "name" : "Perl Weekly Challenge - 060", "data" : [ { "drilldown" : "Arne Sommer", @@ -228,23 +229,28 @@ "name" : "Arne Sommer" }, { + "name" : "Colin Crain", + "drilldown" : "Colin Crain", + "y" : 5 + }, + { + "drilldown" : "Dave Jacoby", "y" : 2, - "name" : "Dave Jacoby", - "drilldown" : "Dave Jacoby" + "name" : "Dave Jacoby" }, { "drilldown" : "E. Choroba", - "name" : "E. Choroba", - "y" : 3 + "y" : 3, + "name" : "E. Choroba" }, { - "drilldown" : "Javier Luque", "name" : "Javier Luque", - "y" : 5 + "y" : 5, + "drilldown" : "Javier Luque" }, { - "drilldown" : "Jorg Sommrey", "name" : "Jorg Sommrey", + "drilldown" : "Jorg Sommrey", "y" : 2 }, { @@ -253,18 +259,18 @@ "drilldown" : "Luca Ferrari" }, { - "drilldown" : "Mark Anderson", "name" : "Mark Anderson", + "drilldown" : "Mark Anderson", "y" : 2 }, { - "drilldown" : "Markus Holzer", + "name" : "Markus Holzer", "y" : 2, - "name" : "Markus Holzer" + "drilldown" : "Markus Holzer" }, { - "drilldown" : "Mohammad S Anwar", "name" : "Mohammad S Anwar", + "drilldown" : "Mohammad S Anwar", "y" : 2 }, { @@ -273,33 +279,50 @@ "drilldown" : "Roger Bell_West" }, { - "y" : 2, "name" : "Saif Ahmed", + "y" : 2, "drilldown" : "Saif Ahmed" }, { - "y" : 4, "name" : "Sangeet Kar", - "drilldown" : "Sangeet Kar" + "drilldown" : "Sangeet Kar", + "y" : 4 }, { - "drilldown" : "Ulrich Rieke", + "name" : "Ulrich Rieke", "y" : 2, - "name" : "Ulrich Rieke" + "drilldown" : "Ulrich Rieke" }, { - "y" : 2, "name" : "Wanderdoc", + "y" : 2, "drilldown" : "Wanderdoc" }, { "name" : "Yet Ebreo", - "y" : 2, - "drilldown" : "Yet Ebreo" + "drilldown" : "Yet Ebreo", + "y" : 2 } - ], - "name" : "Perl Weekly Challenge - 060", - "colorByPoint" : 1 + ] + } + ], + "yAxis" : { + "title" : { + "text" : "Total Solutions" } - ] + }, + "chart" : { + "type" : "column" + }, + "legend" : { + "enabled" : 0 + }, + "title" : { + "text" : "Perl Weekly Challenge - 060" + }, + "tooltip" : { + "pointFormat" : "{point.name}: {point.y:f}
", + "followPointer" : 1, + "headerFormat" : "{series.name}
" + } } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 0f103bebc6..d41bbe98e2 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,63 +1,63 @@ { - "yAxis" : { - "title" : { - "text" : null - }, - "min" : 0 + "legend" : { + "enabled" : "false" }, - "xAxis" : { - "type" : "category", - "labels" : { - "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" - } - } + "title" : { + "text" : "Perl Weekly Challenge Contributions [2019 - 2020]" }, "tooltip" : { "pointFormat" : "{point.y:.0f}" }, - "legend" : { - "enabled" : "false" + "yAxis" : { + "min" : 0, + "title" : { + "text" : null + } + }, + "chart" : { + "type" : "column" }, "series" : [ { - "dataLabels" : { - "y" : 10, - "style" : { - "fontSize" : "13px", - "fontFamily" : "Verdana, sans-serif" - }, - "format" : "{point.y:.0f}", - "enabled" : "true", - "align" : "right", - "color" : "#FFFFFF", - "rotation" : -90 - }, - "name" : "Contributions", "data" : [ [ "Blog", - 683 + 684 ], [ "Perl", - 2523 + 2525 ], [ "Raku", - 1586 + 1588 ] - ] + ], + "dataLabels" : { + "align" : "right", + "format" : "{point.y:.0f}", + "color" : "#FFFFFF", + "enabled" : "true", + "rotation" : -90, + "y" : 10, + "style" : { + "fontSize" : "13px", + "fontFamily" : "Verdana, sans-serif" + } + }, + "name" : "Contributions" } ], - "title" : { - "text" : "Perl Weekly Challenge Contributions [2019 - 2020]" - }, - "chart" : { - "type" : "column" - }, "subtitle" : { - "text" : "Last updated at 2020-05-15 07:53:42 GMT" + "text" : "Last updated at 2020-05-15 16:11:46 GMT" + }, + "xAxis" : { + "type" : "category", + "labels" : { + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + } + } } } diff --git a/stats/pwc-language-breakdown.json b/stats/pwc-language-breakdown.json index 4eb7d60e50..059b5f0d0e 100644 --- a/stats/pwc-language-breakdown.json +++ b/stats/pwc-language-breakdown.json @@ -1,316 +1,28 @@ { - "series" : [ - { - "data" : [ - { - "y" : 142, - "name" : "#001", - "drilldown" : "001" - }, - { - "drilldown" : "002", - "name" : "#002", - "y" : 109 - }, - { - "y" : 71, - "name" : "#003", - "drilldown" : "003" - }, - { - "drilldown" : "004", - "y" : 91, - "name" : "#004" - }, - { - "drilldown" : "005", - "name" : "#005", - "y" : 72 - }, - { - "drilldown" : "006", - "name" : "#006", - "y" : 52 - }, - { - "y" : 59, - "name" : "#007", - "drilldown" : "007" - }, - { - "y" : 72, - "name" : "#008", - "drilldown" : "008" - }, - { - "drilldown" : "009", - "name" : "#009", - "y" : 68 - }, - { - "drilldown" : "010", - "name" : "#010", - "y" : 60 - }, - { - "name" : "#011", - "y" : 79, - "drilldown" : "011" - }, - { - "drilldown" : "012", - "y" : 83, - "name" : "#012" - }, - { - "drilldown" : "013", - "name" : "#013", - "y" : 76 - }, - { - "y" : 96, - "name" : "#014", - "drilldown" : "014" - }, - { - "y" : 93, - "name" : "#015", - "drilldown" : "015" - }, - { - "y" : 66, - "name" : "#016", - "drilldown" : "016" - }, - { - "name" : "#017", - "y" : 79, - "drilldown" : "017" - }, - { - "drilldown" : "018", - "y" : 76, - "name" : "#018" - }, - { - "name" : "#019", - "y" : 97, - "drilldown" : "019" - }, - { - "drilldown" : "020", - "y" : 95, - "name" : "#020" - }, - { - "drilldown" : "021", - "name" : "#021", - "y" : 67 - }, - { - "drilldown" : "022", - "name" : "#022", - "y" : 63 - }, - { - "drilldown" : "023", - "name" : "#023", - "y" : 91 - }, - { - "drilldown" : "024", - "y" : 70, - "name" : "#024" - }, - { - "drilldown" : "025", - "y" : 55, - "name" : "#025" - }, - { - "name" : "#026", - "y" : 70, - "drilldown" : "026" - }, - { - "name" : "#027", - "y" : 58, - "drilldown" : "027" - }, - { - "y" : 78, - "name" : "#028", - "drilldown" : "028" - }, - { - "drilldown" : "029", - "y" : 77, - "name" : "#029" - }, - { - "drilldown" : "030", - "y" : 115, - "name" : "#030" - }, - { - "drilldown" : "031", - "name" : "#031", - "y" : 87 - }, - { - "drilldown" : "032", - "y" : 92, - "name" : "#032" - }, - { - "name" : "#033", - "y" : 108, - "drilldown" : "033" - }, - { - "y" : 62, - "name" : "#034", - "drilldown" : "034" - }, - { - "name" : "#035", - "y" : 62, - "drilldown" : "035" - }, - { - "y" : 66, - "name" : "#036", - "drilldown" : "036" - }, - { - "drilldown" : "037", - "y" : 65, - "name" : "#037" - }, - { - "name" : "#038", - "y" : 65, - "drilldown" : "038" - }, - { - "y" : 60, - "name" : "#039", - "drilldown" : "039" - }, - { - "drilldown" : "040", - "y" : 71, - "name" : "#040" - }, - { - "y" : 74, - "name" : "#041", - "drilldown" : "041" - }, - { - "drilldown" : "042", - "name" : "#042", - "y" : 88 - }, - { - "name" : "#043", - "y" : 66, - "drilldown" : "043" - }, - { - "name" : "#044", - "y" : 82, - "drilldown" : "044" - }, - { - "y" : 94, - "name" : "#045", - "drilldown" : "045" - }, - { - "drilldown" : "046", - "y" : 85, - "name" : "#046" - }, - { - "name" : "#047", - "y" : 82, - "drilldown" : "047" - }, - { - "drilldown" : "048", - "name" : "#048", - "y" : 106 - }, - { - "name" : "#049", - "y" : 85, - "drilldown" : "049" - }, - { - "name" : "#050", - "y" : 96, - "drilldown" : "050" - }, - { - "drilldown" : "051", - "name" : "#051", - "y" : 87 - }, - { - "drilldown" : "052", - "y" : 89, - "name" : "#052" - }, - { - "name" : "#053", - "y" : 99, - "drilldown" : "053" - }, - { - "drilldown" : "054", - "y" : 99, - "name" : "#054" - }, - { - "drilldown" : "055", - "name" : "#055", - "y" : 86 - }, - { - "name" : "#056", - "y" : 93, - "drilldown" : "056" - }, - { - "drilldown" : "057", - "y" : 78, - "name" : "#057" - }, - { - "drilldown" : "058", - "name" : "#058", - "y" : 61 - }, - { - "drilldown" : "059", - "y" : 82, - "name" : "#059" - }, - { - "name" : "#060", - "y" : 42, - "drilldown" : "060" - } - ], - "name" : "Perl Weekly Challenge Languages", - "colorByPoint" : "true" + "chart" : { + "type" : "column" + }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" } - ], + }, + "title" : { + "text" : "Perl Weekly Challenge Language" + }, + "tooltip" : { + "headerFormat" : "", + "followPointer" : "true", + "pointFormat" : "Challenge {point.name}: {point.y:f}
" + }, + "legend" : { + "enabled" : "false" + }, "drilldown" : { "series" : [ { "id" : "001", + "name" : "001", "data" : [ [ "Perl", @@ -324,12 +36,10 @@ "Blog", 11 ] - ], - "name" : "001" + ] }, { "name" : "002", - "id" : "002", "data" : [ [ "Perl", @@ -343,10 +53,12 @@ "Blog", 10 ] - ] + ], + "id" : "002" }, { "id" : "003", + "name" : "003", "data" : [ [ "Perl", @@ -360,12 +72,9 @@ "Blog", 9 ] - ], - "name" : "003" + ] }, { - "name" : "004", - "id" : "004", "data" : [ [ "Perl", @@ -379,10 +88,13 @@ "Blog", 10 ] - ] + ], + "name" : "004", + "id" : "004" }, { "id" : "005", + "name" : "005", "data" : [ [ "Perl", @@ -396,12 +108,10 @@ "Blog", 12 ] - ], - "name" : "005" + ] }, { "name" : "006", - "id" : "006", "data" : [ [ "Perl", @@ -415,7 +125,8 @@ "Blog", 7 ] - ] + ], + "id" : "006" }, { "name" : "007", @@ -436,7 +147,6 @@ "id" : "007" }, { - "name" : "008", "data" : [ [ "Perl", @@ -451,6 +161,7 @@ 12 ] ], + "name" : "008", "id" : "008" }, { @@ -472,7 +183,7 @@ "id" : "009" }, { - "name" : "010", + "id" : "010", "data" : [ [ "Perl", @@ -487,9 +198,10 @@ 11 ] ], - "id" : "010" + "name" : "010" }, { + "name" : "011", "data" : [ [ "Perl", @@ -504,11 +216,9 @@ 10 ] ], - "id" : "011", - "name" : "011" + "id" : "011" }, { - "name" : "012", "data" : [ [ "Perl", @@ -523,10 +233,10 @@ 11 ] ], + "name" : "012", "id" : "012" }, { - "name" : "013", "data" : [ [ "Perl", @@ -541,9 +251,11 @@ 13 ] ], + "name" : "013", "id" : "013" }, { + "id" : "014", "data" : [ [ "Perl", @@ -558,11 +270,9 @@ 15 ] ], - "id" : "014", "name" : "014" }, { - "name" : "015", "id" : "015", "data" : [ [ @@ -577,9 +287,11 @@ "Blog", 15 ] - ] + ], + "name" : "015" }, { + "id" : "016", "data" : [ [ "Perl", @@ -594,11 +306,10 @@ 12 ] ], - "id" : "016", "name" : "016" }, { - "name" : "017", + "id" : "017", "data" : [ [ "Perl", @@ -613,7 +324,7 @@ 12 ] ], - "id" : "017" + "name" : "017" }, { "name" : "018", @@ -634,8 +345,8 @@ "id" : "018" }, { - "name" : "019", "id" : "019", + "name" : "019", "data" : [ [ "Perl", @@ -652,6 +363,7 @@ ] }, { + "name" : "020", "data" : [ [ "Perl", @@ -666,11 +378,9 @@ 13 ] ], - "id" : "020", - "name" : "020" + "id" : "020" }, { - "name" : "021", "data" : [ [ "Perl", @@ -685,9 +395,12 @@ 10 ] ], + "name" : "021", "id" : "021" }, { + "id" : "022", + "name" : "022", "data" : [ [ "Perl", @@ -701,12 +414,9 @@ "Blog", 10 ] - ], - "id" : "022", - "name" : "022" + ] }, { - "id" : "023", "data" : [ [ "Perl", @@ -721,9 +431,11 @@ 12 ] ], - "name" : "023" + "name" : "023", + "id" : "023" }, { + "id" : "024", "name" : "024", "data" : [ [ @@ -738,10 +450,11 @@ "Blog", 11 ] - ], - "id" : "024" + ] }, { + "id" : "025", + "name" : "025", "data" : [ [ "Perl", @@ -755,12 +468,9 @@ "Blog", 12 ] - ], - "id" : "025", - "name" : "025" + ] }, { - "name" : "026", "id" : "026", "data" : [ [ @@ -775,9 +485,11 @@ "Blog", 10 ] - ] + ], + "name" : "026" }, { + "name" : "027", "data" : [ [ "Perl", @@ -792,12 +504,9 @@ 9 ] ], - "id" : "027", - "name" : "027" + "id" : "027" }, { - "name" : "028", - "id" : "028", "data" : [ [ "Perl", @@ -811,9 +520,12 @@ "Blog", 9 ] - ] + ], + "name" : "028", + "id" : "028" }, { + "id" : "029", "name" : "029", "data" : [ [ @@ -828,11 +540,9 @@ "Blog", 12 ] - ], - "id" : "029" + ] }, { - "id" : "030", "data" : [ [ "Perl", @@ -847,9 +557,11 @@ 10 ] ], - "name" : "030" + "name" : "030", + "id" : "030" }, { + "id" : "031", "name" : "031", "data" : [ [ @@ -864,10 +576,10 @@ "Blog", 9 ] - ], - "id" : "031" + ] }, { + "id" : "032", "data" : [ [ "Perl", @@ -882,10 +594,11 @@ 10 ] ], - "id" : "032", "name" : "032" }, { + "id" : "033", + "name" : "033", "data" : [ [ "Perl", @@ -899,13 +612,9 @@ "Blog", 10 ] - ], - "id" : "033", - "name" : "033" + ] }, { - "name" : "034", - "id" : "034", "data" : [ [ "Perl", @@ -919,10 +628,11 @@ "Blog", 11 ] - ] + ], + "name" : "034", + "id" : "034" }, { - "name" : "035", "data" : [ [ "Perl", @@ -937,9 +647,11 @@ 9 ] ], + "name" : "035", "id" : "035" }, { + "name" : "036", "data" : [ [ "Perl", @@ -954,11 +666,9 @@ 11 ] ], - "id" : "036", - "name" : "036" + "id" : "036" }, { - "name" : "037", "id" : "037", "data" : [ [ @@ -973,10 +683,10 @@ "Blog", 9 ] - ] + ], + "name" : "037" }, { - "id" : "038", "data" : [ [ "Perl", @@ -991,11 +701,11 @@ 12 ] ], - "name" : "038" + "name" : "038", + "id" : "038" }, { "name" : "039", - "id" : "039", "data" : [ [ "Perl", @@ -1009,10 +719,10 @@ "Blog", 12 ] - ] + ], + "id" : "039" }, { - "name" : "040", "data" : [ [ "Perl", @@ -1027,11 +737,11 @@ 10 ] ], + "name" : "040", "id" : "040" }, { "name" : "041", - "id" : "041", "data" : [ [ "Perl", @@ -1045,9 +755,11 @@ "Blog", 9 ] - ] + ], + "id" : "041" }, { + "name" : "042", "data" : [ [ "Perl", @@ -1062,8 +774,7 @@ 11 ] ], - "id" : "042", - "name" : "042" + "id" : "042" }, { "name" : "043", @@ -1084,7 +795,7 @@ "id" : "043" }, { - "name" : "044", + "id" : "044", "data" : [ [ "Perl", @@ -1099,10 +810,10 @@ 11 ] ], - "id" : "044" + "name" : "044" }, { - "id" : "045", + "name" : "045", "data" : [ [ "Perl", @@ -1117,10 +828,9 @@ 11 ] ], - "name" : "045" + "id" : "045" }, { - "name" : "046", "data" : [ [ "Perl", @@ -1135,11 +845,11 @@ 10 ] ], + "name" : "046", "id" : "046" }, { "name" : "047", - "id" : "047", "data" : [ [ "Perl", @@ -1153,9 +863,12 @@ "Blog", 10 ] - ] + ], + "id" : "047" }, { + "id" : "048", + "name" : "048", "data" : [ [ "Perl", @@ -1169,11 +882,10 @@ "Blog", 12 ] - ], - "id" : "048", - "name" : "048" + ] }, { + "id" : "049", "data" : [ [ "Perl", @@ -1188,12 +900,10 @@ 12 ] ], - "id" : "049", "name" : "049" }, { "name" : "050", - "id" : "050", "data" : [ [ "Perl", @@ -1207,9 +917,11 @@ "Blog", 12 ] - ] + ], + "id" : "050" }, { + "id" : "051", "data" : [ [ "Perl", @@ -1224,11 +936,9 @@ 11 ] ], - "id" : "051", "name" : "051" }, { - "name" : "052", "data" : [ [ "Perl", @@ -1243,11 +953,12 @@ 14 ] ], + "name" : "052", "id" : "052" }, { - "name" : "053", "id" : "053", + "name" : "053", "data" : [ [ "Perl", @@ -1264,7 +975,6 @@ ] }, { - "id" : "054", "data" : [ [ "Perl", @@ -1279,9 +989,11 @@ 16 ] ], - "name" : "054" + "name" : "054", + "id" : "054" }, { + "id" : "055", "data" : [ [ "Perl", @@ -1296,11 +1008,9 @@ 14 ] ], - "id" : "055", "name" : "055" }, { - "name" : "056", "data" : [ [ "Perl", @@ -1315,9 +1025,12 @@ 16 ] ], + "name" : "056", "id" : "056" }, { + "id" : "057", + "name" : "057", "data" : [ [ "Perl", @@ -1331,12 +1044,9 @@ "Blog", 15 ] - ], - "id" : "057", - "name" : "057" + ] }, { - "name" : "058", "data" : [ [ "Perl", @@ -1351,9 +1061,12 @@ 11 ] ], + "name" : "058", "id" : "058" }, { + "id" : "059", + "name" : "059", "data" : [ [ "Perl", @@ -1367,62 +1080,349 @@ "Blog", 15 ] - ], - "id" : "059", - "name" : "059" + ] }, { - "name" : "060", "data" : [ [ "Perl", - 20 + 22 ], [ "Raku", - 16 + 18 ], [ "Blog", - 6 + 7 ] ], + "name" : "060", "id" : "060" } ] }, - "subtitle" : { - "text" : "Click the columns