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

2 files changed, 0 insertions, 48 deletions

diff --git a/contests/05-05-2022(Div.3)/B/B b/contests/05-05-2022(Div.3)/B/B
index af9715e..27c4853 100755..100644
--- a/contests/05-05-2022(Div.3)/B/B
+++ b/contests/05-05-2022(Div.3)/B/B
diff --git a/contests/05-05-2022(Div.3)/B/B.cpp b/contests/05-05-2022(Div.3)/B/B.cpp
deleted file mode 100644
index 27c4853..0000000
--- a/contests/05-05-2022(Div.3)/B/B.cpp
+++ /dev/null
@@ -1,48 +0,0 @@
-#include<bits/stdc++.h> 
-
-using namespace std;
-
-bool isIncreasing(vector<int> v){
-  for(int i = 0; i < v.size() - 1; i++) {
-    if(v[i] >= v[i+1]) {
-      return false;
-    }
-  }
-  return true;
-}
-int getIndex(vector<int> v){
-  int index;
-  for(int i = 0; i < v.size(); i++) {
-    vector<int> v2(i+1);
-    for(int j = 0; j <= i;j++){
-      index = j;
-      v2[j] = v[j];
-    }
-    if(!isIncreasing(v2)) {
-      return index;
-    }
-  }
-  return -1;
-}
-
-int main () {
-  int tt, n;
-  cin >> tt;
-  while(tt--) {
-    cin >> n;
-    vector<int> v(n);
-    for(auto &x : v) {
-      cin >> x;
-    }
-    int idx = getIndex(v);
-    vector<int> rem(v.size() - idx);
-    if(idx == -1) {
-      cout << "0" << endl;
-    } else {
-      for(int i = 0;i < v.size() - idx; i++) {
-        rem[i] = v[idx + i];
-      }
-    }
-  }
-
-}