aboutsummaryrefslogtreecommitdiff
path: root/challenge-283
diff options
context:
space:
mode:
authorMohammad Sajid Anwar <mohammad.anwar@yahoo.com>2024-08-19 14:33:23 +0100
committerMohammad Sajid Anwar <mohammad.anwar@yahoo.com>2024-08-19 14:33:23 +0100
commit4627610b81d312e5ff3ea2145d10c5dcd537fc93 (patch)
treea09b64a002c55735f6583dfe6872028f7319b87a /challenge-283
parenta265dee29c85b49ec7058f3a48feadef1b61e7b7 (diff)
downloadperlweeklychallenge-club-4627610b81d312e5ff3ea2145d10c5dcd537fc93.tar.gz
perlweeklychallenge-club-4627610b81d312e5ff3ea2145d10c5dcd537fc93.tar.bz2
perlweeklychallenge-club-4627610b81d312e5ff3ea2145d10c5dcd537fc93.zip
- Added solutions by Ulrich Rieke.
Diffstat (limited to 'challenge-283')
-rwxr-xr-xchallenge-283/ulrich-rieke/cpp/ch-1.cpp33
-rwxr-xr-xchallenge-283/ulrich-rieke/cpp/ch-2.cpp35
-rwxr-xr-xchallenge-283/ulrich-rieke/haskell/ch-1.hs12
-rwxr-xr-xchallenge-283/ulrich-rieke/haskell/ch-2.hs19
-rwxr-xr-xchallenge-283/ulrich-rieke/perl/ch-1.pl13
-rwxr-xr-xchallenge-283/ulrich-rieke/perl/ch-2.pl18
-rwxr-xr-xchallenge-283/ulrich-rieke/raku/ch-1.raku8
-rwxr-xr-xchallenge-283/ulrich-rieke/raku/ch-2.raku12
-rwxr-xr-xchallenge-283/ulrich-rieke/rust/ch-1.rs21
-rwxr-xr-xchallenge-283/ulrich-rieke/rust/ch-2.rs16
10 files changed, 187 insertions, 0 deletions
diff --git a/challenge-283/ulrich-rieke/cpp/ch-1.cpp b/challenge-283/ulrich-rieke/cpp/ch-1.cpp
new file mode 100755
index 0000000000..908539ecf9
--- /dev/null
+++ b/challenge-283/ulrich-rieke/cpp/ch-1.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <string>
+#include <map>
+#include <sstream>
+
+std::vector<std::string> split( std::string text , const char delimiter ) {
+ std::stringstream instr { text } ;
+ std::string word ;
+ std::vector<std::string> tokens ;
+ while ( std::getline( instr , word , delimiter ))
+ tokens.push_back( word ) ;
+ return tokens ;
+}
+
+int main( ) {
+ std::cout << "Enter some integers several times , one only once!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ auto tokens { split( line, ' ' ) } ;
+ std::vector<int> numbers ;
+ for ( auto s : tokens )
+ numbers.push_back( std::stoi( s ) ) ;
+ std::map<int , int> frequencies ;
+ for ( int i : numbers )
+ frequencies[i]++ ;
+ for ( auto it = frequencies.begin( ) ; it != frequencies.end( ) ; ++it ) {
+ if ( it->second == 1 ) {
+ std::cout << it->first << '\n' ;
+ }
+ }
+ return 0 ;
+}
diff --git a/challenge-283/ulrich-rieke/cpp/ch-2.cpp b/challenge-283/ulrich-rieke/cpp/ch-2.cpp
new file mode 100755
index 0000000000..a53ddde486
--- /dev/null
+++ b/challenge-283/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,35 @@
+#include <vector>
+#include <sstream>
+#include <string>
+#include <algorithm>
+#include <iostream>
+#include <numeric>
+
+std::vector<std::string> split( std::string text , const char delimiter ) {
+ std::stringstream instr { text } ;
+ std::vector<std::string> allTokens ;
+ std::string word ;
+ while ( std::getline( instr, word , delimiter ) ) {
+ allTokens.push_back( word ) ;
+ }
+ return allTokens ;
+}
+
+int main( ) {
+ std::cout << "Enter some positive integers, separated by blanks!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ std::vector<std::string> tokens { split( line, ' ' ) } ;
+ std::vector<int> numbers ;
+ for ( auto s : tokens )
+ numbers.push_back( std::stoi( s ) ) ;
+ int len = numbers.size( ) ;
+ std::vector<int> indices( len ) ;
+ std::iota( indices.begin( ) , indices.end( ) , 0 ) ;
+ bool result = std::all_of( indices.begin( ) , indices.end( ) ,
+ [&numbers]( int i ) { return std::count( numbers.begin( ) ,
+ numbers.end( ) , i ) == numbers[ i ] ; } ) ;
+ std::cout << std::boolalpha << result << '\n' ;
+ return 0 ;
+}
+
diff --git a/challenge-283/ulrich-rieke/haskell/ch-1.hs b/challenge-283/ulrich-rieke/haskell/ch-1.hs
new file mode 100755
index 0000000000..988d9412a4
--- /dev/null
+++ b/challenge-283/ulrich-rieke/haskell/ch-1.hs
@@ -0,0 +1,12 @@
+module Challenge283
+ where
+import Data.List ( sort , group )
+
+solution :: [Int] -> Int
+solution = head . head . filter ( (== 1 ) . length ) . group . sort
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some integers several times , one only once!"
+ numberline <- getLine
+ print $ solution $ map read $ words numberline
diff --git a/challenge-283/ulrich-rieke/haskell/ch-2.hs b/challenge-283/ulrich-rieke/haskell/ch-2.hs
new file mode 100755
index 0000000000..ba19d6e631
--- /dev/null
+++ b/challenge-283/ulrich-rieke/haskell/ch-2.hs
@@ -0,0 +1,19 @@
+module Challenge283_2
+ where
+import Data.List ( (!!) )
+
+count :: Eq a => a -> [a] -> Int
+count _ [] = 0
+count d (x:xs)
+ |d == x = 1 + count d xs
+ |otherwise = count d xs
+
+solution :: [Int] -> Bool
+solution numbers = all (\(index , number) -> count index numbers ==
+ numbers !! index ) $ zip [0 , 1 ..] numbers
+
+main :: IO ( )
+main = do
+ putStrLn "Enter some numbers , separated by blanks!" ;
+ numberline <- getLine
+ print $ solution $ map read $ words numberline
diff --git a/challenge-283/ulrich-rieke/perl/ch-1.pl b/challenge-283/ulrich-rieke/perl/ch-1.pl
new file mode 100755
index 0000000000..3cf76603df
--- /dev/null
+++ b/challenge-283/ulrich-rieke/perl/ch-1.pl
@@ -0,0 +1,13 @@
+#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+say "Enter some numbers several times, only one number once!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+my %frequencies ;
+map { $frequencies{$_}++ } @numbers ;
+my @selected = grep { $frequencies{$_} == 1 } @numbers ;
+say $selected[0] ;
diff --git a/challenge-283/ulrich-rieke/perl/ch-2.pl b/challenge-283/ulrich-rieke/perl/ch-2.pl
new file mode 100755
index 0000000000..87f600eb74
--- /dev/null
+++ b/challenge-283/ulrich-rieke/perl/ch-2.pl
@@ -0,0 +1,18 @@
+#!/usr/bin/perl ;
+use strict ;
+use warnings ;
+use feature 'say' ;
+
+say "Enter some positive integers, separated by blanks!" ;
+my $line = <STDIN> ;
+chomp $line ;
+my @numbers = split( /\s+/ , $line ) ;
+my $len = scalar( @numbers ) - 1 ;
+#assume result to be true unless proven to be false
+my $result = "true" ;
+for my $index (0..$len ) {
+ if ( scalar( grep { $_ == $index } @numbers ) != $numbers[ $index ] ) {
+ $result = "false" ;
+ }
+}
+say $result ;
diff --git a/challenge-283/ulrich-rieke/raku/ch-1.raku b/challenge-283/ulrich-rieke/raku/ch-1.raku
new file mode 100755
index 0000000000..c1d1725c61
--- /dev/null
+++ b/challenge-283/ulrich-rieke/raku/ch-1.raku
@@ -0,0 +1,8 @@
+use v6 ;
+
+say "Enter several numbers more than once , only one once!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+my %frequencies ;
+@numbers.map( {%frequencies{$_}++} ) ;
+say @numbers.grep( {%frequencies{$_} == 1})[0] ;
diff --git a/challenge-283/ulrich-rieke/raku/ch-2.raku b/challenge-283/ulrich-rieke/raku/ch-2.raku
new file mode 100755
index 0000000000..f95e3a274b
--- /dev/null
+++ b/challenge-283/ulrich-rieke/raku/ch-2.raku
@@ -0,0 +1,12 @@
+use v6 ;
+
+say "Enter some positive integers, separated by blanks!" ;
+my $line = $*IN.get ;
+my @numbers = $line.words.map( {.Int} ) ;
+my $result = True ;
+for (0..@numbers.elems - 1) -> $i {
+ if (( @numbers.grep( {$_ == $i} ).elems) != @numbers[ $i ] ) {
+ $result = False ;
+ }
+}
+say $result ;
diff --git a/challenge-283/ulrich-rieke/rust/ch-1.rs b/challenge-283/ulrich-rieke/rust/ch-1.rs
new file mode 100755
index 0000000000..c643a5e44d
--- /dev/null
+++ b/challenge-283/ulrich-rieke/rust/ch-1.rs
@@ -0,0 +1,21 @@
+use std::io ;
+use std::collections::HashMap ;
+
+fn main() {
+ println!("Enter some integers several times , one only once!");
+ let mut inline : String = String::new( ) ;
+ io::stdin( ).read_line( &mut inline ).unwrap( ) ;
+ let entered_line : &str = inline.as_str( ).trim( ) ;
+ let numbers : Vec<u32> = entered_line.split_whitespace( ).map( | s |
+ s.parse::<u32>( ).unwrap( ) ).collect( ) ;
+ let mut frequencies : HashMap<_,_> = HashMap::new( ) ;
+ numbers.into_iter( ).for_each( | n | {
+ frequencies.entry( n ).
+ and_modify( | e | *e += 1 ).or_insert( 1 ) ;
+ } ) ;
+ for ( k , v ) in &frequencies {
+ if *v == 1 {
+ println!("{}" , k ) ;
+ }
+ }
+}
diff --git a/challenge-283/ulrich-rieke/rust/ch-2.rs b/challenge-283/ulrich-rieke/rust/ch-2.rs
new file mode 100755
index 0000000000..770496ffc4
--- /dev/null
+++ b/challenge-283/ulrich-rieke/rust/ch-2.rs
@@ -0,0 +1,16 @@
+use std::io ;
+
+fn main() {
+ println!("Enter some positive integers separated by blanks!");
+ let mut inline : String = String::new( ) ;
+ io::stdin( ).read_line( &mut inline ).unwrap( ) ;
+ let entered_line : &str = inline.as_str( ).trim( ) ;
+ let numbers : Vec<u32> = entered_line.split_whitespace( ).map( | s |
+ s.parse::<u32>( ).unwrap( ) ).collect( ) ;
+ let result : bool = (0..numbers.len( )).all( | i | {
+ let number : u32 = numbers[ i ] ;
+ numbers.iter( ).filter( | &d | *d == (i as u32) ).count( ) ==
+ number as usize
+ }) ;
+ println!("{}" , result ) ;
+}