13 files changed, 161 insertions, 0 deletions
diff --git a/contests/08-03-2022(Div.3)/.cph/.A_Deletions_of_Two_Adjacent_Letters.cpp_691f772586c92182cd3ca9396098375f.prob b/contests/08-03-2022(Div.3)/.cph/.A_Deletions_of_Two_Adjacent_Letters.cpp_691f772586c92182cd3ca9396098375f.prob
new file mode 100644
index 0000000..52ce51e
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/.cph/.A_Deletions_of_Two_Adjacent_Letters.cpp_691f772586c92182cd3ca9396098375f.prob
@@ -0,0 +1 @@
+{"name":"A. Deletions of Two Adjacent Letters","group":"Codeforces - Codeforces Round #776 (Div. 3)","url":"https://codeforces.com/contest/1650/problem/0","interactive":false,"memoryLimit":256,"timeLimit":2000,"tests":[{"id":1646751197936,"input":"5\nabcde\nc\nabcde\nb\nx\ny\naaaaaaaaaaaaaaa\na\ncontest\nt","output":"YES\nNO\nNO\nYES\nYES"},{"id":1646853307171,"input":"1\nqjjyzcsjy\ns","output":""}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"ADeletionsOfTwoAdjacentLetters"}},"batch":{"id":"b130b25d-3d3d-4fce-9d67-8671131df21f","size":1},"srcPath":"/home/peng/test/Problem_Solving/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters.cpp"}
+\ No newline at end of file
diff --git a/contests/08-03-2022(Div.3)/.cph/.B_DIV_MOD.cpp_276b8c89d227db4a79dee1685b9c289c.prob b/contests/08-03-2022(Div.3)/.cph/.B_DIV_MOD.cpp_276b8c89d227db4a79dee1685b9c289c.prob
new file mode 100644
index 0000000..7eca9cb
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/.cph/.B_DIV_MOD.cpp_276b8c89d227db4a79dee1685b9c289c.prob
@@ -0,0 +1 @@
+{"name":"B. DIV + MOD","group":"Codeforces - Codeforces Round #776 (Div. 3)","url":"https://codeforces.com/contest/1650/problem/B","interactive":false,"memoryLimit":256,"timeLimit":2000,"tests":[{"id":1646752657834,"input":"5\n1 4 3\n5 8 4\n6 10 6\n1 1000000000 1000000000\n10 12 8","output":"2\n4\n5\n999999999\n5"},{"id":1646833131418,"input":"1\n1 100 1","output":"100"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"BDIVMOD"}},"batch":{"id":"18dc3187-28ba-42e4-adb6-b241bf475a66","size":1},"srcPath":"/home/peng/test/Problem_Solving/08-03-2022(Div.3)/B_DIV_MOD.cpp"}
+\ No newline at end of file
diff --git a/contests/08-03-2022(Div.3)/A b/contests/08-03-2022(Div.3)/A
new file mode 100755
index 0000000..a2ce84f
--- /dev/null
+++ 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
new file mode 100644
index 0000000..741b57a
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/A.cpp
@@ -0,0 +1,25 @@
+#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
new file mode 100755
index 0000000..c79eb1d
--- /dev/null
+++ 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
new file mode 100644
index 0000000..3f7daa2
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/A_Deletions_of_Two_Adjacent_Letters.cpp
@@ -0,0 +1,37 @@
+#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
new file mode 100755
index 0000000..b11c838
--- /dev/null
+++ 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
new file mode 100644
index 0000000..dd8bb54
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/B.cpp
@@ -0,0 +1,23 @@
+#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.cpp
new file mode 100644
index 0000000..f861b3b
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/B_DIV_MOD.cpp
@@ -0,0 +1,23 @@
+#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;
+    cin >> tt;
+    while(tt--){
+        int l, r, a;
+        cin >> l >> r >> a;
+        cout << modDiv(r, a) << endl;
+    }
+
+    return 0;
+}
diff --git a/contests/08-03-2022(Div.3)/C.cpp b/contests/08-03-2022(Div.3)/C.cpp
new file mode 100644
index 0000000..f63ebcd
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/C.cpp
@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    int tt;
+    cin >> tt;
+    while(tt--){
+        list<int> ls;
+        int len;
+        int x;
+        cin >> len;
+        for(int i = 0; i < len; i++){
+            cin >> x;
+            ls.push_back(x);
+        }
+        
+
+    }
+
+    return 0;
+}
+\ No newline at end of file
diff --git a/contests/08-03-2022(Div.3)/D.cpp b/contests/08-03-2022(Div.3)/D.cpp
new file mode 100644
index 0000000..0572f03
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/D.cpp
@@ -0,0 +1,20 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int solve()
+{
+
+}
+
+int main(){
+    int tt;
+    cin >> tt;
+    while(tt--){
+
+
+  }
+
+
+    return 0;
+}
diff --git a/contests/08-03-2022(Div.3)/E.cpp b/contests/08-03-2022(Div.3)/E.cpp
new file mode 100644
index 0000000..2601cd5
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/E.cpp
@@ -0,0 +1,9 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    int tt;
+
+    return 0;
+}
+\ No newline at end of file
diff --git a/contests/08-03-2022(Div.3)/tempCodeRunnerFile b/contests/08-03-2022(Div.3)/tempCodeRunnerFile
new file mode 100755
index 0000000..9154686
--- /dev/null
+++ b/contests/08-03-2022(Div.3)/tempCodeRunnerFile