From 0b5b4fa3987a14bf2aee3980fb08f95d1a1abd5f Mon Sep 17 00:00:00 2001
From: Mohammad S Anwar <mohammad.anwar@yahoo.com>
Date: Thu, 10 Jun 2021 00:37:37 +0100
Subject: - Added solutions by Ulrich Rieke.

---
 challenge-116/ulrich-rieke/cpp/ch-2.cpp | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 challenge-116/ulrich-rieke/cpp/ch-2.cpp

(limited to 'challenge-116/ulrich-rieke/cpp/ch-2.cpp')

diff --git a/challenge-116/ulrich-rieke/cpp/ch-2.cpp b/challenge-116/ulrich-rieke/cpp/ch-2.cpp
new file mode 100644
index 0000000000..8073680d19
--- /dev/null
+++ b/challenge-116/ulrich-rieke/cpp/ch-2.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <numeric>
+#include <cstdlib>
+#include <cmath>
+
+int main( int argc , char * argv[] ) {
+  if ( argc != 2 ) {
+      std::cerr << "Usage: challenge116_2 <number>!\n" ;
+      return 1 ;
+  }
+  int n = std::atoi( argv[ 1 ] ) ;
+  if ( n < 10 ) {
+      std::cerr << "Number must be greater than 9!\n" ;
+      return 2 ;
+  }
+  std::vector<int> digits ;
+  while ( n != 0 ) {
+      digits.push_back( n % 10 ) ;
+      n /= 10 ;
+  }
+  std::transform( digits.begin( ) , digits.end( ) , digits.begin( ) ,
+    []( int a ) { return a * a ; } ) ;
+  int squaresum = std::accumulate( digits.begin( ) , digits.end( ) , 0 ) ;
+  double theRoot = std::sqrt( static_cast<double>( squaresum ) ) ;
+  if ( std::floor( theRoot ) == theRoot )
+      std::cout << 1 << std::endl ;
+  else
+      std::cout << 0 << std::endl ;
+  return 0 ;
+}
-- 
cgit