From 53324ed8af4d2e2211d4ce6cc51d1c0471d30c3a Mon Sep 17 00:00:00 2001 From: Mohammad S Anwar Date: Mon, 14 Nov 2022 20:13:23 +0000 Subject: - Added solutions by Ulrich Rieke. --- challenge-191/ulrich-rieke/cpp/ch-1.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 challenge-191/ulrich-rieke/cpp/ch-1.cpp (limited to 'challenge-191/ulrich-rieke/cpp/ch-1.cpp') diff --git a/challenge-191/ulrich-rieke/cpp/ch-1.cpp b/challenge-191/ulrich-rieke/cpp/ch-1.cpp new file mode 100644 index 0000000000..35a1da15bf --- /dev/null +++ b/challenge-191/ulrich-rieke/cpp/ch-1.cpp @@ -0,0 +1,33 @@ +#include +#include +#include +#include + +std::vector split( const std::string & startline , const std::string & sep ) { + std::vector 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 << "Please enter a number of integers, separated by blanks!\n" ; + std::string line ; + std::getline( std::cin , line ) ; + std::vector numberstrings( split( line , " " )) ; + std::vector numbers ; + for ( auto & s : numberstrings ) + numbers.push_back( std::stoi( s )) ; + int maximum = *std::max_element( numbers.begin( ) , numbers.end( )) ; + if ( std::any_of( numbers.begin( ) , numbers.end( ) , [maximum]( const int n ) { + return ( n != maximum && maximum < 2 * n ) ; })) + std::cout << -1 << std::endl ; + else + std::cout << 1 << std::endl ; + return 0 ; +} -- cgit