aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMohammad S Anwar <mohammad.anwar@yahoo.com>2022-11-28 04:21:29 +0000
committerMohammad S Anwar <mohammad.anwar@yahoo.com>2022-11-28 04:21:29 +0000
commit17682ec23006095cb17c217bcfd2a0eb4ef93202 (patch)
tree31c76c70bc9ce226ef5ac34cb3ef37f0d9e2c50b
parentf4fdb3060ba3983073ab5f6285b4b35d5881341b (diff)
downloadperlweeklychallenge-club-17682ec23006095cb17c217bcfd2a0eb4ef93202.tar.gz
perlweeklychallenge-club-17682ec23006095cb17c217bcfd2a0eb4ef93202.tar.bz2
perlweeklychallenge-club-17682ec23006095cb17c217bcfd2a0eb4ef93202.zip
- Added solutions by Colin Crain.
Diffstat
-rw-r--r--challenge-192/colin-crain/blog.txt1
-rwxr-xr-xchallenge-192/colin-crain/perl/ch-1.pl75
-rwxr-xr-xchallenge-192/colin-crain/perl/ch-2.pl222
-rw-r--r--stats/pwc-current.json575
-rw-r--r--stats/pwc-language-breakdown-summary.json32
-rw-r--r--stats/pwc-language-breakdown.json1352
-rw-r--r--stats/pwc-leaders.json380
-rw-r--r--stats/pwc-summary-1-30.json102
-rw-r--r--stats/pwc-summary-121-150.json34
-rw-r--r--stats/pwc-summary-151-180.json100
-rw-r--r--stats/pwc-summary-181-210.json36
-rw-r--r--stats/pwc-summary-211-240.json98
-rw-r--r--stats/pwc-summary-241-270.json102
-rw-r--r--stats/pwc-summary-271-300.json22
-rw-r--r--stats/pwc-summary-31-60.json42
-rw-r--r--stats/pwc-summary-61-90.json36
-rw-r--r--stats/pwc-summary-91-120.json40
-rw-r--r--stats/pwc-summary.json52
18 files changed, 1809 insertions, 1492 deletions
diff --git a/challenge-192/colin-crain/blog.txt b/challenge-192/colin-crain/blog.txt
new file mode 100644
index 0000000000..daaf31f9dc
--- /dev/null
+++ b/challenge-192/colin-crain/blog.txt
@@ -0,0 +1 @@
+https://colincrain.com/2022/11/27/liberte-egalite-fraternite
diff --git a/challenge-192/colin-crain/perl/ch-1.pl b/challenge-192/colin-crain/perl/ch-1.pl
new file mode 100755
index 0000000000..d892fc0148
--- /dev/null
+++ b/challenge-192/colin-crain/perl/ch-1.pl
@@ -0,0 +1,75 @@
+#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# flipping-your-wig.pl
+#
+# Binary Flip
+# Submitted by: Mohammad S Anwar
+# You are given a positive integer, $n.
+#
+# Write a script to find the binary flip.
+#
+# Example 1
+# Input: $n = 5
+# Output: 2
+#
+# First find the binary equivalent of the given integer, 101.
+# Then flip the binary digits 0 -> 1 and 1 -> 0 and we get 010.
+# So Binary 010 => Decimal 2.
+#
+# Example 2
+# Input: $n = 4
+# Output: 3
+#
+# Decimal 4 = Binary 100
+# Flip 0 -> 1 and 1 -> 0, we get 011.
+# Binary 011 = Decimal 3
+#
+# Example 3
+# Input: $n = 6
+# Output: 1
+#
+# Decimal 6 = Binary 110
+# Flip 0 -> 1 and 1 -> 0, we get 001.
+# Binary 001 = Decimal 1
+#
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+
+
+sub binary_flip ( $n ) {
+ return $n ^ calc_binary_ones( $n );
+}
+
+sub calc_binary_ones ( $n, $bin = 1 ) {
+ $bin *= 2 while $bin <= $n;
+ return $bin - 1;
+}
+
+
+
+
+use Test::More;
+
+is binary_flip(5), 2, 'ex-1';
+is binary_flip(4), 3, 'ex-2';
+is binary_flip(6), 1, 'ex-3';
+
+is binary_flip(1), 0, 'extra-1';
+is binary_flip(2), 1, 'extra-2';
+is binary_flip(3), 0, 'extra-3';
+is binary_flip(7), 0, 'extra-7';
+is binary_flip(8), 7, 'extra-8';
+is binary_flip(9), 6, 'extra-9';
+
+
+done_testing();
diff --git a/challenge-192/colin-crain/perl/ch-2.pl b/challenge-192/colin-crain/perl/ch-2.pl
new file mode 100755
index 0000000000..713538c8d0
--- /dev/null
+++ b/challenge-192/colin-crain/perl/ch-2.pl
@@ -0,0 +1,222 @@
+#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# liberté-égalité-fraternité.pl
+#
+# Equal Distribution
+# Submitted by: Mohammad S Anwar
+# You are given a list of integers greater than or equal to zero,
+# @list.
+#
+# Write a script to distribute the number so that each members are
+# same. If you succeed then print the total moves otherwise print
+# -1.
+#
+# Please follow the rules (as suggested by Neils van Dijke
+# [2022-11-21 13:00]
+#
+# 1) You can only move a value of '1' per move
+# 2) You are only allowed to move a value of '1' to a direct
+# neighbor/adjacent cell
+#
+# Example 1:
+# Input: @list = (1, 0, 5)
+# Output: 4
+#
+# Move #1: 1, 1, 4
+# (2nd cell gets 1 from the 3rd cell)
+#
+# Move #2: 1, 2, 3
+# (2nd cell gets 1 from the 3rd cell)
+#
+# Move #3: 2, 1, 3
+# (1st cell get 1 from the 2nd cell)
+#
+# Move #4: 2, 2, 2
+# (2nd cell gets 1 from the 3rd cell)
+#
+# Example 2:
+# Input: @list = (0, 2, 0)
+# Output: -1
+#
+# It is not possible to make each same.
+#
+# Example 3:
+# Input: @list = (0, 3, 0)
+# Output: 2
+#
+# Move #1: 1, 2, 0
+# (1st cell gets 1 from the 2nd cell)
+#
+# Move #2: 1, 1, 1
+# (3rd cell gets 1 from the 2nd cell)
+
+# analysis:
+#
+# What a curious puzzle! essentailly a model of diffusion, we
+# wish to take an irregular field of data and progressively
+# smooth it until we obtain a continuous lowest-energy state.
+# Only instead of operating on all points simultaniously, we
+# make one ajustement at a time in discrete steps of one unit.
+#
+# In diffusion, differeneces between a local state and its
+# neighbors are distributed between the two, raising the value
+# of one and lowering the other. Should the values be the same
+# there is no reasonto change anything. With fields in real
+# space this is an application of the calculus, but here in our
+# simplified, stepwise model we don't need the complexity that
+# entails. Instead we need an algorithm that locates the next
+# best difference between two adjacent values and adjusts the
+# higher to the lower. Exactly what that means remains to be
+# determined.
+
+# It seems the first thing to do is make sure a general
+# integral leveling is even possible. If the sum of all values
+# is not evenly divisible by the number of pockets there's no
+# point in continuing. If it is, then this is our target value.
+#
+# The rules do not expressly demand we do the leveling as
+# quickly as possible, so we'll worry about optimization after
+# we've come up with any way to accomplish our goal at all. And
+# again we are back to performing the best move over and over
+# until we get there.
+#
+# What would the best move be? It seems moving the maximal
+# value one position in the direction of the minimum would be a
+# good strategy. Let's implement that. WHat's the worst thing
+# that could possibly happen?
+#
+# method:
+#
+# Starting small, we'll need functions to determine the minimum
+# and maximum values within the array, and the positions where
+# thay are located. This will involve iterating across the
+# array and keeping a running tally. In theory this looping
+# could be collected into a single combined function, but for
+# clarity we'll keep the actions clearly deliniated. The
+# maximum counts upward from negative infinity, the minimum
+# down from infinity. These tallies too could be started from
+# the value for the first index but I find the special string
+# for infinity underused and conceptually robust. So why not?
+#
+# Next we will need a move action. Given a position to more
+# from and a position to move towards, this function will just
+# change the array in-place instead of returning and rewriting
+# the array variable. This too seems conceptually pure. Less
+# copying, just change the thing itself.
+#
+# Finally arriving at the meat of the matter, the solve
+# function takes the array and decides whether or not there is
+# a solution using modular division. After calculating an
+# initial minimum and maximum the process is handed to a loop,
+# moving one value at a time and recalculating the leftmost min
+# and max until the two values are equal.
+#
+# As it works out we don't actually need the target value after
+# all. A counter keeps track of the number of cycles through
+# the loop, counting the applications of the move function.
+# Because I found the movements fasinating, I left in a VERBOSE
+# switch to detail the individual moves as they are made.
+#
+# Because the algortihm identifies the largest difference
+# between elements in the system and their relative placements,
+# and then moves to equalize the discrepancy from high to low
+# in the direction found, it should always terminate if an
+# equal state exists. Because it does not care about absolute
+# values, it works for any whole number input. As there is no
+# cause for backtracking, the resulting solution should use the
+# minimum number of moves.
+#
+#
+#
+#
+# © 2022 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+use constant VERBOSE => 1;
+
+
+
+sub max_pos ( @array ) {
+## returns position and value of maximum element values
+## leftmost value is returned in case of multiple occurences
+ my ($max, $pos) = ( "-Inf", 0 );
+ for (0..$#array) {
+ if ($array[$_] > $max) {
+ ($max, $pos) = ($array[$_], $_);
+ }
+ }
+ return ($max, $pos);
+}
+
+sub min_pos ( @array ) {
+## returns position and value of minimum element values
+## leftmost value is returned in case of multiple occurences
+ my ($min, $pos) = ( "Inf", 0 );
+ for (0..$#array) {
+ if ($array[$_] < $min) {
+ ($min, $pos) = ($array[$_], $_);
+ };
+ }
+ return ($min, $pos);
+}
+
+sub move ( $maxpos, $minpos, $arr ) {
+## alters the array in-place via reference
+ $arr->[$maxpos]--;
+ $maxpos > $minpos
+ ? $arr->[$maxpos-1]++
+ : $arr->[$maxpos+1]++ ;
+}
+
+sub solve ( @array ) {
+ ## first check to see it's possible
+ my $sum;
+ $sum += $_ for @array;
+ return -1 if $sum % @array;
+
+ ## set the stage
+ my ($max, $maxpos) = max_pos ( @array );
+ my ($min, $minpos) = min_pos ( @array );
+ VERBOSE and say "@array max $max min $min";
+
+ my $moves;
+
+ ## move values by 1 until lowest state
+ while ( $max > $min and ++$moves ) {
+ move( $maxpos, $minpos, \@array );
+ ($max, $maxpos) = max_pos ( @array );
+ ($min, $minpos) = min_pos ( @array );
+ VERBOSE and say "@array max $max min $min";
+ }
+ return $moves;
+}
+
+
+
+## input and processing
+my @array = @ARGV;
+@array == 0 and @array = (10, -5, 15, -6, 0, 4);
+
+
+
+## report
+my $res = solve( @array );
+VERBOSE or say $res and exit;
+
+$res > -1
+ ? say "solved in ", $res, "\n"
+ : say "no solution\n";
+
+say "input : @array";
+say "output: $res";
+
+
diff --git a/stats/pwc-current.json b/stats/pwc-current.json
index dc380b7fcb..38ee8129d8 100644
--- a/stats/pwc-current.json
+++ b/stats/pwc-current.json
@@ -4,9 +4,228 @@
"text" : "Total Solutions"
}
},
+ "title" : {
+ "text" : "The Weekly Challenge - 192"
+ },
+ "xAxis" : {
+ "type" : "category"
+ },
+ "chart" : {
+ "type" : "column"
+ },
+ "plotOptions" : {
+ "series" : {
+ "borderWidth" : 0,
+ "dataLabels" : {
+ "format" : "{point.y}",
+ "enabled" : 1
+ }
+ }
+ },
+ "tooltip" : {
+ "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>",
+ "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>",
+ "followPointer" : 1
+ },
+ "legend" : {
+ "enabled" : 0
+ },
+ "series" : [
+ {
+ "data" : [
+ {
+ "name" : "Adam Russell",
+ "drilldown" : "Adam Russell",
+ "y" : 4
+ },
+ {
+ "drilldown" : "Alexander Pankoff",
+ "y" : 5,
+ "name" : "Alexander Pankoff"
+ },
+ {
+ "y" : 4,
+ "drilldown" : "Ali Moradi",
+ "name" : "Ali Moradi"
+ },
+ {
+ "drilldown" : "Athanasius",
+ "name" : "Athanasius",
+ "y" : 4
+ },
+ {
+ "drilldown" : "Bruce Gray",
+ "name" : "Bruce Gray",
+ "y" : 5
+ },
+ {
+ "drilldown" : "Cheok-Yin Fung",
+ "name" : "Cheok-Yin Fung",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Colin Crain",
+ "y" : 3,
+ "name" : "Colin Crain"
+ },
+ {
+ "y" : 1,
+ "drilldown" : "Dario Mazzeo",
+ "name" : "Dario Mazzeo"
+ },
+ {
+ "drilldown" : "Dave Jacoby",
+ "name" : "Dave Jacoby",
+ "y" : 2
+ },
+ {
+ "drilldown" : "E. Choroba",
+ "y" : 2,
+ "name" : "E. Choroba"
+ },
+ {
+ "drilldown" : "Flavio Poletti",
+ "y" : 6,
+ "name" : "Flavio Poletti"
+ },
+ {
+ "drilldown" : "Humberto Massa",
+ "name" : "Humberto Massa",
+ "y" : 2
+ },
+ {
+ "y" : 3,
+ "drilldown" : "James Smith",
+ "name" : "James Smith"
+ },
+ {
+ "name" : "Jan Krnavek",
+ "drilldown" : "Jan Krnavek",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Jorg Sommrey",
+ "y" : 3,
+ "name" : "Jorg Sommrey"
+ },
+ {
+ "drilldown" : "Kueppo Wesley",
+ "name" : "Kueppo Wesley",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Laurent Rosenfeld",
+ "y" : 5,
+ "name" : "Laurent Rosenfeld"
+ },
+ {
+ "drilldown" : "Luca Ferrari",
+ "name" : "Luca Ferrari",
+ "y" : 8
+ },
+ {
+ "name" : "Mark Anderson",
+ "drilldown" : "Mark Anderson",
+ "y" : 2
+ },
+ {
+ "name" : "Marton Polgar",
+ "drilldown" : "Marton Polgar",
+ "y" : 2
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Mohammad S Anwar",
+ "name" : "Mohammad S Anwar"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Niels van Dijke",
+ "name" : "Niels van Dijke"
+ },
+ {
+ "drilldown" : "Olivier Delouya",
+ "y" : 1,
+ "name" : "Olivier Delouya"
+ },
+ {
+ "drilldown" : "Peter Campbell Smith",
+ "y" : 3,
+ "name" : "Peter Campbell Smith"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Robbie Hatley",
+ "name" : "Robbie Hatley"
+ },
+ {
+ "y" : 4,
+ "drilldown" : "Robert DiCicco",
+ "name" : "Robert DiCicco"
+ },
+ {
+ "name" : "Robert Ransbottom",
+ "drilldown" : "Robert Ransbottom",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Roger Bell_West",
+ "name" : "Roger Bell_West",
+ "y" : 5
+ },
+ {
+ "drilldown" : "Simon Green",
+ "name" : "Simon Green",
+ "y" : 3
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Simon Proctor",
+ "name" : "Simon Proctor"
+ },
+ {
+ "drilldown" : "Solathian",
+ "name" : "Solathian",
+ "y" : 2
+ },
+ {
+ "drilldown" : "Stephen G. Lynn",
+ "y" : 5,
+ "name" : "Stephen G. Lynn"
+ },
+ {
+ "y" : 2,
+ "drilldown" : "Tim Potapov",
+ "name" : "Tim Potapov"
+ },
+ {
+ "drilldown" : "Ulrich Rieke",
+ "y" : 4,
+ "name" : "Ulrich Rieke"
+ },
+ {
+ "name" : "Vamsi Meenavilli",
+ "drilldown" : "Vamsi Meenavilli",
+ "y" : 2
+ },
+ {
+ "drilldown" : "W. Luis Mochan",
+ "name" : "W. Luis Mochan",
+ "y" : 3
+ }
+ ],
+ "colorByPoint" : 1,
+ "name" : "The Weekly Challenge - 192"
+ }
+ ],
+ "subtitle" : {
+ "text" : "[Champions: 36] Last updated at 2022-11-28 04:16:52 GMT"
+ },
"drilldown" : {
"series" : [
{
+ "id" : "Adam Russell",
+ "name" : "Adam Russell",
"data" : [
[
"Perl",
@@ -16,12 +235,9 @@
"Blog",
2
]
- ],
- "name" : "Adam Russell",
- "id" : "Adam Russell"
+ ]
},
{
- "id" : "Alexander Pankoff",
"data" : [
[
"Perl",
@@ -36,9 +252,11 @@
1
]
],
+ "id" : "Alexander Pankoff",
"name" : "Alexander Pankoff"
},
{
+ "id" : "Ali Moradi",
"name" : "Ali Moradi",
"data" : [
[
@@ -49,11 +267,11 @@
"Raku",
2
]
- ],
- "id" : "Ali Moradi"
+ ]
},
{
"id" : "Athanasius",
+ "name" : "Athanasius",
"data" : [
[
"Perl",
@@ -63,11 +281,9 @@
"Raku",
2
]
- ],
- "name" : "Athanasius"
+ ]
},
{
- "id" : "Bruce Gray",
"data" : [
[
"Perl",
@@ -82,6 +298,7 @@
1
]
],
+ "id" : "Bruce Gray",
"name" : "Bruce Gray"
},
{
@@ -95,34 +312,48 @@
"id" : "Cheok-Yin Fung"
},
{
- "id" : "Dario Mazzeo",
+ "data" : [
+ [
+ "Perl",
+ 2
+ ],
+ [
+ "Blog",
+ 1
+ ]
+ ],
+ "name" : "Colin Crain",
+ "id" : "Colin Crain"
+ },
+ {
"data" : [
[
"Perl",
1
]
],
- "name" : "Dario Mazzeo"
+ "name" : "Dario Mazzeo",
+ "id" : "Dario Mazzeo"
},
{
"id" : "Dave Jacoby",
+ "name" : "Dave Jacoby",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Dave Jacoby"
+ ]
},
{
- "id" : "E. Choroba",
"data" : [
[
"Perl",
2
]
],
- "name" : "E. Choroba"
+ "name" : "E. Choroba",
+ "id" : "E. Choroba"
},
{
"data" : [
@@ -139,22 +370,20 @@
2
]
],
- "name" : "Flavio Poletti",
- "id" : "Flavio Poletti"
+ "id" : "Flavio Poletti",
+ "name" : "Flavio Poletti"
},
{
- "name" : "Humberto Massa",
"data" : [
[
"Raku",
2
]
],
- "id" : "Humberto Massa"
+ "id" : "Humberto Massa",
+ "name" : "Humberto Massa"
},
{
- "id" : "James Smith",
- "name" : "James Smith",
"data" : [
[
"Perl",
@@ -164,17 +393,19 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "James Smith",
+ "name" : "James Smith"
},
{
"name" : "Jan Krnavek",
+ "id" : "Jan Krnavek",
"data" : [
[
"Raku",
2
]
- ],
- "id" : "Jan Krnavek"
+ ]
},
{
"data" : [
@@ -191,18 +422,16 @@
"id" : "Jorg Sommrey"
},
{
- "name" : "Kueppo Wesley",
"data" : [
[
"Perl",
2
]
],
+ "name" : "Kueppo Wesley",
"id" : "Kueppo Wesley"
},
{
- "id" : "Laurent Rosenfeld",
- "name" : "Laurent Rosenfeld",
"data" : [
[
"Perl",
@@ -216,9 +445,13 @@
"Blog",
1
]
- ]
+ ],
+ "id" : "Laurent Rosenfeld",
+ "name" : "Laurent Rosenfeld"
},
{
+ "id" : "Luca Ferrari",
+ "name" : "Luca Ferrari",
"data" : [
[
"Raku",
@@ -228,32 +461,29 @@
"Blog",
6
]
- ],
- "name" : "Luca Ferrari",
- "id" : "Luca Ferrari"
+ ]
},
{
- "name" : "Mark Anderson",
"data" : [
[
"Raku",
2
]
],
- "id" : "Mark Anderson"
+ "id" : "Mark Anderson",
+ "name" : "Mark Anderson"
},
{
"id" : "Marton Polgar",
+ "name" : "Marton Polgar",
"data" : [
[
"Raku",
2
]
- ],
- "name" : "Marton Polgar"
+ ]
},
{
- "name" : "Mohammad S Anwar",
"data" : [
[
"Perl",
@@ -264,29 +494,31 @@
1
]
],
- "id" : "Mohammad S Anwar"
+ "id" : "Mohammad S Anwar",
+ "name" : "Mohammad S Anwar"
},
{
- "id" : "Niels van Dijke",
"data" : [
[
"Perl",
2
]
],
- "name" : "Niels van Dijke"
+ "name" : "Niels van Dijke",
+ "id" : "Niels van Dijke"
},
{
- "name" : "Olivier Delouya",
"data" : [
[
"Perl",
1
]
],
+ "name" : "Olivier Delouya",
"id" : "Olivier Delouya"
},
{
+ "id" : "Peter Campbell Smith",
"name" : "Peter Campbell Smith",
"data" : [
[
@@ -297,18 +529,17 @@
"Blog",
1
]
- ],
- "id" : "Peter Campbell Smith"
+ ]
},
{
"name" : "Robbie Hatley",
+ "id" : "Robbie Hatley",
"data" : [
[
"Perl",
2
]
- ],
- "id" : "Robbie Hatley"
+ ]
},
{
"data" : [
@@ -321,8 +552,8 @@
2
]
],
- "name" : "Robert DiCicco",
- "id" : "Robert DiCicco"
+ "id" : "Robert DiCicco",
+ "name" : "Robert DiCicco"
},
{
"data" : [
@@ -331,10 +562,11 @@
2
]
],
- "name" : "Robert Ransbottom",
- "id" : "Robert Ransbottom"
+ "id" : "Robert Ransbottom",
+ "name" : "Robert Ransbottom"
},
{
+ "id" : "Roger Bell_West",
"name" : "Roger Bell_West",
"data" : [
[
@@ -349,11 +581,9 @@
"Blog",
1
]
- ],
- "id" : "Roger Bell_West"
+ ]
},
{
- "id" : "Simon Green",
"data" : [
[
"Perl",
@@ -364,27 +594,28 @@
1
]
],
+ "id" : "Simon Green",
"name" : "Simon Green"
},
{
+ "name" : "Simon Proctor",
+ "id" : "Simon Proctor",
"data" : [
[
"Raku",
2
]
- ],
- "name" : "Simon Proctor",
- "id" : "Simon Proctor"
+ ]
},
{
- "id" : "Solathian",
- "name" : "Solathian",
"data" : [
[
"Perl",
2
]
- ]
+ ],
+ "id" : "Solathian",
+ "name" : "Solathian"
},
{
"id" : "Stephen G. Lynn",
@@ -405,16 +636,17 @@
]
},
{
+ "id" : "Tim Potapov",
+ "name" : "Tim Potapov",
"data" : [
[
"Perl",
2
]
- ],
- "name" : "Tim Potapov",
- "id" : "Tim Potapov"
+ ]
},
{
+ "id" : "Ulrich Rieke",
"name" : "Ulrich Rieke",
"data" : [
[
@@ -425,21 +657,21 @@
"Raku",
2
]
- ],
- "id" : "Ulrich Rieke"
+ ]
},
{
- "id" : "Vamsi Meenavilli",
"data" : [
[
"Perl",
2
]
],
- "name" : "Vamsi Meenavilli"
+ "name" : "Vamsi Meenavilli",
+ "id" : "Vamsi Meenavilli"
},
{
"name" : "W. Luis Mochan",
+ "id" : "W. Luis Mochan",
"data" : [
[
"Perl",
@@ -449,221 +681,8 @@
"Blog",
1
]
- ],
- "id" : "W. Luis Mochan"
+ ]
}
]
- },
- "title" : {
- "text" : "The Weekly Challenge - 192"
- },
- "xAxis" : {
- "type" : "category"
- },
- "tooltip" : {
- "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>",
- "followPointer" : 1,
- "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>"
- },
- "series" : [
- {
- "colorByPoint" : 1,
- "name" : "The Weekly Challenge - 192",
- "data" : [
- {
- "name" : "Adam Russell",
- "y" : 4,
- "drilldown" : "Adam Russell"
- },
- {
- "drilldown" : "Alexander Pankoff",
- "y" : 5,
- "name" : "Alexander Pankoff"
- },
- {
- "name" : "Ali Moradi",