From 3be1cbf027516f26a16630e889974300e970f3f5 Mon Sep 17 00:00:00 2001
From: Santo Cariotti <dcariotti24@gmail.com>
Date: Sun, 19 Apr 2020 10:34:05 +0200
Subject: feat: add coding contest 18/04/2020

---
 I_anno/Programmazione_2/gualtieri.cpp | 46 +++++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 I_anno/Programmazione_2/gualtieri.cpp

(limited to 'I_anno/Programmazione_2')

diff --git a/I_anno/Programmazione_2/gualtieri.cpp b/I_anno/Programmazione_2/gualtieri.cpp
new file mode 100644
index 0000000..f8a0ecf
--- /dev/null
+++ b/I_anno/Programmazione_2/gualtieri.cpp
@@ -0,0 +1,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;
+}
-- 
cgit v1.2.3-18-g5258