Using the generic accumulate algorithm to compute a product by using multiplies : multiply « STL Algorithms Helper « C++ Tutorial

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » STL Algorithms Helper » multiply 
32.12.2.Using the generic accumulate algorithm to compute a product by using multiplies
#include <iostream>
#include <vector>
#include <cassert>
#include <numeric>  // For accumulate
#include <functional>  // For multiplies
using namespace std; 

int main()
{
  int x[5{235711};

  vector<int> vector1(&x[0], &x[5])
  
  int product = accumulate(vector1.begin(), vector1.end(),1, multiplies<int>());
    
  cout << product << endl;
  return 0;
}
2310
32.12.multiply
32.12.1.Using the generic accumulate algorithm to compute a product by using a function object
32.12.2.Using the generic accumulate algorithm to compute a product by using multiplies
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.