aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat
-rw-r--r--challenge-085/colin-crain/perl/ch-1.pl89
-rw-r--r--challenge-085/colin-crain/perl/ch-2.pl108
-rw-r--r--challenge-085/colin-crain/raku/ch-1.raku41
-rw-r--r--challenge-085/colin-crain/raku/ch-2.raku41
-rw-r--r--stats/pwc-current.json306
-rw-r--r--stats/pwc-language-breakdown-summary.json66
-rw-r--r--stats/pwc-language-breakdown.json606
-rw-r--r--stats/pwc-leaders.json418
-rw-r--r--stats/pwc-summary-1-30.json44
-rw-r--r--stats/pwc-summary-121-150.json94
-rw-r--r--stats/pwc-summary-151-180.json54
-rw-r--r--stats/pwc-summary-181-210.json44
-rw-r--r--stats/pwc-summary-31-60.json102
-rw-r--r--stats/pwc-summary-61-90.json106
-rw-r--r--stats/pwc-summary-91-120.json96
-rw-r--r--stats/pwc-summary.json450
16 files changed, 1476 insertions, 1189 deletions
diff --git a/challenge-085/colin-crain/perl/ch-1.pl b/challenge-085/colin-crain/perl/ch-1.pl
new file mode 100644
index 0000000000..85f56d7cfc
--- /dev/null
+++ b/challenge-085/colin-crain/perl/ch-1.pl
@@ -0,0 +1,89 @@
+#!/opt/local/bin/perl
+#
+# triple_combo.pl
+#
+# TASK #1 › Triplet Sum
+# Submitted by: Mohammad S Anwar
+# You are given an array of real numbers greater than zero.
+#
+# Write a script to find if there exists a triplet (a,b,c) such that
+# 1 < a+b+c < 2. Print 1 if you succeed otherwise 0.
+#
+# Example 1:
+# Input: @R = (1.2, 0.4, 0.1, 2.5)
+# Output: 1 as 1 < 1.2 + 0.4 + 0.1 < 2
+#
+# Example 2:
+# Input: @R = (0.2, 1.5, 0.9, 1.1)
+# Output: 0
+#
+# Example 3:
+# Input: @R = (0.5, 1.1, 0.3, 0.7)
+# Output: 1 as 1 < 0.5 + 1.1 + 0.3 < 2
+#
+# method:
+# another combinations task, but limited to sets of three members, n
+# choose 3. Rather that reach of a module, this time we'll just roll
+# up a combinations generator. It's generic and returns arrays of
+# indices rather than the actual selected array elements, so that
+# substitution takes place in the body of the routine.
+#
+# The combination sums are computed and verified immediately against
+# the conditional, and any that pass the test cause the program to
+# print a positive outcome and exit.
+#
+# We do not need to know the specific combination that summed to
+# within the range, nor whether there was more than one possible
+# such sequence. One is all that is needed to prove existence.
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+## ## ## ## ## MAIN:
+
+@ARGV == 0 and @ARGV = (1.2, 0.4, 0.1, 2.5);
+my @arr = @ARGV;
+
+my @index_combos = combinations( scalar( @arr ), 3 )->@* ;
+
+for (@index_combos) {
+ my $sum = 0;
+ for my $idx ($_->@*) {
+ $sum += $arr[$idx];
+ }
+ if (1 < $sum && $sum < 2 ) {
+ print 1;
+ exit;
+ }
+}
+print 0;
+
+
+
+## ## ## ## ## SUBS:
+
+sub combinations {
+## returns an array of array combinations from a sequence
+## of natural numbers starting at 0
+## we select $num_elems items from a list of $length items
+ my ($length, $num_elems, $list) = (@_, [[]]);
+ return $list if $list->[0]->@* == $num_elems;
+
+ my @newlist = ();
+ my $pos = $list->[0]->@*; ## this position, num_elems of prev list + 1
+
+ for my $combo ( $list->@* ) {
+ my $start = $combo->[-1] // -1 ; ## value of last elem in list + 1
+ my $end = $length - $num_elems + $pos; ## max - length + position
+
+ push @newlist, [ $combo->@*, $_ ] for (++$start .. $end );
+ }
+ return combinations( $length, $num_elems, \@newlist);
+}
+
diff --git a/challenge-085/colin-crain/perl/ch-2.pl b/challenge-085/colin-crain/perl/ch-2.pl
new file mode 100644
index 0000000000..97891fef7c
--- /dev/null
+++ b/challenge-085/colin-crain/perl/ch-2.pl
@@ -0,0 +1,108 @@
+#! /opt/local/bin/perl
+#
+# power_to_the_wholes.pl
+#
+# TASK #2 › Power of Two Integers
+# Submitted by: Mohammad S Anwar
+# You are given a positive integer $N.
+#
+# Write a script to find if it can be expressed as a ^ b
+# where a > 0 and b > 1. Print 1 if you succeed otherwise 0.
+#
+#
+# Example 1:
+# Input: 8
+# Output: 1 as 8 = 2 ^ 3
+#
+# Example 2:
+# Input: 15
+# Output: 0
+#
+# Example 3:
+# Input: 125
+# Output: 1 as 125 = 5 ^ 3
+#
+# method:
+# two solutions are provided. They both function the same way, only
+# one is a more verbose version that discusses the results and the other a minimal version
+# without frills that returns 1/0.
+
+# Both check every number up to the square root of
+# the target for divisibility. If a number is found to be a factor,
+# the target value is divided and the remainder checked; this
+# process continues until the last division yields a quotient of 1
+# or a remainder is found.
+
+# In the compact version the requested response is provided, so on
+# the first occurance of completely dividing the target down a 1 is
+# output and the program exits. In the verbose version the sucessful
+# value and power is noted and evaluation continues to find all
+# possible combinations of n ^ m that produce the target.
+#
+# As almost all numbers will not divide out and only a few will
+# continue up into multiple powers, the number of values checked
+# approaches just the square root, with checking multiple powers
+# making no meaningful difference as the input values get larger.
+
+# thus algorithmic complexity is O(√n)
+
+
+# By setting the $VERBOSE flag to 2, an complete blow-by-blow of the
+# calculation is displayed.
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use feature ":5.26";
+
+## ## ## ## ## MAIN:
+
+my $VERBOSE = 1;
+
+my $input = shift @ARGV || 16777216; ## 2^16, etc
+
+$VERBOSE and do {
+ say $_ for root_power_verbose($input);
+ say '';
+};
+
+# minimal
+for my $try ( 2..sqrt $input ) {
+ my $copy = $input;
+ while ($copy % $try == 0) {
+ $copy /= $try;
+ $copy == 1 and say 1 and exit;
+ }
+}
+
+say 0;
+
+
+## verbose
+## takes longer because it will not short-circuit, returns list of all solutions
+sub root_power_verbose {
+ my ($input) = @_;
+ my $max = sqrt $input;
+ my @out;
+
+ for my $try ( 2..$max ) {
+ say "trying $try" if $VERBOSE == 2;
+ my $count = 0;
+ my $copy = $input;
+ while ($copy % $try == 0) {
+ $count++;
+ say "\tcount is $count" if $VERBOSE == 2;
+ $copy /= $try;
+ if ($copy == 1) {
+ say "\t\t\tsuccess!" if $VERBOSE == 2;
+ push @out, "$try ^ $count";
+ }
+ }
+ }
+ return @out ? @out
+ : "no powers found";
+}
diff --git a/challenge-085/colin-crain/raku/ch-1.raku b/challenge-085/colin-crain/raku/ch-1.raku
new file mode 100644
index 0000000000..61fdb3646d
--- /dev/null
+++ b/challenge-085/colin-crain/raku/ch-1.raku
@@ -0,0 +1,41 @@
+#!/usr/bin/env perl6
+#
+#
+# triple_combo.raku
+#
+# TASK #1 › Triplet Sum
+# Submitted by: Mohammad S Anwar
+# You are given an array of real numbers greater than zero.
+#
+# Write a script to find if there exists a triplet (a,b,c) such that
+# 1 < a+b+c < 2. Print 1 if you succeed otherwise 0.
+#
+# Example 1:
+# Input: @R = (1.2, 0.4, 0.1, 2.5)
+# Output: 1 as 1 < 1.2 + 0.4 + 0.1 < 2
+#
+# Example 2:
+# Input: @R = (0.2, 1.5, 0.9, 1.1)
+# Output: 0
+#
+# Example 3:
+# Input: @R = (0.5, 1.1, 0.3, 0.7)
+# Output: 1 as 1 < 0.5 + 1.1 + 0.3 < 2
+
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN ( *@reals ) ;
+
+@reals.elems == 0 and @reals = (1.2, 0.4, 0.1, 2.5);
+
+
+say @reals .combinations(3)
+ .map({sum $_})
+ .grep({ 1 < $_ < 2 })
+ .elems ?? 1
+ !! 0 ;
+
diff --git a/challenge-085/colin-crain/raku/ch-2.raku b/challenge-085/colin-crain/raku/ch-2.raku
new file mode 100644
index 0000000000..a40fd7262d
--- /dev/null
+++ b/challenge-085/colin-crain/raku/ch-2.raku
@@ -0,0 +1,41 @@
+#!/usr/bin/env perl6
+#
+#
+# power-to-the-wholes.raku
+#
+# TASK #2 › Power of Two Integers
+# Submitted by: Mohammad S Anwar
+# You are given a positive integer $N.
+#
+# Write a script to find if it can be expressed as a ^ b
+# where a > 0 and b > 1. Print 1 if you succeed otherwise 0.
+#
+#
+# Example 1:
+# Input: 8
+# Output: 1 as 8 = 2 ^ 3
+#
+# Example 2:
+# Input: 15
+# Output: 0
+#
+# Example 3:
+# Input: 125
+# Output: 1 as 125 = 5 ^ 3
+
+#
+# 2020 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+unit sub MAIN (Int $input where $input > 0 = 823543) ; ## 7^7
+
+for 2..sqrt $input -> $try {
+ my $copy = $input;
+ while $copy %% $try and $copy /= $try {
+ $copy == 1 and 1.say and exit;
+ }
+}
+0.say;
+
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index 03e8230828..50d4a2bb6d 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -1,28 +1,10 @@
{
- "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/>"
- },
- "yAxis" : {
- "title" : {
- "text" : "Total Solutions"
- }
- },
"subtitle" : {
- "text" : "[Champions: 38] Last updated at 2020-11-09 02:05:04 GMT"
- },
- "legend" : {
- "enabled" : 0
- },
- "title" : {
- "text" : "Perl Weekly Challenge - 085"
+ "text" : "[Champions: 38] Last updated at 2020-11-09 06:26:18 GMT"
},
"drilldown" : {
"series" : [
{
- "name" : "Abigail",
- "id" : "Abigail",
"data" : [
[
"Perl",
@@ -32,9 +14,12 @@
"Blog",
2
]
- ]
+ ],
+ "id" : "Abigail",
+ "name" : "Abigail"
},
{
+ "name" : "Adam Russell",
"data" : [
[
"Perl",
@@ -45,20 +30,20 @@
2
]
],
- "id" : "Adam Russell",
- "name" : "Adam Russell"
+ "id" : "Adam Russell"
},
{
+ "id" : "Alexander Pankoff",
"data" : [
[
"Perl",
2
]
],
- "name" : "Alexander Pankoff",
- "id" : "Alexander Pankoff"
+ "name" : "Alexander Pankoff"
},
{
+ "name" : "Andrew Shitov",
"data" : [
[
"Raku",
@@ -69,10 +54,10 @@
1
]
],
- "name" : "Andrew Shitov",
"id" : "Andrew Shitov"
},
{
+ "name" : "Arne Sommer",
"data" : [
[
"Perl",
@@ -87,11 +72,9 @@
1
]
],
- "id" : "Arne Sommer",
- "name" : "Arne Sommer"
+ "id" : "Arne Sommer"
},
{
- "id" : "Athanasius",
"name" : "Athanasius",
"data" : [
[
@@ -102,21 +85,30 @@
"Raku",
2
]
- ]
+ ],
+ "id" : "Athanasius"
},
{
+ "name" : "Cheok-Yin Fung",
+ "id" : "Cheok-Yin Fung",
"data" : [
[
"Perl",
1
]
- ],
- "id" : "Cheok-Yin Fung",
- "name" : "Cheok-Yin Fung"
+ ]
},
{
"data" : [
[
+ "Perl",
+ 2
+ ],
+ [
+ "Raku",
+ 2
+ ],
+ [
"Blog",
1
]
@@ -125,24 +117,24 @@
"name" : "Colin Crain"
},
{
+ "name" : "Cristina Heredia",
"data" : [
[
"Perl",
2
]
],
- "name" : "Cristina Heredia",
"id" : "Cristina Heredia"
},
{
"name" : "Duncan C. White",
- "id" : "Duncan C. White",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Duncan C. White"
},
{
"name" : "E. Choroba",
@@ -155,17 +147,16 @@
]
},
{
+ "id" : "Feng Chang",
"data" : [
[
"Raku",
2
]
],
- "id" : "Feng Chang",
"name" : "Feng Chang"
},
{
- "name" : "Flavio Poletti",
"id" : "Flavio Poletti",
"data" : [
[
@@ -176,9 +167,12 @@
"Blog",
2
]
- ]
+ ],
+ "name" : "Flavio Poletti"
},
{
+ "name" : "Jaldhar H. Vyas",
+ "id" : "Jaldhar H. Vyas",
"data" : [
[
"Perl",
@@ -192,33 +186,31 @@
"Blog",
1
]
- ],
- "id" : "Jaldhar H. Vyas",
- "name" : "Jaldhar H. Vyas"
+ ]
},
{
- "id" : "James Smith",
"name" : "James Smith",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "James Smith"
},
{
+ "name" : "Jan Krnavek",
"data" : [
[
"Raku",
2
]
],
- "name" : "Jan Krnavek",
"id" : "Jan Krnavek"
},
{
- "id" : "Jorg Sommrey",
"name" : "Jorg Sommrey",
+ "id" : "Jorg Sommrey",
"data" : [
[
"Perl",
@@ -232,7 +224,6 @@
},
{
"name" : "Julio de Castro",
- "id" : "Julio de Castro",
"data" : [
[
"Perl",
@@ -242,37 +233,38 @@
"Raku",
2
]
- ]
+ ],
+ "id" : "Julio de Castro"
},
{
"id" : "Kai Burgdorf",
- "name" : "Kai Burgdorf",
"data" : [
[
"Perl",
1
]
- ]
+ ],
+ "name" : "Kai Burgdorf"
},
{
- "id" : "Kang-min Liu",
- "name" : "Kang-min Liu",
"data" : [
[
"Raku",
2
]
- ]
+ ],
+ "id" : "Kang-min Liu",
+ "name" : "Kang-min Liu"
},
{
+ "name" : "Lars Thegler",
+ "id" : "Lars Thegler",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Lars Thegler",
- "name" : "Lars Thegler"
+ ]
},
{
"data" : [
@@ -289,22 +281,22 @@
1
]
],
- "name" : "Laurent Rosenfeld",
- "id" : "Laurent Rosenfeld"
+ "id" : "Laurent Rosenfeld",
+ "name" : "Laurent Rosenfeld"
},
{
- "name" : "Lubos Kolouch",
"id" : "Lubos Kolouch",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "Lubos Kolouch"
},
{
- "id" : "Mark Anderson",
"name" : "Mark Anderson",
+ "id" : "Mark Anderson",
"data" : [
[
"Raku",
@@ -313,6 +305,8 @@
]
},
{
+ "name" : "Myoungjin Jeon",
+ "id" : "Myoungjin Jeon",
"data" : [
[
"Perl",
@@ -326,43 +320,41 @@
"Blog",
2
]
- ],
- "id" : "Myoungjin Jeon",
- "name" : "Myoungjin Jeon"
+ ]
},
{
"name" : "Niels van Dijke",
- "id" : "Niels van Dijke",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Niels van Dijke"
},
{
"id" : "Nuno Vieira",
- "name" : "Nuno Vieira",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "Nuno Vieira"
},
{
- "name" : "Pete Houston",
"id" : "Pete Houston",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "name" : "Pete Houston"
},
{
- "id" : "Roger Bell_West",
"name" : "Roger Bell_West",
+ "id" : "Roger Bell_West",
"data" : [
[
"Perl",
@@ -379,6 +371,7 @@
]
},
{
+ "id" : "Samir Parikh",
"data" : [
[
"Perl",
@@ -389,22 +382,19 @@
1
]
],
- "name" : "Samir Parikh",
- "id" : "Samir Parikh"
+ "name" : "Samir Parikh"
},
{
- "id" : "Shawn Wagner",
"name" : "Shawn Wagner",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Shawn Wagner"
},
{
- "id" : "Simon Green",
- "name" : "Simon Green",
"data" : [
[
"Perl",
@@ -414,16 +404,18 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Simon Green",
+ "name" : "Simon Green"
},
{
+ "name" : "Simon Proctor",
"data" : [
[
"Raku",
2
]
],
- "name" : "Simon Proctor",
"id" : "Simon Proctor"
},
{
@@ -437,17 +429,16 @@
]
},
{
+ "name" : "Stuart Little",
+ "id" : "Stuart Little",
"data" : [
[
"Raku",
2
]
- ],
- "name" : "Stuart Little",
- "id" : "Stuart Little"
+ ]
},
{
- "name" : "Ulrich Rieke",
"id" : "Ulrich Rieke",
"data" : [
[
@@ -458,7 +449,8 @@
"Raku",
2
]
- ]
+ ],
+ "name" : "Ulrich Rieke"
},
{
"name" : "Walt Mankowski",
@@ -471,37 +463,46 @@
]
},
{
- "name" : "Wanderdoc",
- "id" : "Wanderdoc",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Wanderdoc",
+ "name" : "Wanderdoc"
}
]
},
- "plotOptions" : {
- "series" : {
- "dataLabels" : {
- "format" : "{point.y}",
- "enabled" : 1
- },
- "borderWidth" : 0
+ "title" : {
+ "text" : "Perl Weekly Challenge - 085"
+ },
+ "yAxis" : {
+ "title" : {
+ "text" : "Total Solutions"
}
},
+ "chart" : {
+ "type" : "column"
+ },
+ "legend" : {
+ "enabled" : 0
+ },
"xAxis" : {
"type" : "category"
},
+ "tooltip" : {
+ "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/>",
+ "followPointer" : 1
+ },
"series" : [
{
- "colorByPoint" : 1,
"data" : [
{
"drilldown" : "Abigail",
- "y" : 4,
- "name" : "Abigail"
+ "name" : "Abigail",
+ "y" : 4
},
{
"y" : 4,
@@ -515,13 +516,13 @@
},
{
"name" : "Andrew Shitov",
- "y" : 3,
- "drilldown" : "Andrew Shitov"
+ "drilldown" : "Andrew Shitov",
+ "y" : 3
},
{
+ "name" : "Arne Sommer",
"drilldown" : "Arne Sommer",
- "y" : 5,
- "name" : "Arne Sommer"
+ "y" : 5
},
{
"name" : "Athanasius",
@@ -535,8 +536,8 @@
},
{
"drilldown" : "Colin Crain",
- "y" : 1,
- "name" : "Colin Crain"
+ "name" : "Colin Crain",
+ "y" : 5
},
{
"y" : 2,
@@ -545,8 +546,8 @@
},
{
"name" : "Duncan C. White",
- "y" : 2,
- "drilldown" : "Duncan C. White"
+ "drilldown" : "Duncan C. White",
+ "y" : 2
},
{
"drilldown" : "E. Choroba",
@@ -554,19 +555,19 @@
"name" : "E. Choroba"
},
{
+ "name" : "Feng Chang",
"drilldown" : "Feng Chang",
- "y" : 2,
- "name" : "Feng Chang"
+ "y" : 2
},
{
- "drilldown" : "Flavio Poletti",
"y" : 4,
+ "drilldown" : "Flavio Poletti",
"name" : "Flavio Poletti"
},
{
- "name" : "Jaldhar H. Vyas",
"y" : 5,
- "drilldown" : "Jaldhar H. Vyas"
+ "drilldown" : "Jaldhar H. Vyas",
+ "name" : "Jaldhar H. Vyas"
},
{
"name" : "James Smith",
@@ -574,78 +575,78 @@
"y" : 2
},
{
+ "drilldown" : "Jan Krnavek",
"name" : "Jan Krnavek",
- "y" : 2,
- "drilldown" : "Jan Krnavek"
+ "y" : 2
},
{
"drilldown" : "Jorg Sommrey",
- "y" : 3,
- "name" : "Jorg Sommrey"
+ "name" : "Jorg Sommrey",
+ "y" : 3
},
{
+ "drilldown" : "Julio de Castro",
"name" : "Julio de Castro",
- "y" : 4,
- "drilldown" : "Julio de Castro"
+ "y" : 4
},
{
- "y" : 1,
"drilldown" : "Kai Burgdorf",
+ "y" : 1,
"name" : "Kai Burgdorf"
},
{
- "name" : "Kang-min Liu",
+ "drilldown" : "Kang-min Liu",
"y" : 2,
- "drilldown" : "Kang-min Liu"
+ "name" : "Kang-min Liu"
},
{
- "name" : "Lars Thegler",
"drilldown" : "Lars Thegler",
+ "name" : "Lars Thegler",
"y" : 2
},
{
- "name" : "Laurent Rosenfeld",
"drilldown" : "Laurent Rosenfeld",
- "y" : 5
+ "y" : 5,
+ "name" : "Laurent Rosenfeld"
},
{
- "y" : 2,
+ "name" : "Lubos Kolouch",
"drilldown" : "Lubos Kolouch",
- "name" : "Lubos Kolouch"
+ "y" : 2
},
{
- "name" : "Mark Anderson",
"drilldown" : "Mark Anderson",
+ "name" : "Mark Anderson",
"y" : 2
},
{
+ "drilldown" : "Myoungjin Jeon",
"name" : "Myoungjin Jeon",
- "y" : 6,
- "drilldown" : "Myoungjin Jeon"
+ "y" : 6
},
{
- "name" : "Niels van Dijke",
+ "y" : 2,
"drilldown" : "Niels van Dijke",
- "y" : 2
+ "name" : "Niels van Dijke"
},
{
"name" : "Nuno Vieira",
- "y" : 2,
- "drilldown" : "Nuno Vieira"
+ "drilldown" : "Nuno Vieira",
+ "y" : 2
},
{
- "name" : "Pete Houston",
"drilldown" : "Pete Houston",
- "y" : 2
+ "y" : 2,
+ "name" : "Pete Houston"
},
{
- "name" : "Roger Bell_West",
+ "drilldown" : "Roger Bell_West",
"y" : 5,
- "drilldown" : "Roger Bell_West"
+ "name" : "Roger Bell_West"
},
{
- "y" : 3,
"drilldown" : "Samir Parikh",
+ "y" : 3,
"name" : "Samir Parikh"
},
{
@@ -659,40 +660,47 @@
"name" : "Simon Green"
},
{
+ "drilldown" : "Simon Proctor",
"name" : "Simon Proctor",
- "y" : 2,
- "drilldown" : "Simon Proctor"
+ "y" : 2
},
{
- "name" : "Steve Rogerson",
"y" : 2,
- "drilldown" : "Steve Rogerson"
+ "drilldown" : "Steve Rogerson",
+ "name" : "Steve Rogerson"
},
{
- "name" : "Stuart Little",
+ "y" : 2,
"drilldown" : "Stuart Little",
- "y" : 2
+ "name" : "Stuart Little"
},
{
"name" : "Ulrich Rieke",
- "y" : 4,
- "drilldown" : "Ulrich Rieke"
+ "drilldown" : "Ulrich Rieke",
+ "y" : 4
},
{
- "y" : 2,
+ "name" : "Walt Mankowski",
"drilldown" : "Walt Mankowski",
- "name" : "Walt Mankowski"
+ "y" : 2
},
{
"name" : "Wanderdoc",
- "y" : 2,
- "drilldown" : "Wanderdoc"
+ "drilldown" : "Wanderdoc",
+ "y" : 2
}
],
+ "colorByPoint" : 1,
"name" : "Perl Weekly Challenge - 085"
}
],
- "chart" : {
- "type" : "column"
+ "plotOptions" : {
+ "series" : {
+ "dataLabels" : {
+ "format" : "{point.y}",
+ "enabled" : 1
+ },
+ "borderWidth" : 0
+ }
}
}
diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json
index 0d9c023d58..58b2ee0a78 100644
--- a/stats/pwc-language-breakdown-summary.json
+++ b/stats/pwc-language-breakdown-summary.json
@@ -1,15 +1,24 @@
{
- "xAxis" : {
- "labels" : {
- "style" : {
- "fontFamily" : "Verdana, sans-serif",
- "fontSize" : "13px"
- }
- },
- "type" : "category"
+ "title" : {
+ "text" : "Perl Weekly Challenge Contributions [2019 - 2020]"
+ },
+ "subtitle" : {
+ "text" : "Last updated at 2020-11-09 06:26:18 GMT"
},
"series" : [
{
+ "dataLabels" : {
+ "y" : 10,
+ "align" : "right",
+ "format" : "{point.y:.0f}",