diff options
Diffstat (limited to 'challenge-261/ulrich-rieke')
| -rwxr-xr-x | challenge-261/ulrich-rieke/cpp/ch-1.cpp | 30 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/cpp/ch-2.cpp | 35 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/haskell/ch-1.hs | 17 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/haskell/ch-2.hs | 13 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/perl/ch-1.pl | 13 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/perl/ch-2.pl | 17 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/raku/ch-1.raku | 8 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/raku/ch-2.raku | 13 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/rust/ch-1.rs | 27 | ||||
| -rwxr-xr-x | challenge-261/ulrich-rieke/rust/ch-2.rs | 22 |
10 files changed, 195 insertions, 0 deletions
diff --git a/challenge-261/ulrich-rieke/cpp/ch-1.cpp b/challenge-261/ulrich-rieke/cpp/ch-1.cpp new file mode 100755 index 0000000000..a088bfc147 --- /dev/null +++ b/challenge-261/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,30 @@ +#include <iostream>
+#include <numeric>
+#include <vector>
+#include <iterator>
+#include <cstdlib>
+
+int digitsum( int n ) {
+ int sum = 0 ;
+ while ( n != 0 ) {
+ sum += n % 10 ;
+ n /= 10 ;
+ }
+ return sum ;
+}
+
+int main( ) {
+ std::cout << "Enter some integers, separated by blanks!\n" ;
+ std::cout << "Enter e to end!\n" ;
+ std::vector<int> numbers {std::istream_iterator<int>{std::cin} ,
+ std::istream_iterator<int>{}} ;
+ int element_sum = std::accumulate( numbers.begin( ) , numbers.end( ) ,
+ 0 ) ;
+ std::vector<int> digitsums ;
+ for ( int i : numbers )
+ digitsums.push_back( digitsum( i ) ) ;
+ int total_digitsums = std::accumulate( digitsums.begin( ) ,
+ digitsums.end( ) , 0 ) ;
+ std::cout << std::abs( total_digitsums - element_sum) << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-261/ulrich-rieke/cpp/ch-2.cpp b/challenge-261/ulrich-rieke/cpp/ch-2.cpp new file mode 100755 index 0000000000..e5a956a286 --- /dev/null +++ b/challenge-261/ulrich-rieke/cpp/ch-2.cpp @@ -0,0 +1,35 @@ +#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <string>
+
+std::vector<std::string> split( const std::string & startline ,
+ const std::string & sep ) {
+ std::vector<std::string> separated ;
+ std::string::size_type start { 0 } ;
+ std::string::size_type pos ;
+ do {
+ pos = startline.find_first_of( sep , start ) ;
+ separated.push_back( startline.substr(start , pos - start )) ;
+ start = pos + 1 ;
+ } while ( pos != std::string::npos ) ;
+ return separated ;
+}
+
+int main( ) {
+ std::cout << "Enter some integers, separated by blanks!\n" ;
+ std::string numberline ;
+ std::getline( std::cin , numberline ) ;
+ std::vector<std::string> innumbers { split( numberline , " " ) } ;
+ std::vector<int> numbers ;
+ for ( auto w : innumbers )
+ numbers.push_back( std::stoi( w ) ) ;
+ std::cout << "Enter a start number!\n" ;
+ int start ;
+ std::cin >> start ;
+ while ( std::find( numbers.begin( ) , numbers.end( ) , start ) !=
+ numbers.end( ) )
+ start *= 2 ;
+ std::cout << start << '\n' ;
+ return 0 ;
+}
diff --git a/challenge-261/ulrich-rieke/haskell/ch-1.hs b/challenge-261/ulrich-rieke/haskell/ch-1.hs new file mode 100755 index 0000000000..515d9bb0d0 --- /dev/null +++ b/challenge-261/ulrich-rieke/haskell/ch-1.hs @@ -0,0 +1,17 @@ +module Challenge261
+ where
+import Data.Char( digitToInt )
+
+solution :: [Int] -> Int
+solution list = abs ( elementsums - digitsums )
+ where
+ elementsums :: Int
+ elementsums = sum list
+ digitsums :: Int
+ digitsums = sum $ map ( sum . map digitToInt . show ) list
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some integers, separated by blanks!"
+ numbers <- getLine
+ print $ solution ( map read $ words numbers )
diff --git a/challenge-261/ulrich-rieke/haskell/ch-2.hs b/challenge-261/ulrich-rieke/haskell/ch-2.hs new file mode 100755 index 0000000000..13f141fd25 --- /dev/null +++ b/challenge-261/ulrich-rieke/haskell/ch-2.hs @@ -0,0 +1,13 @@ +module Challenge261_2
+ where
+
+solution :: [Int] -> Int -> Int
+solution list start = until (\n -> not $ elem n list ) (* 2 ) start
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some numbers, separated by blanks!"
+ numberstrings <- getLine
+ putStrLn "Enter a start number!"
+ startline <- getLine
+ print $ solution ( map read $ words numberstrings ) ( read startline )
diff --git a/challenge-261/ulrich-rieke/perl/ch-1.pl b/challenge-261/ulrich-rieke/perl/ch-1.pl new file mode 100755 index 0000000000..2239702a1c --- /dev/null +++ b/challenge-261/ulrich-rieke/perl/ch-1.pl @@ -0,0 +1,13 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( sum ) ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+my $element_sum = sum( @numbers) ;
+my $digit_sum = sum( map { sum( split( // , $_ )) } @numbers ) ;
+say abs( $element_sum - $digit_sum ) ;
diff --git a/challenge-261/ulrich-rieke/perl/ch-2.pl b/challenge-261/ulrich-rieke/perl/ch-2.pl new file mode 100755 index 0000000000..40cbf5801d --- /dev/null +++ b/challenge-261/ulrich-rieke/perl/ch-2.pl @@ -0,0 +1,17 @@ +#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+use List::Util qw ( any ) ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+say "Enter a start number!" ;
+my $start = <STDIN> ;
+chomp $start ;
+while ( any { $_ == $start } @numbers ) {
+ $start *= 2 ;
+}
+say $start ;
diff --git a/challenge-261/ulrich-rieke/raku/ch-1.raku b/challenge-261/ulrich-rieke/raku/ch-1.raku new file mode 100755 index 0000000000..9ee268c6a8 --- /dev/null +++ b/challenge-261/ulrich-rieke/raku/ch-1.raku @@ -0,0 +1,8 @@ +use v6 ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+my $element_sum = [+] @numbers ;
+my $digit_sum = [+] @numbers.map( {[+] $_.Str.comb.map( {.Int} )} ) ;
+say abs( $element_sum - $digit_sum ) ;
diff --git a/challenge-261/ulrich-rieke/raku/ch-2.raku b/challenge-261/ulrich-rieke/raku/ch-2.raku new file mode 100755 index 0000000000..fda637bc4d --- /dev/null +++ b/challenge-261/ulrich-rieke/raku/ch-2.raku @@ -0,0 +1,13 @@ +use v6 ;
+
+say "Enter some integers, separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+say "Enter a start number!" ;
+my $startn = $*IN.get ;
+my $start = +$startn ;
+my $found = $start ;
+while ( so $found == @numbers.any ) {
+ $found *= 2 ;
+}
+say $found ;
diff --git a/challenge-261/ulrich-rieke/rust/ch-1.rs b/challenge-261/ulrich-rieke/rust/ch-1.rs new file mode 100755 index 0000000000..aca36f9ab7 --- /dev/null +++ b/challenge-261/ulrich-rieke/rust/ch-1.rs @@ -0,0 +1,27 @@ +use std::io ; + +fn digitsum( num : i32 ) -> i32 { + let mut sum : i32 = 0 ; + let mut n : i32 = num ; + while n != 0 { + sum = sum + n % 10 ; + n = n / 10 ; + } + sum +} + +fn main() { + println!("Enter some integers, separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let entered_line : &str = &*inline ; + let numbers : Vec<i32> = entered_line.split_whitespace( ).map( | s | + s.trim( ).parse::<i32>( ).unwrap( )).collect( ) ; + let element_sum : i32 = numbers.iter( ).sum( ) ; + let mut digit_sum : i32 = 0 ; + numbers.iter( ).map( | d | { + let ds : i32 = digitsum( *d ) ; + ds + }).for_each( | n | digit_sum += n ) ; + println!("{}" , (element_sum - digit_sum).abs( ) ) ; +} diff --git a/challenge-261/ulrich-rieke/rust/ch-2.rs b/challenge-261/ulrich-rieke/rust/ch-2.rs new file mode 100755 index 0000000000..f5edd77a6d --- /dev/null +++ b/challenge-261/ulrich-rieke/rust/ch-2.rs @@ -0,0 +1,22 @@ +use std::io ; + +fn main() { + println!("Enter some integers, separated by blanks!"); + let mut inline : String = String::new( ) ; + io::stdin( ).read_line( &mut inline ).unwrap( ) ; + let entered_line : &str = &*inline ; + let numbers : Vec<i32> = entered_line.split_whitespace( ).map( | s | + s.trim( ).parse::<i32>( ).unwrap( )).collect( ) ; + println!("Enter a start number!") ; + let mut numline : String = String::new( ) ; + io::stdin( ).read_line( &mut numline ).unwrap( ) ; + let nline : &str = &*numline ; + let start : i32 = nline.trim( ).parse::<i32>( ).unwrap( ) ; + let mut found : i32 = start ; + let mut f = numbers.iter( ).find( | &d | *d == found ) ; + while f.is_some( ) { + found = found * 2 ; + f = numbers.iter( ).find( | &d | *d == found ) ; + } + println!("{}" , found ) ; +} |
