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-2.cpp | 38 +++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 challenge-191/ulrich-rieke/cpp/ch-2.cpp (limited to 'challenge-191/ulrich-rieke/cpp/ch-2.cpp') 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 +#include +#include +#include +#include + +std::vector> createPairs( const std::vector + & numbers ) { + std::vector> allPairs ; + int count = 1 ; + for ( int n : numbers ) { + allPairs.push_back( std::make_pair( count , n )) ; + count++ ; + } + return allPairs ; +} + +bool isCute( const std::vector> & 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 numbers ( number ) ; + std::iota( numbers.begin( ) , numbers.end( ) , 1 ) ; + int count = 0 ; + do { + std::vector> thePairs ( createPairs( numbers )) ; + if ( isCute( thePairs )) { + count++ ; + } + } while ( std::next_permutation( numbers.begin( ) , numbers.end( ))) ; + std::cout << count << std::endl ; + return 0 ; +} -- cgit