aboutsummaryrefslogtreecommitdiff
path: root/challenge-202/ulrich-rieke/cpp/ch-1.cpp
diff options
context:
space:
mode:
author冯昶 <fengchang@novel-supertv.com>2023-02-06 18:29:49 +0800
committer冯昶 <fengchang@novel-supertv.com>2023-02-06 18:29:49 +0800
commit0f18fa3badcf6e6ddc58e793c868ce041054a496 (patch)
treead0b6ebe9b4b6b896475079163a282aec6b3fee3 /challenge-202/ulrich-rieke/cpp/ch-1.cpp
parentb99b26aef8b033642ff3794f0fddf6deb3234b43 (diff)
parentf92e84261b474f81c014f4982268d6e2797b66d9 (diff)
downloadperlweeklychallenge-club-0f18fa3badcf6e6ddc58e793c868ce041054a496.tar.gz
perlweeklychallenge-club-0f18fa3badcf6e6ddc58e793c868ce041054a496.tar.bz2
perlweeklychallenge-club-0f18fa3badcf6e6ddc58e793c868ce041054a496.zip
Merge remote-tracking branch 'upstream/master'
Diffstat (limited to 'challenge-202/ulrich-rieke/cpp/ch-1.cpp')
-rw-r--r--challenge-202/ulrich-rieke/cpp/ch-1.cpp37
1 files changed, 37 insertions, 0 deletions
diff --git a/challenge-202/ulrich-rieke/cpp/ch-1.cpp b/challenge-202/ulrich-rieke/cpp/ch-1.cpp
new file mode 100644
index 0000000000..be9c6968c1
--- /dev/null
+++ b/challenge-202/ulrich-rieke/cpp/ch-1.cpp
@@ -0,0 +1,37 @@
+#include <iostream>
+#include <vector>
+#include <string>
+#include <algorithm>
+#include <cstdlib>
+
+int main( int argc , char* argv[] ) {
+ if ( argc < 4 ) {
+ std::cout << "Enter a least 3 integers, separated by a blank!\n" ;
+ return 1 ;
+ }
+ else {
+ std::vector<int> numbers ;
+ for ( int i = 1 ; i < argc ; i++ ) {
+ numbers.push_back( std::atoi( argv[ i ] ) ) ;
+ }
+ int result = 0 ;
+ int len = numbers.size( ) ;
+ for ( int i = 0 ; i < len - 2 ; i++ ) {
+ if ( std::all_of( numbers.begin( ) + i , numbers.begin( ) + i + 3 ,
+ [ ]( int n ) { return n % 2 == 1 ; } ) )
+ result = 1 ;
+ }
+ std::cout << result << std::endl ;
+ return 0 ;
+ }
+}
+------------------------------------------------------------------------------------
+ task 1, in Haskell
+------------------------------------------------------------------------------------
+
+module Challenge202
+ where
+import Data.List.Split ( divvy )
+
+solution :: [Int] -> Int
+solution list = if any (\li -> all odd li ) $ divvy 3 1 list then 1 else 0