- Added solutions by Ulrich Rieke.

- Added solutions by David Ferrone.
- Added solutions by PokGoPun.
- Added solutions by Roger Bell_West.
- Added solutions by Luca Ferrari.

1 files changed, 23 insertions, 0 deletions

diff --git a/challenge-260/ulrich-rieke/cpp/ch-2.cpp b/challenge-260/ulrich-rieke/cpp/ch-2.cpp
new file mode 100755
index 0000000000..c04b8ffb58
--- /dev/null
+++ b/challenge-260/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,23 @@
+#include <iostream>

+#include <algorithm>

+#include <string>

+#include <iterator>

+#include <vector>

+

+int main( ) {

+   std::cout << "Enter a word, preferably in capital letters only!\n" ;

+   std::string word ;

+   std::getline( std::cin , word ) ;

+   std::string entered { word } ;

+   std::vector<std::string> permus ;

+   std::sort( word.begin( ) , word.end( ) ) ;

+   do {

+      permus.push_back( word ) ;

+   } while ( std::next_permutation( word.begin( ) , word.end( ) )) ;

+   std::sort( permus.begin( ) , permus.end( ) ) ;

+   auto found = std::find( permus.begin( ) , permus.end( ) , entered ) ;

+   std::cout << (static_cast<int>(std::distance( permus.begin( ) , found))) 

+      + 1 ;

+   std::cout << '\n' ;

+   return 0 ;

+}