Pagini recente » Cod sursa (job #2949363) | Cod sursa (job #1788998) | Cod sursa (job #3210691) | Cod sursa (job #369557) | Cod sursa (job #1811161)
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
#include <map>
using namespace std;
int main()
{
ifstream in("abc2.in");
ofstream out("abc2.out");
string text_antic;
map<string,string> dictionar;
in >> text_antic;
int lungime_cuvant=0;
while ( !in.eof() ) {
string cuvant;
in >> cuvant;
lungime_cuvant = cuvant.size();
dictionar[cuvant]=cuvant;
}
int pozitii_candidat = 0;
for (unsigned i=0;i < text_antic.size()-lungime_cuvant+1; ++i) {
string cuv = text_antic.substr(i,lungime_cuvant);
if ( dictionar.find(cuv) != dictionar.end() )
pozitii_candidat++;
}
out << pozitii_candidat;
in.close();
out.close();
return 0;
}