Cod sursa(job #1179753)

Utilizator sorynsooSorin Soo sorynsoo Data 29 aprilie 2014 10:50:48
Problema Algoritmul lui Euclid extins Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.67 kb
#include <iostream>
#include <vector>
#include <string>
using namespace std;

class test
{
public:
    int func(vector<string> v1, vector<string>v2)
    {
            vector<string>::iterator it;
            string::iterator it2;
            char bum2[]={"bum"};
            string st,st2,bum="bum";

            for(it=v1.begin(); it!=v1.end(); it++)
                st+=*it; // concatenare

            // insert
            cout<<st<<"\n";
            st.insert(4," ");
            st.insert(4,v2[0]);

            it2=st.begin();
            st.insert(it2,bum.begin(),bum.begin()+3);

            // erase
            st.erase(st.begin(), st.begin()+3);

            //substr
            st=st.substr(1,3);


            // copy in bum, din string in char

            st.copy(bum2,3,0);

            //find !!
            st="alabc   zzz aaa";
            st2="la";
            size_t poz =st.find(st2); // in tot stringu
            poz=0;
            poz=st.find("a",poz+5); // de la o anumita valoare

            // comparare

            cout<<st.compare(st2)<<"\n";
            cout<<st.compare(6,5,"apple",1,2); // stringul st compar de la pozitia 6 primele 5 caractere cu stringul "apple" de la pozitia 1 primele 2 caractere

            //back - > doar din c++ 11
            //std::string str ("hello world.");
            //str.back() = '!';
            //std::cout << str << '\n';
            st.clear();
            st.clear();
            cout<<"\n"<<st<<"\n";

    }
}tst;
int main()
{
    vector<string> v1,v2;
    v1.push_back("oioio");
    v1.push_back("aiaia");
    v2.push_back(" XOY ");
    tst.func(v1,v2);

}