I_anno/Programmazione_2/gualtieri.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

#include<iostream>
#include<fstream>
#include<map>

using namespace std;

int main() {
    ifstream in("input.txt");
    ofstream out("output.txt");

    for(int ts = 0; ts < 100; ++ts) {
        string P{}, L{};
        in >> P;
        in >> L;
        map<char, int> chars;

        for(auto const& c : P) {
            (chars.find(c) == chars.end()) ? chars[c] = 1 : chars[c]+=1;
        }
        int lenn = L.length();
        int lenp = P.length();
        int counter{};

        for(int i = 0; i < lenn-lenp+1; ++i) {
            map<char, int> tmp;
            bool check{true};
            for(int j = i; j < i+lenp; ++j) {
                (tmp.find(L[j]) == tmp.end()) ? tmp[L[j]] = 1 : tmp[L[j]]+=1;
            }
            for(auto const &i : tmp) {
                if(chars[i.first] != tmp[i.first]) {
                    check = false;
                    break;
                }
            }
            if(check)
                ++counter;
        }
        out << counter << endl;

    }

    out.close();
    in.close();
    return 0;
}