aboutsummaryrefslogtreecommitdiff
path: root/challenge-191/ulrich-rieke/cpp
diff options
context:
space:
mode:
Diffstat (limited to 'challenge-191/ulrich-rieke/cpp')
-rw-r--r--challenge-191/ulrich-rieke/cpp/ch-1.cpp33
-rw-r--r--challenge-191/ulrich-rieke/cpp/ch-2.cpp38
2 files changed, 71 insertions, 0 deletions
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 <iostream>
+#include <vector>
+#include <string>
+#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 main( ) {
+ std::cout << "Please enter a number of 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 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 ;
+}
diff --git a/challenge-191/ulrich-rieke/cpp/ch-2.cpp b/challenge-191/ulrich-rieke/cpp/ch-2.cpp
new file mode 100644
index 0000000000..0cb6d01f46
--- /dev/null
+++ b/challenge-191/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <utility>
+#include <numeric>
+
+std::vector<std::pair<int , int>> createPairs( const std::vector<int>
+ & numbers ) {
+ std::vector<std::pair<int , int>> allPairs ;
+ int count = 1 ;
+ for ( int n : numbers ) {
+ allPairs.push_back( std::make_pair( count , n )) ;
+ count++ ;
+ }
+ return allPairs ;
+}
+
+bool isCute( const std::vector<std::pair<int , int>> & allPairs ) {
+ return std::all_of( allPairs.begin( ) , allPairs.end( ) , []( const
+ auto & p) { return p.first % p.second == 0 || p.second % p.first == 0 ;}) ;
+}
+
+int main( ) {
+ std::cout << "Please enter an integer greater than 0 and up to 15 inclusive!\n" ;
+ int number ;
+ std::cin >> number ;
+ std::vector<int> numbers ( number ) ;
+ std::iota( numbers.begin( ) , numbers.end( ) , 1 ) ;
+ int count = 0 ;
+ do {
+ std::vector<std::pair<int , int>> thePairs ( createPairs( numbers )) ;
+ if ( isCute( thePairs )) {
+ count++ ;
+ }
+ } while ( std::next_permutation( numbers.begin( ) , numbers.end( ))) ;
+ std::cout << count << std::endl ;
+ return 0 ;
+}