Solutions for a junior Cpp problem about STL

This problem is published on HackerRand.

Problem description : 

You are provided with a vector of  integers. Then, you are given  queries. For the first query, you are provided with  integer, which denotes a position in the vector. The value at this position in the vector needs to be erased. The next query consists of  integers denoting a range of the positions in the vector. The elements which fall under that range should be removed. The second query is performed on the updated vector which we get after performing the first query.

The following are some useful vector functions:

 

• erase(int position):

  Removes the element present at position.  
  Ex: v.erase(v.begin()+4); (erases the fifth element of the vector v)

• erase(int start,int end):

• Removes the elements in the range from start to end inclusive of the start and exclusive of the end.
  Ex:v.erase(v.begin()+2,v.begin()+5);(erases all the elements from the third element to the fifth element.)

 

Input Format

The first line of the input contains an integer .The next line contains  space separated integers(1-based index).The third line contains a single integer ,denoting the position of an element that should be removed from the vector.The fourth line contains two integers  and  denoting the range that should be erased from the vector inclusive of a and exclusive of b.
 

Constraints
 
 

Output Format

Print the size of the vector in the first line and the elements of the vector after the two erase operations in the second line separated by space.

Sample Input

6
1 4 6 2 8 9
2
2 4

Sample Output

3
1 8 9

Explanation

The first query is to erase the 2nd element in the vector, which is 4. Then, modifed vector is {1 6 2 8 9}, we want to remove the range of 2~4, which means the 2nd and 3rd elements should be removed. Then 6 and 2 in the modified vector are removed and we finally get {1 8 9}

 

Solutions : 

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;

// version 1
// int main() {
//     /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
//     int n;
//     cin >> n;
//     vector<int> v(n,0);
//     for(int i = 0; i < n; i++){
//         cin >> v[i];
//     }
//     int p;
//     int rs, re;
//     cin >> p >> rs >> re;
//     v.erase(v.begin() + p - 1);
//     v.erase(v.begin() + rs - 1, v.begin() + re - 1);
//     cout << v.size() << endl;
//     for(vector<int>::iterator it = v.begin(); it != v.end(); it++)
//         cout << *it << ' ';
//     return 0;
// }


// version 2 - copy function, istream_intertor, ostream_iterator
// int main() {
//     /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
//     int n;
//     cin >> n;
//     vector<int> v;
//     copy_n(istream_iterator<int>(cin), n, back_inserter(v));
//     int p;
//     int rs, re;
//     cin >> p >> rs >> re;
//     v.erase(v.begin() + p - 1);
//     v.erase(v.begin() + rs - 1, v.begin() + re - 1);
//     cout << v.size() << endl;
//     copy(begin(v), end(v), ostream_iterator<int>(cout, " "));
//     return 0;
// }


// version 3 - for_each with Lambda function
// int main() {
//     /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
//     int n;
//     cin >> n;
//     vector<int> v;
//     copy_n(istream_iterator<int>(cin), n, back_inserter(v));
//     int p;
//     int rs, re;
//     cin >> p >> rs >> re;
//     v.erase(v.begin() + p - 1);
//     v.erase(v.begin() + rs - 1, v.begin() + re - 1);
//     cout << v.size() << endl;
//     for_each(v.begin(), v.end(), [](int i){cout << i << " ";});
//     return 0;
// }

// version 4 - for_each with function
// void func(int i){
//     cout << i << " ";
// }

// int main() {
//     /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
//     int n;
//     cin >> n;
//     vector<int> v;
//     copy_n(istream_iterator<int>(cin), n, back_inserter(v));
//     int p;
//     int rs, re;
//     cin >> p >> rs >> re;
//     v.erase(v.begin() + p - 1);
//     v.erase(v.begin() + rs - 1, v.begin() + re - 1);
//     cout << v.size() << endl;
//     for_each(v.begin(), v.end(), func);
//     return 0;
// }

// version 5 - for_each with struct
// struct myfunc{
//     void operator () (int i) {cout << i << " ";} 
// } func;

// int main() {
//     /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
//     int n;
//     cin >> n;
//     vector<int> v;
//     copy_n(istream_iterator<int>(cin), n, back_inserter(v));
//     int p;
//     int rs, re;
//     cin >> p >> rs >> re;
//     v.erase(v.begin() + p - 1);
//     v.erase(v.begin() + rs - 1, v.begin() + re - 1);
//     cout << v.size() << endl;
//     for_each(v.begin(), v.end(), func);
//     return 0;
// }

// version 6 - for_each with class
// class myfunc{
// public:
//     void operator () (int i) {cout << i << " ";} 
// } func;

// int main() {
//     /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
//     int n;
//     cin >> n;
//     vector<int> v;
//     copy_n(istream_iterator<int>(cin), n, back_inserter(v));
//     int p;
//     int rs, re;
//     cin >> p >> rs >> re;
//     v.erase(v.begin() + p - 1);
//     v.erase(v.begin() + rs - 1, v.begin() + re - 1);
//     cout << v.size() << endl;
//     for_each(v.begin(), v.end(), func);
//     return 0;
// }

// version 7 - for
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin >> n;
    vector<int> v;
    copy_n(istream_iterator<int>(cin), n, back_inserter(v));
    int p;
    int rs, re;
    cin >> p >> rs >> re;
    v.erase(v.begin() + p - 1);
    v.erase(v.begin() + rs - 1, v.begin() + re - 1);
    cout << v.size() << endl;
    for(int i : v) { cout << i << ' ';}
    return 0;
}