aboutsummaryrefslogtreecommitdiff
path: root/challenge-226/ulrich-rieke/cpp/ch-2.cpp
diff options
context:
space:
mode:
authorDave Jacoby <jacoby.david@gmail.com>2023-07-31 09:33:10 -0400
committerDave Jacoby <jacoby.david@gmail.com>2023-07-31 09:33:10 -0400
commitecd08452c0bc55f0072f8d260ec830d4ec8cccc9 (patch)
tree9ba31f20e804820e13ae16d0ab4491d93e5c9313 /challenge-226/ulrich-rieke/cpp/ch-2.cpp
parent9a38bd2ff080991f73d7f49cebf2fbab06c69d94 (diff)
parente511966ce2280dbedb2c916d9e6254708800639e (diff)
downloadperlweeklychallenge-club-ecd08452c0bc55f0072f8d260ec830d4ec8cccc9.tar.gz
perlweeklychallenge-club-ecd08452c0bc55f0072f8d260ec830d4ec8cccc9.tar.bz2
perlweeklychallenge-club-ecd08452c0bc55f0072f8d260ec830d4ec8cccc9.zip
Merge branch 'master' of https://github.com/manwar/perlweeklychallenge-club
Diffstat (limited to 'challenge-226/ulrich-rieke/cpp/ch-2.cpp')
-rwxr-xr-xchallenge-226/ulrich-rieke/cpp/ch-2.cpp48
1 files changed, 48 insertions, 0 deletions
diff --git a/challenge-226/ulrich-rieke/cpp/ch-2.cpp b/challenge-226/ulrich-rieke/cpp/ch-2.cpp
new file mode 100755
index 0000000000..d80e8da2a5
--- /dev/null
+++ b/challenge-226/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,48 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+
+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 mySubtr( int n , int min ) {
+ n -= min ;
+ if ( n < 0 )
+ n = 0 ;
+ return n ;
+}
+
+int main( ) {
+ std::cout << "Enter some positive integers, separated by blanks!\n" ;
+ std::string line ;
+ std::getline( std::cin , line ) ;
+ std::vector<std::string> numberstrings ( split ( line , " " ) ) ;
+ std::vector<int> numbers ;
+ for ( auto s : numberstrings ) {
+ numbers.push_back( std::stoi( s ) ) ;
+ }
+ int rounds = 0 ;
+ while ( ! std::all_of( numbers.begin( ) , numbers.end( ) , []( int n ) {
+ return n == 0 ; } ) ) {
+ std::vector<int> positives ;
+ std::copy_if( numbers.begin( ) , numbers.end( ) , std::back_inserter(
+ positives ) , []( int i ) { return i > 0 ; } ) ;
+ int mini = *std::min_element( positives.begin( ) , positives.end( ) ) ;
+ rounds++ ;
+ std::transform( numbers.begin( ) , numbers.end( ) , numbers.begin( ) ,
+ [mini]( int i ) { return mySubtr( i , mini ) ; } ) ;
+ }
+ std::cout << rounds << std::endl ;
+ return 0 ;
+}