diff options
| author | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2022-02-02 17:40:31 +0000 |
|---|---|---|
| committer | Mohammad S Anwar <mohammad.anwar@yahoo.com> | 2022-02-02 17:40:31 +0000 |
| commit | 6fd6b4eaedb3b19ae8d913ba078c9d69f48227dd (patch) | |
| tree | fcab8c2d1554b9bba3ed5c0a029e106e698dcbd6 | |
| parent | ea530bc5cf89e42ab0175eec72b2ebccfa3fdad4 (diff) | |
| download | perlweeklychallenge-club-6fd6b4eaedb3b19ae8d913ba078c9d69f48227dd.tar.gz perlweeklychallenge-club-6fd6b4eaedb3b19ae8d913ba078c9d69f48227dd.tar.bz2 perlweeklychallenge-club-6fd6b4eaedb3b19ae8d913ba078c9d69f48227dd.zip | |
- Added solutions by Ulrich Rieke.
22 files changed, 2439 insertions, 2110 deletions
diff --git a/challenge-150/ulrich-rieke/cpp/ch-1.cpp b/challenge-150/ulrich-rieke/cpp/ch-1.cpp new file mode 100644 index 0000000000..e2cb519390 --- /dev/null +++ b/challenge-150/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,23 @@ +#include <iostream> +#include <vector> +#include <string> + +int main( ) { + std::string firstnum ; + std::string secondnum ; + std::cout << "Enter a number string consisting of digits only!\n" ; + std::cin >> firstnum ; + std::cout << "Enter a second number string consisting of digits only!\n" ; + std::cin >> secondnum ; + while ( secondnum.length( ) != firstnum.length( ) ) { + std::cout << "second number string should be as long as the first one!\n" ; + std::cin >> secondnum ; + } + std::vector<std::string> fibonacciWords { firstnum , secondnum } ; + while ( fibonacciWords.back( ).length( ) < 51 ) { + fibonacciWords.push_back( fibonacciWords[ fibonacciWords.size( ) - 2 ] + + fibonacciWords.back( ) ) ; + } + std::cout << fibonacciWords.back( ).substr( 50 , 1 ) << std::endl ; + return 0 ; +} diff --git a/challenge-150/ulrich-rieke/cpp/ch-2.cpp b/challenge-150/ulrich-rieke/cpp/ch-2.cpp new file mode 100644 index 0000000000..db49e43808 --- /dev/null +++ b/challenge-150/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,76 @@ +#include <iostream> +#include <vector> +#include <set> +#include <cmath> + +bool isPrime( int i ) { + if ( i == 1 ) + return false ; + else { + int stop = std::sqrt( static_cast<double>( i ) ) ; + for ( int d = 2 ; d <= stop ; d++ ) + if ( i % d == 0 ) + return false ; + return true ; + } +} + +std::vector<int> findDivisors( int n ) { + std::vector<int> divisors ; + for ( int i = 1 ; i < n + 1 ; i++ ) { + if ( n % 1 == 0 ) + divisors.push_back( i ) ; + } + return divisors ; +} + +std::vector<int> primeFactorialize( int n ) { + std::vector<int> primeDecomposition ; + std::vector<int> divisors = findDivisors( n ) ; + std::vector<int> primeFactors ; + for ( int i : divisors ) { + if ( isPrime( i ) ) + primeFactors.push_back( i ) ; + } + int num = 0 ; + while ( n != 1 ) { + int nextFactor = primeFactors[ num ] ; + while ( n % nextFactor == 0 ) { + primeDecomposition.push_back( nextFactor ) ; + n /= nextFactor ; + } + if ( num + 1 < primeFactors.size( ) ) + num++ ; + } + return primeDecomposition ; +} + +bool isSquareFree( int n ) { + if ( n == 1 ) { + return true ; + } + else { + std::vector<int> primeFactors = primeFactorialize( n ) ; + std::set<int> numset( primeFactors.begin( ) , primeFactors.end( ) ) ; + return primeFactors.size( ) == numset.size( ) ; + } +} + +int main( ) { + std::vector<int> squareFrees ; + int current = 1 ; + while ( current < 501 ) { + if ( isSquareFree( current ) ) + squareFrees.push_back( current ) ; + current++ ; + } + int count = 1 ; + for ( int i : squareFrees ) { + std::cout << i << " " ; + count++ ; + if ( count % 15 == 0 )//improves the output slightly + std::cout << std::endl ; + } + std::cout << std::endl ; + return 0 ; +} diff --git a/challenge-150/ulrich-rieke/haskell/ch-1.hs b/challenge-150/ulrich-rieke/haskell/ch-1.hs new file mode 100644 index 0000000000..184f92c5e5 --- /dev/null +++ b/challenge-150/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,7 @@ +module Challenge150 + where + +--no lengthy input validation, I assume the 2 strings to be of the right shape +solution :: String -> String -> Char +solution firstNum secondNum = head $ drop 50 $ snd $ until( (>= 51 ) . length . snd ) +(\p -> (snd p , fst p ++ snd p )) ( firstNum, secondNum ) diff --git a/challenge-150/ulrich-rieke/haskell/ch-2.hs b/challenge-150/ulrich-rieke/haskell/ch-2.hs new file mode 100644 index 0000000000..dd02702728 --- /dev/null +++ b/challenge-150/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,30 @@ +module Challenge150_2 + where +import Control.Monad.State.Lazy +import Data.List ( nub ) + +divisors :: Int -> [Int] +divisors n = [p | p <- [2 .. n] , mod n p == 0] + +decompose :: State (Int , [Int]) [Int] +decompose = do + (d , factors ) <- get + if d == 1 + then return factors + else do + put ( div d ( head $ divisors d ) , factors ++ [ head $ divisors d]) + decompose + +myFactors :: Int -> [Int] +myFactors n = evalState decompose ( n , [] ) + +isSquareFree :: Int -> Bool +isSquareFree num + |num == 1 = True + |otherwise = length list == ( length $ nub list ) + where + list :: [Int] + list = myFactors num + +solution :: [Int] +solution = filter isSquareFree [1 .. 500] diff --git a/challenge-150/ulrich-rieke/perl/ch-1.pl b/challenge-150/ulrich-rieke/perl/ch-1.pl new file mode 100644 index 0000000000..4681d638c6 --- /dev/null +++ b/challenge-150/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,33 @@ +#!/usr/bin/perl ; +use strict ; +use warnings ; +use feature 'say' ; + +say "Enter a number string!" ; +my $A = <STDIN> ; +chomp $A ; +while ( $A !~ /\A\d+\z/ ) { + say "the string should consist of digits only!" ; + $A = <STDIN> ; + chomp $A ; +} +say "Enter a second number string!" ; +my $B = <STDIN> ; +chomp $B ; +while ( $B !~ /\A\d+\z/ ) { + say "the string should consist of digits only!" ; + $B = <STDIN> ; + chomp $B ; +} +while ( length $B != length $A || $B !~ /\A\d+\z/ ) { + say ("second number string should be " . length( $A ) . + " characters long!") ; + say "digits only!" ; + $B = <STDIN> ; + chomp $B ; +} +my @fibonacciWords = ($A , $B) ; +while ( length($fibonacciWords[-1]) < 51 ) { + push @fibonacciWords , $fibonacciWords[-2] . $fibonacciWords[-1] ; +} +say substr( $fibonacciWords[-1] , 50 , 1 ) ; diff --git a/challenge-150/ulrich-rieke/perl/ch-2.pl b/challenge-150/ulrich-rieke/perl/ch-2.pl new file mode 100644 index 0000000000..356330a4ae --- /dev/null +++ b/challenge-150/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,74 @@ +#!/usr/bin/perl ; +use strict ; +use warnings ; +use feature 'say' ; +use POSIX ; + +sub isPrime { + my $number = shift ; + if ( $number == 1 ) { + return 0 ; + } + elsif ( $number == 2 ) { + return 1 ; + } + else { + my $root = sqrt( $number ) ; + my $limit = floor( $root ) ; + for my $i (2 .. $limit) { + if ( $number % $i == 0 ) { + return 0 ; + } + } + return 1 ; + } +} + +sub primeFactorialize { + my $number = shift ; + my @possibleFactors ; + my @factors ; + if ( $number == 1 ) { + push @factors , 1 ; + } + else { + if ( isPrime( $number ) ) { + push @factors, 1 , $number ; + } + else { + @possibleFactors = grep { isPrime( $_ ) } (2 .. + int( $number / 2 )) ; #pick all prime numbers from list of divisors + push @factors, 1 ; + while ( $number != 1 ) { + my $nextFactor = shift @possibleFactors ; + while ( $number % $nextFactor == 0 ) {#keep checking all prime factors + push @factors, $nextFactor ; #more than once + $number /= $nextFactor ; + } + } + } + } + return @factors ; +} + +sub isSquareFree { + my $number = shift ; + my @primeFactors = primeFactorialize( $number ) ; + my %factors ; + for my $i ( @primeFactors ) { + $factors{ $i }++ ; + } +#if it is square free the number of different prime factors should be equal to +#the number of prime factors + return scalar( keys %factors ) == scalar( @primeFactors ) ; +} + +my @square_frees ; +my $current = 1 ; +while ( $current < 501 ) { + if ( isSquareFree( $current ) ) { + push @square_frees, $current ; + } + $current++ ; +} +say join( ',' , @square_frees ) ; diff --git a/challenge-150/ulrich-rieke/raku/ch-1.raku b/challenge-150/ulrich-rieke/raku/ch-1.raku new file mode 100644 index 0000000000..58818e22a4 --- /dev/null +++ b/challenge-150/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,25 @@ +use v6 ; + +say "Enter a first number string!" ; +my $a = $*IN.get ; +while ( $a !~~ /^\d+$/ ) { + say "The string should only consist of numbers!" ; + $a = $*IN.get ; +} +say "Enter a second number string!" ; +my $b = $*IN.get ; +while ( $b !~~ /^\d+$/ ) { + say "The string should only consist of numbers!" ; + $b = $*IN.get ; +} +while ( $b.chars != $a.chars || $b !~~ /^\d+$/ ) { + say "second number string should be {$a.chars} characters long!" ; + say "digits only!" ; + $b = $*IN.get ; +} +my @fibowords ; +@fibowords.push( $a , $b ) ; +while ( @fibowords[*-1].chars < 51 ) { + @fibowords.push( @fibowords[*-2] ~ @fibowords[*-1] ) ; +} +say @fibowords[*-1].substr( 50 , 1 ) ; diff --git a/challenge-150/ulrich-rieke/raku/ch-2.raku b/challenge-150/ulrich-rieke/raku/ch-2.raku new file mode 100644 index 0000000000..b58fa06bd0 --- /dev/null +++ b/challenge-150/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,42 @@ +use v6 ; + +sub primeFactorization( Int $n is copy ) { + my @possibleFactors ; + my @factors ; + if ( $n == 1 ) { + @factors.push( 1 ) ; + } + else { + if ( $n.is-prime ) { + @factors.push( 1 , $n ) ; + } + else { + @possibleFactors = (2 .. $n div 2).grep( {.is-prime} ) ; + @factors.push( 1 ) ; + while ( $n != 1 ) { + my $nextFactor = @possibleFactors.shift ; + while ( $n %% $nextFactor ) { + @factors.push( $nextFactor ) ; + $n div= $nextFactor ; + } + } + } + } + return @factors ; +} + +sub isSquareFree( Int $n is copy --> Bool ) { + my @primeFactors = primeFactorization( $n ) ; + my $primeSet = @primeFactors.Set ; + return $primeSet.elems == @primeFactors.elems ; +} + +my @square-frees ; +my $current = 1 ; +while ( $current < 501 ) { + if ( isSquareFree( $current ) ) { + @square-frees.push( $current ) ; + } + $current++ ; +} +say join( ',' , @square-frees ) ; diff --git a/stats/pwc-current.json b/stats/pwc-current.json index db789d92d0..e5b44280c1 100644 --- a/stats/pwc-current.json +++ b/stats/pwc-current.json @@ -1,19 +1,6 @@ { - "title" : { - "text" : "The Weekly Challenge - 150" - }, - "subtitle" : { - "text" : "[Champions: 13] Last updated at 2022-02-02 17:14:00 GMT" - }, - "chart" : { - "type" : "column" - }, - "legend" : { - "enabled" : 0 - }, "series" : [ { - "name" : "The Weekly Challenge - 150", "data" : [ { "name" : "Abigail", @@ -22,13 +9,13 @@ }, { "y" : 1, - "drilldown" : "Andrew Shitov", - "name" : "Andrew Shitov" + "name" : "Andrew Shitov", + "drilldown" : "Andrew Shitov" }, { "drilldown" : "Cheok-Yin Fung", - "y" : 1, - "name" : "Cheok-Yin Fung" + "name" : "Cheok-Yin Fung", + "y" : 1 }, { "drilldown" : "E. Choroba", @@ -36,29 +23,29 @@ "name" : "E. Choroba" }, { + "name" : "James Smith", "y" : 3, - "drilldown" : "James Smith", - "name" : "James Smith" + "drilldown" : "James Smith" }, { - "y" : 4, "drilldown" : "Luca Ferrari", + "y" : 4, "name" : "Luca Ferrari" }, { "drilldown" : "Mark Anderson", - "y" : 2, - "name" : "Mark Anderson" + "name" : "Mark Anderson", + "y" : 2 }, { - "name" : "Marton Polgar", + "drilldown" : "Marton Polgar", "y" : 2, - "drilldown" : "Marton Polgar" + "name" : "Marton Polgar" }, { - "drilldown" : "Peter Campbell Smith", + "name" : "Peter Campbell Smith", "y" : 3, - "name" : "Peter Campbell Smith" + "drilldown" : "Peter Campbell Smith" }, { "drilldown" : "Robert DiCicco", @@ -66,50 +53,42 @@ "name" : "Robert DiCicco" }, { - "name" : "Robert Ransbottom", "y" : 2, + "name" : "Robert Ransbottom", "drilldown" : "Robert Ransbottom" }, { - "drilldown" : "Roger Bell_West", + "name" : "Roger Bell_West", + "y" : 4, + "drilldown" : "Roger Bell_West" + }, + { "y" : 4, - "name" : "Roger Bell_West" + "name" : "Ulrich Rieke", + "drilldown" : "Ulrich Rieke" }, { - "drilldown" : "W. Luis Mochan", "y" : 3, - "name" : "W. Luis Mochan" + "name" : "W. Luis Mochan", + "drilldown" : "W. Luis Mochan" } ], + "name" : "The Weekly Challenge - 150", "colorByPoint" : 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 - }, "plotOptions" : { "series" : { "dataLabels" : { - "format" : "{point.y}", - "enabled" : 1 + "enabled" : 1, + "format" : "{point.y}" }, "borderWidth" : 0 } }, - "xAxis" : { - "type" : "category" - }, - "yAxis" : { - "title" : { - "text" : "Total Solutions" - } - }, "drilldown" : { "series" : [ { - "id" : "Abigail", "data" : [ [ "Perl", @@ -120,41 +99,42 @@ 2 ] ], - "name" : "Abigail" + "name" : "Abigail", + "id" : "Abigail" }, { + "id" : "Andrew Shitov", "data" : [ [ "Raku", 1 ] ], - "id" : "Andrew Shitov", "name" : "Andrew Shitov" }, { + "name" : "Cheok-Yin Fung", "data" : [ [ "Perl", 1 ] ], - "id" : "Cheok-Yin Fung", - "name" : "Cheok-Yin Fung" + "id" : "Cheok-Yin Fung" }, { "id" : "E. Choroba", + "name" : "E. Choroba", "data" : [ [ "Perl", 2 ] - ], - "name" : "E. Choroba" + ] }, { - "name" : "James Smith", "id" : "James Smith", + "name" : "James Smith", "data" : [ [ "Perl", @@ -167,6 +147,7 @@ ] }, { + "id" : "Luca Ferrari", "data" : [ [ "Raku", @@ -177,32 +158,31 @@ 2 ] ], - "id" : "Luca Ferrari", "name" : "Luca Ferrari" }, { - "id" : "Mark Anderson", "data" : [ [ "Raku", 2 ] ], - "name" : "Mark Anderson" + "name" : "Mark Anderson", + "id" : "Mark Anderson" }, { - "id" : "Marton Polgar", + "name" : "Marton Polgar", "data" : [ [ "Raku", 2 ] ], - "name" : "Marton Polgar" + "id" : "Marton Polgar" }, { - "name" : "Peter Campbell Smith", "id" : "Peter Campbell Smith", + "name" : "Peter Campbell Smith", "data" : [ [ "Perl", @@ -215,8 +195,8 @@ ] }, { - "name" : "Robert DiCicco", "id" : "Robert DiCicco", + "name" : "Robert DiCicco", "data" : [ [ "Perl", @@ -229,14 +209,14 @@ ] }, { - "name" : "Robert Ransbottom", "id" : "Robert Ransbottom", "data" : [ [ "Raku", 2 ] - ] + ], + "name" : "Robert Ransbottom" }, { "id" : "Roger Bell_West", @@ -253,6 +233,20 @@ "name" : "Roger Bell_West" }, { + "id" : "Ulrich Rieke", + "data" : [ + [ + "Perl", + 2 + ], + [ + "Raku", + 2 + ] + ], + "name" : "Ulrich Rieke" + }, + { "id" : "W. Luis Mochan", "data" : [ [ @@ -267,5 +261,30 @@ "name" : "W. Luis Mochan" } ] + }, + "chart" : { + "type" : "column" + }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "title" : { + "text" : "The Weekly Challenge - 150" + }, + "subtitle" : { + "text" : "[Champions: 14] Last updated at 2022-02-02 17:35:12 GMT" + }, + "legend" : { + "enabled" : 0 + }, + "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/>" + }, + "xAxis" : { + "type" : "category" } } diff --git a/stats/pwc-language-breakdown-summary.json b/stats/pwc-language-breakdown-summary.json index 266128b700..cdda79a08a 100644 --- a/stats/pwc-language-breakdown-summary.json +++ b/stats/pwc-language-breakdown-summary.json @@ -1,24 +1,19 @@ { - "xAxis" : { - "type" : "category", - "labels" : { - "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" - } - } - }, - "yAxis" : { - "min" : 0, - "title" : { - "text" : null - } - }, - "tooltip" : { - "pointFormat" : "<b>{point.y:.0f}</b>" - }, "series" : [ { + "dataLabels" : { + "align" : "right", + "rotation" : -90, + "color" : "#FFFFFF", + "style" : { + "fontFamily" : "Verdana, sans-serif", + "fontSize" : "13px" + }, + "enabled" : "true", + "y" : 10, + "format" : "{point.y:.0f}" + }, + "name" : "Contributions", "data" : [ [ "Blog", @@ -26,38 +21,43 @@ ], [ "Perl", - 7211 + 7213 ], [ "Raku", - 4339 + 4341 ] - ], - "dataLabels" : { - "color" : "#FFFFFF", - "format" : "{point.y:.0f}", - "rotation" : -90, - "align" : "right", - "enabled" : "true", - "y" : 10, - "style" : { - "fontFamily" : "Verdana, sans-serif", - "fontSize" : "13px" - } - }, - "name" : "Contributions" + ] } ], - "legend" : { - "enabled" : "false" + "title" : { + "text" : "The Weekly Challenge Contributions [2019 - 2021]" + }, + "subtitle" : { + "text" : "Last updated at 2022-02-02 17:35:12 GMT" + }, + "yAxis" : { + "title" : { + "text" : null + }, + "min" : 0 }, "chart" : { "type" : "column" }, - "subtitle" : { - "text" : "Last updated at 2022-02-02 17:14:00 GMT" + "xAxis" : { + "type" : "category", + "labels" : { + "style" : { + "fontSize" : "13px", + "fontFamily" : "Verdana, sans-serif" + } + } }, - "title" : { - "text" : "The Weekly Challenge Contributions [2019 - 2021]" + "tooltip" : { + "pointFormat" : "<b>{point.y:.0f}</b>" + }, + "legend" : { + "enabled" : "false" } } diff --git a/stats/pwc-language-breakdown.json b/stats/pwc-language-breakdown.json index 9c04c8fab3..7071156550 100644 --- a/stats/pwc-language-breakdown.json +++ b/stats/pwc-language-breakdown.json @@ -1,8 +1,799 @@ { + "legend" : { + "enabled" : "false" + }, + "tooltip" : { + "headerFormat" : "<span style=\"font-size:11px\"></span>", + "followPointer" : "true", + "pointFormat" : "<span style=\"color:{point.color}\">Challenge {point.name}</span>: <b>{point.y:f}</b><br/>" + }, + "xAxis" : { + "type" : "category" + }, + "chart" : { + "type" : "column" + }, + "yAxis" : { + "title" : { + "text" : "Total Solutions" + } + }, + "subtitle" : { + "text" : "Click the columns to drilldown the language breakdown. Last updated at 2022-02-02 17:35:12 GMT" + }, + "title" : { + "text" : "The Weekly Challenge Language" + }, + "series" : [ + { + "name" : "The Weekly Challenge Languages", + "data" : [ + { + "y" : 161, + "name" : "#001", + "drilldown" : "001" + }, + { + "name" : "#002", + "y" : 125, + "drilldown" : "002" + }, + { + "drilldown" : "003", + "name" : "#003", + "y" : 83 + }, + { + "drilldown" : "004", + "name" : "#004", + "y" : 99 + }, + { + "y" : 78, + "name" : "#005", + "drilldown" : "005" + }, + { + "drilldown" : "006", + "y" : 58, + "name" : "#006" + }, + { + "drilldown" : "007", + "name" : "#007", + "y" : 64 + }, + { + "name" : "#008", + "y" : 78, + "drilldown" : "008" + }, + { + "drilldown" : "009", + "y" : 76, + "name" : "#009" + }, + { + "y" : 65, + "name" : "#010", + "drilldown" : "010" + }, + { + "y" : 85, + "name" : "#011", + "drilldown" : "011" + }, + { + "name" : "#012", + "y" : 89, + "drilldown" : "012" + }, + { + "y" : 85, + "name" : "#013", + "drilldown" : "013" + }, + { + "y" : 101, + "name" : "#014", + "drilldown" : "014" + }, + { + "y" : 99, + "name" : "#015", + "drilldown" : "015" + }, + { + "drilldown" : "016", + "y" : 71, + "name" : "#016" + }, + { + "name" : "#017", + "y" : 84, + "drilldown" : "017" + }, + { + "name" : "#018", + "y" : 81, + "drilldown" : "018" + }, + { + "drilldown" : "019", + "name" : "#019", + "y" : 103 + }, + { + "name" : "#020", + "y" : 101, + "drilldown" : "020" + }, + { + "drilldown" : "021", + "name" : "#021", + "y" : 72 + }, + { + "drilldown" : "022", + "y" : 68, + "name" : "#022" + }, + { + "name" : "#023", + "y" : 97, + "drilldown" : "023" + }, + { + "y" : 75, + "name" : "#024", + "drilldown" : "024" + }, + { + "y" : 59, + "name" : "#025", + "drilldown" : "025" + }, + { + "name" : "#026", + "y" : 74, + "drilldown" : "026" + }, + { + "drilldown" : "027", + "name" : "#027", + "y" : 62 + }, + { + "name" : "#028", + "y" : 82, + "drilldown" : "028" + }, + { + "name" : "#029", + "y" : 81, + "drilldown" : "029" + }, + { + "drilldown" : "030", + "y" : 119, + "name" : "#030" + }, + { + "drilldown" : "031", + "y" : 91, + "name" : "#031" + }, + { + "y" : 96, + "name" : "#032", + "drilldown" : "032" + }, + { + "drilldown" : "033", + "name" : "#033", + "y" : 112 + }, + { |
