aboutsummaryrefslogtreecommitdiff
path: root/challenge-191/ulrich-rieke/cpp/ch-2.cpp
diff options
context:
space:
mode:
authorDave Jacoby <jacoby.david@gmail.com>2022-11-20 14:22:01 -0500
committerDave Jacoby <jacoby.david@gmail.com>2022-11-20 14:22:01 -0500
commitdd682dfee966fe63cbfbbbf6a9cb903b1d831416 (patch)
treea71619e10c8dcd29fc13a08beb1325f4a7bc5a84 /challenge-191/ulrich-rieke/cpp/ch-2.cpp
parentd6d01468fd7a5647b9ba96ebf7a0157ff79f3352 (diff)
parentbde0adaf7b8dfe99c4e494c932d8702eb8cf9a56 (diff)
downloadperlweeklychallenge-club-dd682dfee966fe63cbfbbbf6a9cb903b1d831416.tar.gz
perlweeklychallenge-club-dd682dfee966fe63cbfbbbf6a9cb903b1d831416.tar.bz2
perlweeklychallenge-club-dd682dfee966fe63cbfbbbf6a9cb903b1d831416.zip
Merge branch 'master' of https://github.com/manwar/perlweeklychallenge-club
Diffstat (limited to 'challenge-191/ulrich-rieke/cpp/ch-2.cpp')
-rw-r--r--challenge-191/ulrich-rieke/cpp/ch-2.cpp38
1 files changed, 38 insertions, 0 deletions
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 ;
+}