summaryrefslogtreecommitdiff
path: root/I_anno/Programmazione_2/gualtieri.cpp
diff options
context:
space:
mode:
authorSanto Cariotti <dcariotti24@gmail.com>2020-05-29 17:37:43 +0200
committerSanto Cariotti <dcariotti24@gmail.com>2020-05-29 17:37:43 +0200
commitc1b13da17b2d20bdb9392f0e390df771772f0020 (patch)
tree20f266a590a4bb36738355f54fd48f4229b58b05 /I_anno/Programmazione_2/gualtieri.cpp
parentbc8b5b446a6a2d37bae82e7ad20e31e1439a2f0b (diff)
chore: order in coding contest folder
Diffstat (limited to 'I_anno/Programmazione_2/gualtieri.cpp')
-rw-r--r--I_anno/Programmazione_2/gualtieri.cpp46
1 files changed, 0 insertions, 46 deletions
diff --git a/I_anno/Programmazione_2/gualtieri.cpp b/I_anno/Programmazione_2/gualtieri.cpp
deleted file mode 100644
index f8a0ecf..0000000
--- a/I_anno/Programmazione_2/gualtieri.cpp
+++ /dev/null
@@ -1,46 +0,0 @@
-#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;
-}