Made that every problem is its own folder to make building the code a smooth operation with a shortcut

10 files changed, 0 insertions, 85 deletions

diff --git a/contests/08-03-2022(Div.3)/A b/contests/08-03-2022(Div.3)/A
index a2ce84f..741b57a 100755..100644
--- a/contests/08-03-2022(Div.3)/A
+++ b/contests/08-03-2022(Div.3)/A
diff --git a/contests/08-03-2022(Div.3)/A.cpp b/contests/08-03-2022(Div.3)/A.cpp
deleted file mode 100644
index 741b57a..0000000
--- a/contests/08-03-2022(Div.3)/A.cpp
+++ /dev/null
@@ -1,25 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-int main(){
-    int tt;
-    cin >> tt;
-    while(tt--){
-        string word;
-        char ch;
-        cin >> word;
-        cin >> ch;
-        int len = word.length();
-        if(word[len/2 + 1] == ch){
-            cout << word[len/2 + 1] << endl;
-            cout << ch << endl;
-            cout << "YES" << "\n";
-        }
-        else{
-            cout << "NO" << "\n";
-        }
-    }
-
-    return 0;
-}
\ No newline at end of file
diff --git a/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters b/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters
index c79eb1d..3f7daa2 100755..100644
--- a/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters
+++ b/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters
diff --git a/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters.cpp b/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters.cpp
deleted file mode 100644
index 3f7daa2..0000000
--- a/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-void findMultOcc(vector<int> &indices, string str, char ch){
-    for(int i = 0; i < str.length();i++){
-        if(str[i] == ch){
-            indices.push_back(i);
-        }
-    }
-}
-
-string solve(vector<int> indices){
-        for(int i = 0; i < indices.size(); i++)
-        {
-            if(indices[i] >= 0 && indices[i] % 2 == 0){
-                return "YES";
-            }
-        }
-        return "NO";
-}
-
-int main(){
-    int tt;
-    cin >> tt;
-    while(tt--){
-        vector<int> indices;
-        string word;
-        char ch;
-        cin >> word;
-        cin >> ch;
-        findMultOcc(indices, word, ch);
-        cout << solve(indices) << '\n';
-    }
-
-    return 0;
-}
diff --git a/contests/08-03-2022(Div.3)/B b/contests/08-03-2022(Div.3)/B
index b11c838..dd8bb54 100755..100644
--- a/contests/08-03-2022(Div.3)/B
+++ b/contests/08-03-2022(Div.3)/B
diff --git a/contests/08-03-2022(Div.3)/B.cpp b/contests/08-03-2022(Div.3)/B.cpp
deleted file mode 100644
index dd8bb54..0000000
--- a/contests/08-03-2022(Div.3)/B.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-#include<bits/stdc++.h>
-
-using namespace std;
-
-int modDiv(int r, int a){
-    // law r % a == 0, return r-1 % a + r-1 /a, else return r % a + r /a;
-    if(r % a == 0){
-        return (r-1) % a + (r-1)/a;
-    }
-    return r % a + r / a;
-}
-
-int main(){
-    int tt;
-    while(tt--){
-        cout << "tt: " << tt;
-        int l, r, a;
-        cin >> l >> r >> a;
-        cout << modDiv(r, a);
-    }
-
-    return 0;
-}
\ No newline at end of file
diff --git a/contests/08-03-2022(Div.3)/B_DIV_MOD.cpp b/contests/08-03-2022(Div.3)/B_DIV_MOD/B_DIV_MOD.cpp
index f861b3b..f861b3b 100644
--- a/contests/08-03-2022(Div.3)/B_DIV_MOD.cpp
+++ b/contests/08-03-2022(Div.3)/B_DIV_MOD/B_DIV_MOD.cpp
diff --git a/contests/08-03-2022(Div.3)/C.cpp b/contests/08-03-2022(Div.3)/C/C.cpp
index f63ebcd..f63ebcd 100644
--- a/contests/08-03-2022(Div.3)/C.cpp
+++ b/contests/08-03-2022(Div.3)/C/C.cpp
diff --git a/contests/08-03-2022(Div.3)/D.cpp b/contests/08-03-2022(Div.3)/D/D.cpp
index 0572f03..0572f03 100644
--- a/contests/08-03-2022(Div.3)/D.cpp
+++ b/contests/08-03-2022(Div.3)/D/D.cpp
diff --git a/contests/08-03-2022(Div.3)/E.cpp b/contests/08-03-2022(Div.3)/E/E.cpp
index 2601cd5..2601cd5 100644
--- a/contests/08-03-2022(Div.3)/E.cpp
+++ b/contests/08-03-2022(Div.3)/E/E.cpp