diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2021-11-01 00:00:12 +0000 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2021-11-01 00:00:12 +0000 |
| commit | 418a5d39c973dd8988e328124e4167db6a36a502 (patch) | |
| tree | 634aa6a4ba8aa6512d7c79f3abf556ebe2329895 | |
| parent | 46237cef5ae7103036e3bca031eea05b53a4e64c (diff) | |
| download | perlweeklychallenge-club-418a5d39c973dd8988e328124e4167db6a36a502.tar.gz perlweeklychallenge-club-418a5d39c973dd8988e328124e4167db6a36a502.tar.bz2 perlweeklychallenge-club-418a5d39c973dd8988e328124e4167db6a36a502.zip | |
- Added solutions by Colin Crain.
| -rw-r--r-- | challenge-136/colin-crain/blog.txt | 1 | ||||
| -rwxr-xr-x | challenge-136/colin-crain/perl/ch-1.pl | 161 | ||||
| -rwxr-xr-x | challenge-136/colin-crain/perl/ch-2.pl | 149 | ||||
| -rwxr-xr-x | challenge-136/colin-crain/raku/ch-1.raku | 39 | ||||
| -rwxr-xr-x | challenge-136/colin-crain/raku/ch-2.raku | 36 | ||||
| -rw-r--r-- | stats/pwc-current.json | 243 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown-summary.json | 68 | ||||
| -rw-r--r-- | stats/pwc-language-breakdown.json | 906 | ||||
| -rw-r--r-- | stats/pwc-leaders.json | 746 | ||||
| -rw-r--r-- | stats/pwc-summary-1-30.json | 120 | ||||
| -rw-r--r-- | stats/pwc-summary-121-150.json | 112 | ||||
| -rw-r--r-- | stats/pwc-summary-151-180.json | 40 | ||||
| -rw-r--r-- | stats/pwc-summary-181-210.json | 46 | ||||
| -rw-r--r-- | stats/pwc-summary-211-240.json | 112 | ||||
| -rw-r--r-- | stats/pwc-summary-241-270.json | 28 | ||||
| -rw-r--r-- | stats/pwc-summary-31-60.json | 106 | ||||
| -rw-r--r-- | stats/pwc-summary-61-90.json | 106 | ||||
| -rw-r--r-- | stats/pwc-summary-91-120.json | 24 | ||||
| -rw-r--r-- | stats/pwc-summary.json | 536 |
19 files changed, 1994 insertions, 1585 deletions
diff --git a/challenge-136/colin-crain/blog.txt b/challenge-136/colin-crain/blog.txt new file mode 100644 index 0000000000..2005739a6a --- /dev/null +++ b/challenge-136/colin-crain/blog.txt @@ -0,0 +1 @@ +https://colincrain.com/2021/10/31/dont-get-too-friendly-its-a-series-of-lies/ diff --git a/challenge-136/colin-crain/perl/ch-1.pl b/challenge-136/colin-crain/perl/ch-1.pl new file mode 100755 index 0000000000..93753cc89e --- /dev/null +++ b/challenge-136/colin-crain/perl/ch-1.pl @@ -0,0 +1,161 @@ +#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# dont-get-too-friendly.pl
+#
+# Two Friendly
+# Submitted by: Mohammad S Anwar
+#
+# You are given 2 positive numbers, $m and $n.
+#
+# Write a script to find out if the given two numbers are Two Friendly.
+#
+# Two positive numbers, m and n are two friendly when gcd(m, n) = 2
+# ^ p where p > 0. The greatest common divisor (gcd) of a set of
+# numbers is the largest positive number that divides all the
+# numbers in the set without remainder.
+#
+# Example 1
+#
+# Input: $m = 8, $n = 24
+# Output: 1
+#
+# Reason: gcd(8,24) = 8 => 2 ^ 3
+#
+# Example 2
+#
+# Input: $m = 26, $n = 39
+# Output: 0
+#
+# Reason: gcd(26,39) = 13
+#
+# Example 3
+#
+# Input: $m = 4, $n = 10
+# Output: 1
+#
+# Reason: gcd(4,10) = 2 => 2 ^ 1
+
+# METHOD:
+
+# Being nice is nice. I strive for it every day — it makes
+# my day better, as seemingly that of those around me, and
+# generally the world is a better place with more kindness
+# in it. In some circumstances, though, niceness may
+# express an inappropriate level of informality to an
+# otherwise serious situation. Telling jokes at a funeral,
+# for instance, or discussing the attractiveness of a Judge
+# at court, are examples of transgressing these unwritten
+# boundaries.
+#
+# Such social cues are commonly referred to as "reading the
+# room". Not all actions, however well meaning, are
+# appropriate in all situations, and the rules governing
+# this behavior are difficult to codify, often relying on
+# non-verbal communication to transmit information on the
+# correct level of informality to act with among a social
+# group at a specific time. This social interaction is
+# learned behavior and subject to change between specific
+# contexts even among the same individuals. Informality
+# leads to more relaxed interactions, with generally
+# positive outcomes, and is hence desirable. Fortunately
+# informality itself generally leads to a softening of the
+# rules for interation, causing the social tensions set up
+# by the rules of formailty to self-dissipate as
+# familiarity rises. We can sidestep the complexity by
+# actually becoming friends, which provides a nice escape.
+#
+# Failure to accurately navigate the mores of interpersonal
+# behavior within a group can lead to social awkwardness
+# when conventional patterns are broken; this is known as a
+# faux pas, or literally, misstep.
+#
+# This is often realized when the subject expresses
+# excessive affection and informality towards either a
+# member of the opposite sex or a heirachical superior,
+# seeming to reference a social or emotional commonality
+# that has not yet formed between the parties.
+#
+# This conduct is likely to form a repulsive
+# counter-reaction from the object party, in an effort to
+# clarify the situation, which, again subject to the rules
+# of acceptible social mores, may be largely unspoken, such
+# as a lack of response ot turning away without engagement.
+# Failure at this point to "read the room" indicates a lack
+# of social awareness that touches the core of the social
+# contract and will near-universally produce a sense of
+# unease in the object of the unwanted informality. This is
+# sometimes even expressed physically, through the
+# activation by the amygdala of the sympathetic nervous
+# system, as a tingling of the skin, or one's hair standing
+# up, often said on the back of the neck. These are real
+# physical manifestations of the fight-or-flight response,
+# brought on by the unpredictabity of the subject's
+# behavior.
+#
+# This behavior, of acting outside the range of
+# predictabilty withing the socal contract, is referred to
+# as "creepy".
+#
+# Being too friendly, before such interactions are socially
+# confirmed, is creepy.
+#
+# Don't be creepy.
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+
+
+sub is_creepy ( $m, $n ) {
+## is $m too friendly towards $n? Does it need to BTFO? Boundaries, people!
+ ( $m, $n ) = ( $n, $m % $n ) while $n > 0; ## gcd
+ $m /= 2 until $m % 2; ## power of 2?
+ return $m == 1 ? 1 : 0;
+}
+
+
+
+## some extra, relevant functions that we don't actually use directly,
+## as their required functionality is inlined in is_creepy()
+sub gcd ( $m, $n ) {
+ ( $m, $n ) = ( $n, $m % $n ) while $n > 0;
+ return $m;
+}
+
+sub power_of_2_div ( $num ) {
+ $num /= 2 until $num % 2;
+ return $num == 1 ? 1 : 0;
+}
+
+sub power_of_2_log ( $num ) {
+ return ((log($n) / log(2)) =~ /\./ ? 0 : 1);
+}
+
+sub power_of_2_popcount ( $num ) {
+ use List::Util qw(sum);
+ sum( split //, sprintf "%b", $num ) == 1 ? 1 : 0;
+}
+
+
+
+
+
+say "\n\n";
+
+use Test::More;
+
+is is_creepy( 8, 24 ), 1, 'ex-1';
+is is_creepy( 26, 39 ), 0, 'ex-2';
+is is_creepy( 4, 10 ), 1, 'ex-3';
+
+is is_creepy( 60, 70 ), 0, 'test-1';
+
+done_testing();
diff --git a/challenge-136/colin-crain/perl/ch-2.pl b/challenge-136/colin-crain/perl/ch-2.pl new file mode 100755 index 0000000000..7a51c41a14 --- /dev/null +++ b/challenge-136/colin-crain/perl/ch-2.pl @@ -0,0 +1,149 @@ +#!/Users/colincrain/perl5/perlbrew/perls/perl-5.32.0/bin/perl
+#
+# a-series-of-lies.pl
+#
+# Fibonacci Sequence
+# Submitted by: Mohammad S Anwar
+# You are given a positive number $n.
+#
+# Write a script to find how many different sequences you can
+# create using Fibonacci numbers where the sum of unique numbers in
+# each sequence are the same as the given number.
+#
+# Fibonacci Numbers: 1,2,3,5,8,13,21,34,55,89, …
+#
+# Example 1
+# Input: $n = 16
+# Output: 4
+#
+# Reason: There are 2 possible sequences that can be created
+# using Fibonacci numbers
+# (3 + 13), (1 + 2 + 13),
+# (3 + 5 + 8) and (1 + 2 + 5 + 8)
+#
+# Example 2
+# Input: $n = 9
+# Output: 2
+#
+# Reason: There are 2 possible sequences that can be created
+# using Fibonacci numbers
+# (1 + 3 + 5) and (1 + 8)
+#
+# Example 3
+# Input: $n = 15
+# Output: 2
+#
+# Reason: There are 2 possible sequences that can be created
+# using Fibonacci numbers
+# (2 + 5 + 8) and (2 + 13)
+
+# METHOD:
+
+# This is a very interesting challenge because individual Fibonacci numbers
+# can themselves be decomposed into a sequence of the previous two values,
+# which can further decomposed.
+#
+# The caveat to this recursive construction is the criterium that the
+# elements of the sequence be unique.
+#
+# Consider the number 34. This is itself a Fibonacci number so I see no reason
+# not to assign it a sequence of one value, itself: (34)
+#
+# This value, 34, can be decomposed into the two previous values, according to
+# the recursive relation that defines the sequence:
+#
+# F(n) = F(n-1) + F(n-2)
+#
+# Thus we add the sequence (13, 21).
+#
+# Now 21 cannot be immediately broken down because of a conflict with 13, so we will
+# start with that position:
+#
+# (5, 8, 21)
+#
+# can be added, and the 5 can be broken down as well:
+#
+# (2, 3, 8, 21)
+#
+# now the 8 cannot be broken down into (5, 3), nor the 21 into (8, 13) so we are done:
+#
+# (34)
+# (5, 8, 21)
+# (2, 3, 8, 21)
+
+# Well that's a mess, if I say so. I can see performing this
+# process through a sequence of recursive steps on a given
+# kernal solution, but how can we be sure that we have found
+# all solutions? How do we find our initial top-level solution,
+# and may there also, with larger numbers, be multiple
+# top-level solutions that each can be independantly
+# deconstructed into their own solution sets?
+#
+# I think further study is necessary, and to to that we need a
+# more expansive base of targets and solutions to examine to
+# infer patterns. So we need a solver to perfect our solver,
+# which is problematic to say the least.
+#
+# Obviously we will need another approach.
+#
+# Another way to find solutions is to consider a list of all
+# unique Fibinacci numbers less less than or equal to the
+# target and try all combinations, keeping those that sum
+# correctly.
+#
+# It's a computationally-intensive way to go about things: for
+# a complete set of combinations from an input set, where each
+# element is either present or not, we double the solution
+# count for each new element, producting 2^n combinations for n
+# elements. It does, however, get the job done.
+#
+# I do feel number theory may reveal a procedure for easily producing
+# top-level solution kernals that can be further reduced. I dare
+# say that logic is not obvious, though. I think for today we'll have to leave things there.
+
+
+
+#
+# © 2021 colin crain
+## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ##
+
+
+
+use warnings;
+use strict;
+use utf8;
+use feature ":5.26";
+use feature qw(signatures);
+no warnings 'experimental::signatures';
+use List::Util qw(sum zip);
+
+my $target = shift @ARGV || 1234;
+
+my @fibs = (1,1);
+my @sols;
+
+sub generate_unique_fibs ( $limit ) {
+## generates sequence of Fibonacci numbers up to and not greater than limit
+
+ push @fibs, $fibs[-1]+$fibs[-2] while $fibs[-1]+$fibs[-2] <= $limit;
+ shift @fibs; ## remove duplicate 1 at start
+}
+
+generate_unique_fibs( $target );
+my $len = scalar @fibs;
+
+say "input: ", $target, "\n";
+say "found $len Fibonacci numbers less than $target";
+say "there are ", 2 ** $len - 1, " combinations to be examined";
+say "calculating...\n";
+
+for my $num (1 .. 2 ** $len - 1) {
+ my @bits = split //, sprintf "%0${len}b", $num;
+ my @candidate = map { $_->[0] * $_->[1] } zip( \@fibs, \@bits);
+ push @sols, [ grep { $_ } @candidate ] if sum( @candidate ) == $target;
+}
+
+say "found ", scalar @sols, " solutions:";
+local $" = ' + ';
+say "( $_->@* )" for @sols;
+
diff --git a/challenge-136/colin-crain/raku/ch-1.raku b/challenge-136/colin-crain/raku/ch-1.raku new file mode 100755 index 0000000000..6dfcdf9e1f --- /dev/null +++ b/challenge-136/colin-crain/raku/ch-1.raku @@ -0,0 +1,39 @@ +#!/Applications/Rakudo/bin/raku +# +# +# dont-get-too-friendly.raku +# +# +# +# © 2021 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +unit sub MAIN () ; + +use Test; + +is is_creepy( 8, 24 ), 1, 'ex-1'; +is is_creepy( 26, 39 ), 0, 'ex-2'; +is is_creepy( 4, 10 ), 1, 'ex-3'; + +is is_creepy( 60, 70 ), 0, 't-1'; + + + +sub is_creepy ( $m is copy, $n is copy ) { +## is $m too friendly towards $n? Does it need to BTFO? Boundaries, people! + my $g = $m gcd $n; + $g /= 2 while $g %% 2; + $g > 1 ?? 0 + !! 1; +} + + + + + + +say "\n\n"; + diff --git a/challenge-136/colin-crain/raku/ch-2.raku b/challenge-136/colin-crain/raku/ch-2.raku new file mode 100755 index 0000000000..f3a5c6330f --- /dev/null +++ b/challenge-136/colin-crain/raku/ch-2.raku @@ -0,0 +1,36 @@ +#!/Applications/Rakudo/bin/raku +# +# +# a-series-of-lies.raku +# +# +# +# © 2021 colin crain +## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## ## + + + +unit sub MAIN ( $target = 30034 ) ; + +## generate list of Fib numbers from second index up to but not including the index +## of the first value exceeding the target +my @fibs = (1, 1, * + * ... *); +my @unique_fibs = @fibs[1..^@fibs.first(* > $target, :k)]; + +say qq:to/END/; + found {@unique_fibs.elems} Fibonacci numbers less than $target + there are { 2 ** @unique_fibs.elems - 1 } comnbinations to be processed + calculating... + END + +## compute all combinations for all lengths +my @out; +for (@unique_fibs.combinations($_) for 1..@unique_fibs.elems) { + for $_ -> $c { + push @out, $c.join( ' + ') if $c.sum == $target; + } +} + +say "found {@out.elems} solutions"; +.say for @out; + diff --git a/stats/pwc-current.json b/stats/pwc-current.json index c07cde8810..3b913bff06 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,12 +1,28 @@ { "subtitle" : { - "text" : "[Champions: 27] Last updated at 2021-10-31 23:50:18 GMT" + "text" : "[Champions: 28] Last updated at 2021-10-31 23:58:53 GMT" }, - "chart" : { - "type" : "column" + "xAxis" : { + "type" : "category" }, - "legend" : { - "enabled" : 0 + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "plotOptions" : { + "series" : { + "borderWidth" : 0, + "dataLabels" : { + "enabled" : 1, + "format" : "{point.y}" + } + } + }, + "tooltip" : { + "followPointer" : 1, + "headerFormat" : "<span style='font-size:11px'>{series.name}</span><br/>", + "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>" }, "drilldown" : { "series" : [ @@ -26,7 +42,6 @@ }, { "id" : "Adam Russell", - "name" : "Adam Russell", "data" : [ [ "Perl", @@ -36,11 +51,12 @@ "Blog", 2 ] - ] + ], + "name" : "Adam Russell" }, { - "id" : "Arne Sommer", "name" : "Arne Sommer", + "id" : "Arne Sommer", "data" : [ [ "Perl", @@ -95,6 +111,25 @@ "id" : "Cheok-Yin Fung" }, { + "name" : "Colin Crain", + "id" : "Colin Crain", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ], + [ + "Blog", + 1 + ] + ] + }, + { + "name" : "Dave Jacoby", "data" : [ [ "Perl", @@ -105,28 +140,27 @@ 1 ] ], - "name" : "Dave Jacoby", "id" : "Dave Jacoby" }, { "name" : "Duncan C. White", + "id" : "Duncan C. White", "data" : [ [ "Perl", 2 ] - ], - "id" : "Duncan C. White" + ] }, { - "id" : "E. Choroba", - "name" : "E. Choroba", "data" : [ [ "Perl", 2 ] - ] + ], + "id" : "E. Choroba", + "name" : "E. Choroba" }, { "id" : "Flavio Poletti", @@ -147,7 +181,7 @@ "name" : "Flavio Poletti" }, { - "id" : "James Smith", + "name" : "James Smith", "data" : [ [ "Perl", @@ -158,7 +192,7 @@ 1 ] ], - "name" : "James Smith" + "id" : "James Smith" }, { "data" : [ @@ -167,18 +201,18 @@ 2 ] ], - "name" : "Jan Krnavek", - "id" : "Jan Krnavek" + "id" : "Jan Krnavek", + "name" : "Jan Krnavek" }, { - "id" : "Jorg Sommrey", + "name" : "Jorg Sommrey", "data" : [ [ "Perl", 2 ] ], - "name" : "Jorg Sommrey" + "id" : "Jorg Sommrey" }, { "data" : [ @@ -195,8 +229,8 @@ 1 ] ], - "name" : "Laurent Rosenfeld", - "id" : "Laurent Rosenfeld" + "id" : "Laurent Rosenfeld", + "name" : "Laurent Rosenfeld" }, { "name" : "Luca Ferrari", @@ -213,26 +247,27 @@ "id" : "Luca Ferrari" }, { - "name" : "Mark Anderson", "data" : [ [ "Raku", 2 ] ], - "id" : "Mark Anderson" + "id" : "Mark Anderson", + "name" : "Mark Anderson" }, { - "id" : "Matthew Neleigh", "data" : [ [ "Perl", 1 ] ], + "id" : "Matthew Neleigh", "name" : "Matthew Neleigh" }, { + "id" : "Mohammad S Anwar", "data" : [ [ "Perl", @@ -243,40 +278,41 @@ 1 ] ], - "name" : "Mohammad S Anwar", - "id" : "Mohammad S Anwar" + "name" : "Mohammad S Anwar" }, { "id" : "Niels van Dijke", - "name" : "Niels van Dijke", "data" : [ [ "Perl", 2 ] - ] + ], + "name" : "Niels van Dijke" }, { + "id" : "Paulo Custodio", "data" : [ [ "Perl", 2 ] ], - "name" : "Paulo Custodio", - "id" : "Paulo Custodio" + "name" : "Paulo Custodio" }, { + "name" : "Pete Houston", + "id" : "Pete Houston", "data" : [ [ "Perl", 2 ] - ], - "name" : "Pete Houston", - "id" : "Pete Houston" + ] }, { + "name" : "Roger Bell_West", + "id" : "Roger Bell_West", "data" : [ [ "Perl", @@ -290,13 +326,10 @@ "Blog", 1 ] - ], - "name" : "Roger Bell_West", - "id" : "Roger Bell_West" + ] }, { "id" : "Simon Green", - "name" : "Simon Green", "data" : [ [ "Perl", @@ -306,20 +339,21 @@ "Blog", 1 ] - ] + ], + "name" : "Simon Green" }, { + "id" : "Simon Proctor", "data" : [ [ "Raku", 2 ] ], - "name" : "Simon Proctor", - "id" : "Simon Proctor" + "name" : "Simon Proctor" }, { - "name" : "Ulrich Rieke", + "id" : "Ulrich Rieke", "data" : [ [ "Perl", @@ -330,10 +364,9 @@ 2 ] ], - "id" : "Ulrich Rieke" + "name" : "Ulrich Rieke" }, { - "id" : "W. Luis Mochan", "name" : "W. Luis Mochan", "data" : [ [ @@ -344,16 +377,17 @@ "Blog", 1 ] - ] + ], + "id" : "W. Luis Mochan" }, { - "id" : "Wanderdoc", "data" : [ [ "Perl", 1 ] ], + "id" : "Wanderdoc", "name" : "Wanderdoc" } ] @@ -361,77 +395,63 @@ "title" : { "text" : "The Weekly Challenge - 136" }, - "xAxis" : { - "type" : "category" - }, - "yAxis" : { - "title" : { - "text" : "Total Solutions" - } - }, - "plotOptions" : { - "series" : { - "dataLabels" : { - "enabled" : 1, - "format" : "{point.y}" - }, - "borderWidth" : 0 - } - }, "series" : [ { - "colorByPoint" : 1, - "name" : "The Weekly Challenge - 136", "data" : [ { - "drilldown" : "Abigail", "name" : "Abigail", - "y" : 4 + "y" : 4, + "drilldown" : "Abigail" }, { + "drilldown" : "Adam Russell", "y" : 4, - "name" : "Adam Russell", - "drilldown" : "Adam Russell" + "name" : "Adam Russell" }, { "drilldown" : "Arne Sommer", - "y" : 5, - "name" : "Arne Sommer" + "name" : "Arne Sommer", + "y" : 5 }, { "drilldown" : "Athanasius", - "name" : "Athanasius", - "y" : 4 + "y" : 4, + "name" : "Athanasius" }, { - "drilldown" : "Bruce Gray", + "name" : "Bruce Gray", "y" : 4, - "name" : "Bruce Gray" + "drilldown" : "Bruce Gray" }, { - "name" : "Cheok-Yin Fung", + "drilldown" : "Cheok-Yin Fung", "y" : 1, - "drilldown" : "Cheok-Yin Fung" + "name" : "Cheok-Yin Fung" + }, + { + "drilldown" : "Colin Crain", + "y" : 5, + "name" : "Colin Crain" }, { - "name" : "Dave Jacoby", + "drilldown" : "Dave Jacoby", "y" : 3, - "drilldown" : "Dave Jacoby" + "name" : "Dave Jacoby" }, { - "drilldown" : "Duncan C. White", + "y" : 2, "name" : "Duncan C. White", - "y" : 2 + "drilldown" : "Duncan C. White" }, { + "drilldown" : "E. Choroba", "name" : "E. Choroba", - "y" : 2, - "drilldown" : "E. Choroba" + "y" : 2 }, { + "drilldown" : "Flavio Poletti", "y" : 6, - "name" : "Flavio Poletti", - "drilldown" : "Flavio Poletti" + "name" : "Flavio Poletti" }, { "y" : 3, @@ -440,17 +460,17 @@ }, { "drilldown" : "Jan Krnavek", - "y" : 2, - "name" : "Jan Krnavek" + "name" : "Jan Krnavek", + "y" : 2 }, { - "name" : "Jorg Sommrey", + "drilldown" : "Jorg Sommrey", "y" : 2, - "drilldown" : "Jorg Sommrey" + "name" : "Jorg Sommrey" }, { - "name" : "Laurent Rosenfeld", "y" : 5, + "name" : "Laurent Rosenfeld", "drilldown" : "Laurent Rosenfeld" }, { @@ -459,14 +479,14 @@ "drilldown" : "Luca Ferrari" }, { - "name" : "Mark Anderson", + "drilldown" : "Mark Anderson", "y" : 2, - "drilldown" : "Mark Anderson" + "name" : "Mark Anderson" }, { - "drilldown" : "Matthew Neleigh", "y" : 1, - "name" : "Matthew Neleigh" + "name" : "Matthew Neleigh", + "drilldown" : "Matthew Neleigh" }, { "drilldown" : "Mohammad S Anwar", @@ -480,18 +500,18 @@ }, { "drilldown" : "Paulo Custodio", - "y" : 2, - "name" : "Paulo Custodio" + "name" : "Paulo Custodio", + "y" : 2 }, { - "drilldown" : "Pete Houston", + "name" : "Pete Houston", "y" : 2, - "name" : "Pete Houston" + "drilldown" : "Pete Houston" }, { "drilldown" : "Roger Bell_West", - "name" : "Roger Bell_West", - "y" : 5 + "y" : 5, + "name" : "Roger Bell_West" }, { "name" : "Simon Green", @@ -499,31 +519,34 @@ "drilldown" : "Simon Green" }, { - "drilldown" : "Simon Proctor", "name" : "Simon Proctor", - "y" : 2 + "y" : 2, + "drilldown" : "Simon Proctor" }, { - "y" : 4, "name" : "Ulrich Rieke", + "y" : 4, "drilldown" : "Ulrich Rieke" }, { "drilldown" : "W. Luis Mochan", - "name" : "W. Luis Mochan", - "y" : 3 + "y" : 3, + "name" : "W. Luis Mochan" }, { "name" : "Wanderdoc", "y" : 1, "drilldown" : "Wanderdoc" } - ] + ], + "colorByPoint" : 1, + "name" : "The Weekly Challenge - 136" } ], - "tooltip" : { - "followPointer" : 1, - "pointFormat" : "<span style='color:{point.color}'>{point.name}</span>: <b>{point.y:f}</b><br/>", - "headerFormat" : "&l |