Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 534073
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T09:34:26+00:00 2026-05-13T09:34:26+00:00

Say there is a list of integers [1,2,3,4,5] and a map function that multiplies

  • 0

Say there is a list of integers [1,2,3,4,5] and a map function that multiplies each element with 10 and returns modified list as [10,20,30,40,50] , with out modifying the original list.
How this can be done efficiently in c++.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T09:34:26+00:00Added an answer on May 13, 2026 at 9:34 am

    Here’s an example:

    #include <vector>
    #include <iostream>
    #include <algorithm>
    
    using namespace std;
    
    int multiply(int);
    
    int main() {
        vector<int> source;
        for(int i = 1; i <= 5; i++) {
        source.push_back(i);
        }
    
        vector<int> result;
        result.resize(source.size());
        transform(source.begin(), source.end(), result.begin(), multiply);
    
        for(vector<int>::iterator it = result.begin(); it != result.end(); ++it) {
            cout << *it << endl;
        }
    }
    
    int multiply(int value) {
        return value * 10;
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Say I have a list of integers, where each element is a number from
Is there some Haskell function that can take a list, say of doubles, like
If I had list of integers say, x = [1,2,3,4,5] Is there an in-built
I have a list of integers that contains a number of values (say, 200).
Say you have a std::list of some class. There are two ways you can
Say I have this: private list<myClass> myCollection; Is there a programming idiom to shorten
Say you need to have a list/array of integers which you need iterate frequently,
Say I have a Group data structure which contains a list of Element objects,
Say I have the following snippet: int? nullableId = GetNonNullableInts().FirstOrDefault(); Because GetNonNullableInts() returns integers,
Is there any way to find the lowest modulus of a list of integers?

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.