Added all current problems

8 files changed, 85 insertions, 0 deletions

diff --git a/21-04-2022(Div.4)/A b/21-04-2022(Div.4)/A
new file mode 100755
index 0000000..58be759
--- /dev/null
+++ b/21-04-2022(Div.4)/A
diff --git a/21-04-2022(Div.4)/A.cpp b/21-04-2022(Div.4)/A.cpp
new file mode 100644
index 0000000..35c326e
--- /dev/null
+++ b/21-04-2022(Div.4)/A.cpp
@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+  int tt, x;
+  cin >> tt;
+  while(tt--){
+    cin >> x;
+    if(x >= 1900){
+      cout << "Division 1" << '\n';
+    }
+    else if(x >= 1600 && x <= 1899){
+      cout << "Division 2" << '\n';
+    }
+    else if(x >= 1400 && x <= 1599){
+      cout << "Division 3" << '\n';
+    }
+    else{
+      cout << "Division 4" << '\n';
+    }
+  }
+}
diff --git a/21-04-2022(Div.4)/B b/21-04-2022(Div.4)/B
new file mode 100755
index 0000000..6a9b6ab
--- /dev/null
+++ b/21-04-2022(Div.4)/B
diff --git a/21-04-2022(Div.4)/B.cpp b/21-04-2022(Div.4)/B.cpp
new file mode 100644
index 0000000..d1b3e98
--- /dev/null
+++ b/21-04-2022(Div.4)/B.cpp
@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+auto solve(map<int, int> m){
+  for(auto x : m){
+    if(x.second >= 3){
+      return x.first;
+    }
+  }
+  return -1;
+}
+
+int main(){
+  int tt, x, n;
+  cin >> tt;
+  while(tt--){
+    map<int, int> frq;
+    vector<int> v;
+    cin >> n;
+    for(int i = 0; i < n; i++){
+      cin >> x;
+      frq[x]++;
+    }
+    // for(auto &x : frq){
+    //   v.push_back(x.second);
+    // }
+    cout << solve(frq) << endl;
+  }
+}
diff --git a/21-04-2022(Div.4)/E b/21-04-2022(Div.4)/E
new file mode 100755
index 0000000..0e57ed4
--- /dev/null
+++ b/21-04-2022(Div.4)/E
diff --git a/21-04-2022(Div.4)/E.cpp b/21-04-2022(Div.4)/E.cpp
new file mode 100644
index 0000000..7fac1a5
--- /dev/null
+++ b/21-04-2022(Div.4)/E.cpp
@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+  int tt, n, count;
+  cin >> tt;
+  while(tt--){
+    string str;
+    cin >> n;
+    count = 0;
+    vector<string> v(n);
+    for(int i = 0; i < n; i++){
+      cin >> v[i];
+    }
+    for(int i = 0; i < v.size(); i++){
+      for(int j = i+1; j < v.size()-1; j++){
+        if(v[i][0] != v[j][0] || v[i][1] != v[j][1]){
+          count++;
+        }
+      }
+    }
+    cout << count << endl;
+  }
+}
diff --git a/21-04-2022(Div.4)/F b/21-04-2022(Div.4)/F
new file mode 100755
index 0000000..b87fe94
--- /dev/null
+++ b/21-04-2022(Div.4)/F
diff --git a/21-04-2022(Div.4)/F.cpp b/21-04-2022(Div.4)/F.cpp
new file mode 100644
index 0000000..4ab1a8c
--- /dev/null
+++ b/21-04-2022(Div.4)/F.cpp
@@ -0,0 +1,7 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+
+}