diff --git a/Codes/1391 B - Fix You/1391B.cpp b/Codes/1391 B - Fix You/1391B.cpp
new file mode 100644
index 0000000..16616d1
--- /dev/null
+++ b/Codes/1391 B - Fix You/1391B.cpp	
@@ -0,0 +1,91 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define int                 long long
+#define ll                  long long
+#define ull                 unsigned long long
+#define endl                '\n'
+#define ff                  first
+#define ss                  second
+#define pb                  push_back
+#define all(x)              x.begin(), x.end()
+#define sz(x)               (int)(x).size()
+
+#define yes                 cout<<"YES"<<endl
+#define no                  cout<<"NO"<<endl
+#define neg1                cout<<-1<<endl
+
+#define PI                  3.141592653589793238
+#define MIN                 INT_MIN
+#define MAX                 INT_MAX
+#define INF                 LONG_LONG_MAX
+#define MOD                 1000000007
+#define LLM                 1000000000000000007
+
+ll factorial(ll n)              { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
+ll nPr(ll n, ll r)              { return factorial(n) / factorial(n - r); }
+ll nCr(ll n, ll r)              { return factorial(n) / (factorial(r) * factorial(n - r));}
+ll gcd(ll a, ll b)              { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b)              { return (a * b) / gcd(a, b);}
+ull mypow(ull a, ull b)         { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
+bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
+
+#ifndef ONLINE_JUDGE
+#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
+#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
+#else
+#define dbg(x)
+#define dbgin(x)
+#endif
+
+void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
+void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
+template <class T, class V> void _print(pair <T, V> p);
+template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
+template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
+template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
+template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
+template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
+template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void solve()
+{
+    int n,m;
+    cin>>n>>m;
+    int ct=0;
+    for(int i=0; i<n; ++i)
+    {
+        string s;
+        cin>>s;
+        if(i+1<n)
+        {
+            if(s[m-1]=='R')
+                ct++;
+        }
+        else
+        {
+            for(int j=0; j<m-1; ++j)
+            {
+                if(s[j]=='D')
+                    ct++;
+            }
+        }
+    }
+    cout<<ct<<endl;
+}
+
+int32_t main()
+{
+    FAST_IO;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) 
+        solve();
+}
\ No newline at end of file
diff --git a/Codes/1890 B - Qingshan Loves Strings/1890B.cpp b/Codes/1890 B - Qingshan Loves Strings/1890B.cpp
new file mode 100644
index 0000000..dbfd79f
--- /dev/null
+++ b/Codes/1890 B - Qingshan Loves Strings/1890B.cpp	
@@ -0,0 +1,93 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define int                 long long
+#define ll                  long long
+#define ull                 unsigned long long
+#define endl                '\n'
+#define ff                  first
+#define ss                  second
+#define pb                  push_back
+#define all(x)              x.begin(), x.end()
+#define sz(x)               (int)(x).size()
+
+#define yes                 cout<<"YES"<<endl
+#define no                  cout<<"NO"<<endl
+#define neg1                cout<<-1<<endl
+
+#define PI                  3.141592653589793238
+#define MIN                 INT_MIN
+#define MAX                 INT_MAX
+#define INF                 LONG_LONG_MAX
+#define MOD                 1000000007
+#define LLM                 1000000000000000007
+
+ll factorial(ll n)              { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
+ll nPr(ll n, ll r)              { return factorial(n) / factorial(n - r); }
+ll nCr(ll n, ll r)              { return factorial(n) / (factorial(r) * factorial(n - r));}
+ll gcd(ll a, ll b)              { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b)              { return (a * b) / gcd(a, b);}
+ull mypow(ull a, ull b)         { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
+bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
+
+#ifndef ONLINE_JUDGE
+#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
+#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
+#else
+#define dbg(x)
+#define dbgin(x)
+#endif
+
+void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
+void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
+template <class T, class V> void _print(pair <T, V> p);
+template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
+template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
+template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
+template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
+template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
+template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void solve()
+{
+    int n,m;
+    string s,t;
+    cin>>n>>m>>s>>t;
+    bool valid = 1;
+    for(int i=1; i<m; ++i)
+    {
+        if(t[i]==t[i-1])
+        {
+            valid=0;
+            break;
+        }
+    }
+    for(int i=1; i<n; ++i)
+    {
+        if(s[i]==s[i-1])
+        {
+            if(s[i-1]==t[0] || s[i]==t[m-1] || !valid)
+            {
+                no;
+                return;
+            }
+        }
+    }
+    yes;
+}
+
+int32_t main()
+{
+    FAST_IO;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) 
+        solve();
+}
\ No newline at end of file
diff --git a/Codes/1891 A - Sorting with Twos/1891A.cpp b/Codes/1891 A - Sorting with Twos/1891A.cpp
new file mode 100644
index 0000000..1834721
--- /dev/null
+++ b/Codes/1891 A - Sorting with Twos/1891A.cpp	
@@ -0,0 +1,82 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define int                 long long
+#define ll                  long long
+#define ull                 unsigned long long
+#define endl                '\n'
+#define ff                  first
+#define ss                  second
+#define pb                  push_back
+#define all(x)              x.begin(), x.end()
+#define sz(x)               (int)(x).size()
+
+#define yes                 cout<<"YES"<<endl
+#define no                  cout<<"NO"<<endl
+#define neg1                cout<<-1<<endl
+
+#define PI                  3.141592653589793238
+#define MIN                 INT_MIN
+#define MAX                 INT_MAX
+#define INF                 LONG_LONG_MAX
+#define MOD                 1000000007
+#define LLM                 1000000000000000007
+
+ll factorial(ll n)              { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
+ll nPr(ll n, ll r)              { return factorial(n) / factorial(n - r); }
+ll nCr(ll n, ll r)              { return factorial(n) / (factorial(r) * factorial(n - r));}
+ll gcd(ll a, ll b)              { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b)              { return (a * b) / gcd(a, b);}
+ull mypow(ull a, ull b)         { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
+bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
+
+#ifndef ONLINE_JUDGE
+#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
+#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
+#else
+#define dbg(x)
+#define dbgin(x)
+#endif
+
+void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
+void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
+template <class T, class V> void _print(pair <T, V> p);
+template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
+template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
+template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
+template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
+template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
+template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
+/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    vector<int>v(n);
+    for(auto &i:v)  cin>>i;
+    for(int i=3; i<n; ++i)
+    {
+        if(v[i]<v[i-1] && (i & (i-1)))
+        {
+            no;
+            return;
+        }
+    }
+    yes;
+}
+
+int32_t main()
+{
+    FAST_IO;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) 
+        solve();
+}
\ No newline at end of file
diff --git a/Readme.md b/Readme.md
index 764f0a0..30e7c9a 100644
--- a/Readme.md
+++ b/Readme.md
@@ -104,173 +104,176 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
 | 92 | 1364 A | XXXXX | [Question](https://codeforces.com/problemset/problem/1364/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1364%20A%20-%20XXXXX)
 | 93 | 1367 B |  Even Array | [Question](https://codeforces.com/problemset/problem/1367/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1367%20B%20-%20%20Even%20Array)
 | 94 | 1389 A | LCM Problem | [Question](https://codeforces.com/problemset/problem/1389/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1389%20A%20-%20LCM%20Problem)
-| 95 | 1399 A | Remove Smallest | [Question](https://codeforces.com/problemset/problem/1399/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1399%20A%20-%20Remove%20Smallest)
-| 96 | 1426 A | Floor Number | [Question](https://codeforces.com/problemset/problem/1426/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1426%20A%20-%20Floor%20Number)
-| 97 | 1512 A | Spy Detected! | [Question](https://codeforces.com/problemset/problem/1512/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1512%20A%20-%20Spy%20Detected!)
-| 98 | 1582 B | Luntik and Subsequences | [Question](https://codeforces.com/problemset/problem/1582/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1582%20B%20-%20Luntik%20and%20Subsequences)
-| 99 | 1624 B | Make AP | [Question](https://codeforces.com/problemset/problem/1624/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1624%20B%20-%20Make%20AP)
-| 100 | 1633 A | Div. 7 | [Question](https://codeforces.com/problemset/problem/1633/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1633%20A%20-%20Div.%207)
-| 101 | 1676 A | Lucky | [Question](https://codeforces.com/problemset/problem/1676/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1676%20A%20-%20Lucky)
-| 102 | 1679 A | AvtoBus | [Question](https://codeforces.com/problemset/problem/1679/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1679%20A%20-%20AvtoBus)
-| 103 | 1692 A | Marathon | [Question](https://codeforces.com/problemset/problem/1692/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1692%20A%20-%20Marathon)
-| 104 | 1696 B | NIT Destroys the Universe | [Question](https://codeforces.com/problemset/problem/1696/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1696%20B%20-%20NIT%20Destroys%20the%20Universe)
-| 105 | 1703 A | YES or YES | [Question](https://codeforces.com/problemset/problem/1703/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1703%20A%20-%20YES%20or%20YES)
-| 106 | 1719 A | Chip Game | [Question](https://codeforces.com/problemset/problem/1719/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1719%20A%20-%20Chip%20Game)
-| 107 | 1719 B | Mathematical Circus | [Question](https://codeforces.com/problemset/problem/1719/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1719%20B%20-%20Mathematical%20Circus)
-| 108 | 1721 B | Deadly Laser | [Question](https://codeforces.com/problemset/problem/1721/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1721%20B%20-%20Deadly%20Laser)
-| 109 | 1726 A | Mainak and Array | [Question](https://codeforces.com/problemset/problem/1726/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1726%20A%20-%20Mainak%20and%20Array)
-| 110 | 1742 A | Sum | [Question](https://codeforces.com/problemset/problem/1742/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1742%20A%20-%20Sum)
-| 111 | 1742 C | Stripes | [Question](https://codeforces.com/problemset/problem/1742/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1742%20C%20-%20Stripes)
-| 112 | 1746 B | Rebellion | [Question](https://codeforces.com/problemset/problem/1746/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1746%20B%20-%20Rebellion)
-| 113 | 1748 A | The Ultimate Square | [Question](https://codeforces.com/problemset/problem/1748/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1748%20A%20-%20The%20Ultimate%20Square)
-| 114 | 1758 B | XOR = Average | [Question](https://codeforces.com/problemset/problem/1758/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1758%20B%20-%20XOR%20=%20Average)
-| 115 | 1760 A | Medium Number | [Question](https://codeforces.com/problemset/problem/1760/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1760%20A%20-%20Medium%20Number)
-| 116 | 1761 A | Two Permutations | [Question](https://codeforces.com/problemset/problem/1761/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1761%20A%20-%20Two%20Permutations)
-| 117 | 1766 A | Extremely Round | [Question](https://codeforces.com/problemset/problem/1766/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1766%20A%20-%20Extremely%20Round)
-| 118 | 1773 F | Football | [Question](https://codeforces.com/problemset/problem/1773/F) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1773%20F%20-%20Football)
-| 119 | 1777 A | Everybody Likes Good Arrays! | [Question](https://codeforces.com/problemset/problem/1777/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1777%20A%20-%20Everybody%20Likes%20Good%20Arrays!)
-| 120 | 1783 A | Make it Beautiful | [Question](https://codeforces.com/problemset/problem/1783/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1783%20A%20-%20Make%20it%20Beautiful)
-| 121 | 1788 A | One and Two | [Question](https://codeforces.com/problemset/problem/1788/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1788%20A%20-%20One%20and%20Two)
-| 122 | 1789 A | Serval and Mocha's Array | [Question](https://codeforces.com/problemset/problem/1789/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1789%20A%20-%20Serval%20and%20Mocha's%20Array)
-| 123 | 1791 B | Following Directions | [Question](https://codeforces.com/problemset/problem/1791/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1791%20B%20-%20Following%20Directions)
-| 124 | 1791 C | Prepend and Append | [Question](https://codeforces.com/problemset/problem/1791/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1791%20C%20-%20Prepend%20and%20Append)
-| 125 | 1792 A | Gaming Forces | [Question](https://codeforces.com/problemset/problem/1792/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1792%20A%20-%20Gaming%20Forces)
-| 126 | 1794 B | Not Dividing | [Question](https://codeforces.com/problemset/problem/1794/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1794%20B%20-%20Not%20Dividing)
-| 127 | 1795 B | Ideal Point | [Question](https://codeforces.com/problemset/problem/1795/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1795%20B%20-%20Ideal%20Point)
-| 128 | 1800 A | Is It a Cat | [Question](https://codeforces.com/problemset/problem/1800/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1800%20A%20-%20Is%20It%20a%20Cat)
-| 129 | 1805 A | We Need the Zero | [Question](https://codeforces.com/problemset/problem/1805/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1805%20A%20-%20We%20Need%20the%20Zero)
-| 130 | 1806 A | Walking Master | [Question](https://codeforces.com/problemset/problem/1806/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1806%20A%20-%20Walking%20Master)
-| 131 | 1807 D | Odd Queries | [Question](https://codeforces.com/problemset/problem/1807/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1807%20D%20-%20Odd%20Queries)
-| 132 | 1811 A | Insert Digit | [Question](https://codeforces.com/problemset/problem/1811/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1811%20A%20-%20Insert%20Digit)
-| 133 | 1814 A | Coins | [Question](https://codeforces.com/problemset/problem/1814/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1814%20A%20-%20Coins)
-| 134 | 1818 B | Indivisible | [Question](https://codeforces.com/problemset/problem/1818/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1818%20B%20-%20Indivisible)
-| 135 | 1822 A | TubeTube Feed | [Question](https://codeforces.com/problemset/problem/1822/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1822%20A%20-%20TubeTube%20Feed)
-| 136 | 1822 C | Bun Lover | [Question](https://codeforces.com/problemset/problem/1822/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1822%20C%20-%20Bun%20Lover)
-| 137 | 1828 A | Divisible Array | [Question](https://codeforces.com/problemset/problem/1828/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1828%20A%20-%20Divisible%20Array)
-| 138 | 1828 B | Permutation Swap | [Question](https://codeforces.com/problemset/problem/1828/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1828%20B%20-%20Permutation%20Swap)
-| 139 | 1829 A | Love Story | [Question](https://codeforces.com/problemset/problem/1829/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20A%20-%20Love%20Story)
-| 140 | 1829 B | Blank Spaces | [Question](https://codeforces.com/problemset/problem/1829/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20B%20-%20Blank%20Spaces)
-| 141 | 1829 C | Mr. Perfectly Fine | [Question](https://codeforces.com/problemset/problem/1829/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20C%20-%20Mr.%20Perfectly%20Fine)
-| 142 | 1829 D | Gold Rush | [Question](https://codeforces.com/problemset/problem/1829/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20D%20-%20Gold%20Rush)
-| 143 | 1831 A | Twin Permutations | [Question](https://codeforces.com/problemset/problem/1831/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1831%20A%20-%20Twin%20Permutations)
-| 144 | 1832 A | New Palindrome | [Question](https://codeforces.com/problemset/problem/1832/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1832%20A%20-%20New%20Palindrome)
-| 145 | 1833 A | Musical Puzzle | [Question](https://codeforces.com/problemset/problem/1833/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1833%20A%20-%20Musical%20Puzzle)
-| 146 | 1833 B | Restore the Weather | [Question](https://codeforces.com/problemset/problem/1833/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1833%20B%20-%20Restore%20the%20Weather)
-| 147 | 1833 C | Vlad Building Beautiful Array | [Question](https://codeforces.com/problemset/problem/1833/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1833%20C%20-%20Vlad%20Building%20Beautiful%20Array)
-| 148 | 1834 A | Unit Array | [Question](https://codeforces.com/problemset/problem/1834/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1834%20A%20-%20Unit%20Array)
-| 149 | 1837 A | Grasshopper on a Line | [Question](https://codeforces.com/problemset/problem/1837/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1837%20A%20-%20Grasshopper%20on%20a%20Line)
-| 150 | 1837 B | Comparison String | [Question](https://codeforces.com/problemset/problem/1837/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1837%20B%20-%20Comparison%20String)
-| 151 | 1841 B | Keep it Beautiful | [Question](https://codeforces.com/problemset/problem/1841/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1841%20B%20-%20Keep%20it%20Beautiful)
-| 152 | 1843 A | Sasha and Array Coloring | [Question](https://codeforces.com/problemset/problem/1843/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1843%20A%20-%20Sasha%20and%20Array%20Coloring)
-| 153 | 1843 B | Long Long | [Question](https://codeforces.com/problemset/problem/1843/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1843%20B%20-%20Long%20Long)
-| 154 | 1844 A | Subtraction Game | [Question](https://codeforces.com/problemset/problem/1844/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1844%20A%20-%20Subtraction%20Game)
-| 155 | 1845 A | Forbidden Integer | [Question](https://codeforces.com/problemset/problem/1845/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1845%20A%20-%20Forbidden%20Integer)
-| 156 | 1846 A | Rudolph and Cut the Rope | [Question](https://codeforces.com/problemset/problem/1846/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1846%20A%20-%20Rudolph%20and%20Cut%20the%20Rope)
-| 157 | 1846 B | Rudolph and Tic-Tac-Toe | [Question](https://codeforces.com/problemset/problem/1846/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1846%20B%20-%20Rudolph%20and%20Tic-Tac-Toe)
-| 158 | 1846 C | Rudolf and the Another Competition | [Question](https://codeforces.com/problemset/problem/1846/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1846%20C%20-%20Rudolf%20and%20the%20Another%20Competition)
-| 159 | 1848 A | Vika and Her Friends | [Question](https://codeforces.com/problemset/problem/1848/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1848%20A%20-%20Vika%20and%20Her%20Friends)
-| 160 | 1849 A | Morning Sandwich | [Question](https://codeforces.com/problemset/problem/1849/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1849%20A%20-%20Morning%20Sandwich)
-| 161 | 1849 B | Monsters | [Question](https://codeforces.com/problemset/problem/1849/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1849%20B%20-%20Monsters)
-| 162 | 1850 A | To My Critics | [Question](https://codeforces.com/problemset/problem/1850/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20A%20-%20To%20My%20Critics)
-| 163 | 1850 B | Ten Words of Wisdom | [Question](https://codeforces.com/problemset/problem/1850/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20B%20-%20Ten%20Words%20of%20Wisdom)
-| 164 | 1850 C | Word on the Paper | [Question](https://codeforces.com/problemset/problem/1850/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20C%20-%20Word%20on%20the%20Paper)
-| 165 | 1850 D | Balanced Round | [Question](https://codeforces.com/problemset/problem/1850/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20D%20-%20Balanced%20Round)
-| 166 | 1851 A | Escalator Conversations | [Question](https://codeforces.com/problemset/problem/1851/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1851%20A%20-%20Escalator%20Conversations)
-| 167 | 1851 B | Parity Sort | [Question](https://codeforces.com/problemset/problem/1851/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1851%20B%20-%20Parity%20Sort)
-| 168 | 1851 C | Tiles Comeback | [Question](https://codeforces.com/problemset/problem/1851/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1851%20C%20-%20Tiles%20Comeback)
-| 169 | 1853 A | Desorting | [Question](https://codeforces.com/problemset/problem/1853/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1853%20A%20-%20Desorting)
-| 170 | 1855 A | Dalton the Teacher | [Question](https://codeforces.com/problemset/problem/1855/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1855%20A%20-%20Dalton%20the%20Teacher)
-| 171 | 1855 B | Longest Divisors Interval | [Question](https://codeforces.com/problemset/problem/1855/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1855%20B%20-%20Longest%20Divisors%20Interval)
-| 172 | 1856 B | Good Arrays | [Question](https://codeforces.com/problemset/problem/1856/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1856%20B%20-%20Good%20Arrays)
-| 173 | 1857 A |  Array Coloring | [Question](https://codeforces.com/problemset/problem/1857/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1857%20A%20-%20%20Array%20Coloring)
-| 174 | 1857 B | Maximum Rounding | [Question](https://codeforces.com/problemset/problem/1857/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1857%20B%20-%20Maximum%20Rounding)
-| 175 | 1857 C | Assembly via Minimums | [Question](https://codeforces.com/problemset/problem/1857/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1857%20C%20-%20Assembly%20via%20Minimums)
-| 176 | 1858 A | Buttons | [Question](https://codeforces.com/problemset/problem/1858/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1858%20A%20-%20Buttons)
-| 177 | 1859 A | United We Stand | [Question](https://codeforces.com/problemset/problem/1859/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1859%20A%20-%20United%20We%20Stand)
-| 178 | 1860 A | Not a Substring | [Question](https://codeforces.com/problemset/problem/1860/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1860%20A%20-%20Not%20a%20Substring)
-| 179 | 1862 A | Gift Carpet | [Question](https://codeforces.com/problemset/problem/1862/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1862%20A%20-%20Gift%20Carpet)
-| 180 | 1862 B | Sequence Game | [Question](https://codeforces.com/problemset/problem/1862/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1862%20B%20-%20Sequence%20Game)
-| 181 | 1863 A | Channel | [Question](https://codeforces.com/problemset/problem/1863/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1863%20A%20-%20Channel)
-| 182 | 1864 A | Increasing and Decreasing | [Question](https://codeforces.com/problemset/problem/1864/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1864%20A%20-%20Increasing%20and%20Decreasing)
-| 183 | 1866 A | Ambitious Kid | [Question](https://codeforces.com/problemset/problem/1866/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1866%20A%20-%20Ambitious%20Kid)
-| 184 | 1869 A | Make It Zero | [Question](https://codeforces.com/problemset/problem/1869/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1869%20A%20-%20Make%20It%20Zero)
-| 185 | 1870 A | MEXanized Array | [Question](https://codeforces.com/problemset/problem/1870/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1870%20A%20-%20MEXanized%20Array)
-| 186 | 1872 A | Two Vessels | [Question](https://codeforces.com/problemset/problem/1872/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1872%20A%20-%20Two%20Vessels)
-| 187 | 1872 B | The Corridor or There and Back Again | [Question](https://codeforces.com/problemset/problem/1872/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1872%20B%20-%20The%20Corridor%20or%20There%20and%20Back%20Again)
-| 188 | 1872 C | Non-coprime Split | [Question](https://codeforces.com/problemset/problem/1872/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1872%20C%20-%20Non-coprime%20Split)
-| 189 | 1873 A | Short Sort | [Question](https://codeforces.com/problemset/problem/1873/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20A%20-%20Short%20Sort)
-| 190 | 1873 B | Good Kid | [Question](https://codeforces.com/problemset/problem/1873/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20B%20-%20Good%20Kid)
-| 191 | 1873 C | Target Practice | [Question](https://codeforces.com/problemset/problem/1873/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20C%20-%20Target%20Practice)
-| 192 | 1873 D | 1D Eraser | [Question](https://codeforces.com/problemset/problem/1873/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20D%20-%201D%20Eraser)
-| 193 | 1875 A | Jellyfish and Undertale | [Question](https://codeforces.com/problemset/problem/1875/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1875%20A%20-%20Jellyfish%20and%20Undertale)
-| 194 | 1877 A | Goals of Victory | [Question](https://codeforces.com/problemset/problem/1877/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1877%20A%20-%20Goals%20of%20Victory)
-| 195 | 1878 A | How Much Does Daytona Cost | [Question](https://codeforces.com/problemset/problem/1878/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1878%20A%20-%20How%20Much%20Does%20Daytona%20Cost)
-| 196 | 1878 B | Aleksa and Stack | [Question](https://codeforces.com/problemset/problem/1878/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1878%20B%20-%20Aleksa%20and%20Stack)
-| 197 | 1878 C | Vasilije in Cacak | [Question](https://codeforces.com/problemset/problem/1878/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1878%20C%20-%20Vasilije%20in%20Cacak)
-| 198 | 1879 A | Rigged! | [Question](https://codeforces.com/problemset/problem/1879/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1879%20A%20-%20Rigged!)
-| 199 | 1879 B | Chips on the Board | [Question](https://codeforces.com/problemset/problem/1879/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1879%20B%20-%20Chips%20on%20the%20Board)
-| 200 | 1881 A | Don't Try to Count | [Question](https://codeforces.com/problemset/problem/1881/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1881%20A%20-%20Don't%20Try%20to%20Count)
-| 201 | 1881 B | Three Threadlets | [Question](https://codeforces.com/problemset/problem/1881/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1881%20B%20-%20Three%20Threadlets)
-| 202 | 1881 C | Perfect Square | [Question](https://codeforces.com/problemset/problem/1881/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1881%20C%20-%20Perfect%20Square)
-| 203 | 1883 B | Chemistry | [Question](https://codeforces.com/problemset/problem/1883/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1883%20B%20-%20Chemistry)
-| 204 | 1890 A | Doremy's Paint 3 | [Question](https://codeforces.com/problemset/problem/1890/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1890%20A%20-%20Doremy's%20Paint%203)
-| 205 | 1894 A | Secret Sport | [Question](https://codeforces.com/problemset/problem/1894/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1894%20A%20-%20Secret%20Sport)
-| 206 | 1895 A | Treasure Chest | [Question](https://codeforces.com/problemset/problem/1895/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1895%20A%20-%20Treasure%20Chest)
-| 207 | 1895 B | Points and Minimum Distance | [Question](https://codeforces.com/problemset/problem/1895/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1895%20B%20-%20Points%20and%20Minimum%20Distance)
-| 208 | 1896 A | Jagged Swaps | [Question](https://codeforces.com/problemset/problem/1896/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1896%20A%20-%20Jagged%20Swaps)
-| 209 | 1896 B | AB Flipping | [Question](https://codeforces.com/problemset/problem/1896/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1896%20B%20-%20AB%20Flipping)
-| 210 | 1898 A | Milica and String | [Question](https://codeforces.com/problemset/problem/1898/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1898%20A%20-%20Milica%20and%20String)
-| 211 | 1899 A | Game with Integers | [Question](https://codeforces.com/problemset/problem/1899/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1899%20A%20-%20Game%20with%20Integers)
-| 212 | 1900 A | Cover in Water | [Question](https://codeforces.com/problemset/problem/1900/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1900%20A%20-%20Cover%20in%20Water)
-| 213 | 1900 B | Laura and Operations | [Question](https://codeforces.com/problemset/problem/1900/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1900%20B%20-%20Laura%20and%20Operations)
-| 214 | 1901 A | Line Trip | [Question](https://codeforces.com/problemset/problem/1901/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1901%20A%20-%20Line%20Trip)
-| 215 | 1902 A | Binary Imbalance | [Question](https://codeforces.com/problemset/problem/1902/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1902%20A%20-%20Binary%20Imbalance)
-| 216 | 1903 A | Halloumi Boxes | [Question](https://codeforces.com/problemset/problem/1903/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1903%20A%20-%20Halloumi%20Boxes)
-| 217 | 1904 A | Forked! | [Question](https://codeforces.com/problemset/problem/1904/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1904%20A%20-%20Forked!)
-| 218 | 1904 B | Collecting Game | [Question](https://codeforces.com/problemset/problem/1904/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1904%20B%20-%20Collecting%20Game)
-| 219 | 1905 A | Constructive Problems | [Question](https://codeforces.com/problemset/problem/1905/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1905%20A%20-%20Constructive%20Problems)
-| 220 | 1905 B | Begginer's Zelda | [Question](https://codeforces.com/problemset/problem/1905/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1905%20B%20-%20Begginer's%20Zelda)
-| 221 | 1905 C | Largest Subsequence | [Question](https://codeforces.com/problemset/problem/1905/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1905%20C%20-%20Largest%20Subsequence)
-| 222 | 1907 A | Rook | [Question](https://codeforces.com/problemset/problem/1907/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907%20A%20-%20Rook)
-| 223 | 1907 B | YetnotherrokenKeoard | [Question](https://codeforces.com/problemset/problem/1907/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907%20B%20-%20YetnotherrokenKeoard)
-| 224 | 1907 C | Removal of Unattractive Pairs | [Question](https://codeforces.com/problemset/problem/1907/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907%20C%20-%20Removal%20of%20Unattractive%20Pairs)
-| 225 | 1909 A | Distinct Buttons | [Question](https://codeforces.com/problemset/problem/1909/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1909%20A%20-%20Distinct%20Buttons)
-| 226 | 1912 L | LOL Lovers | [Question](https://codeforces.com/problemset/problem/1912/L) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1912%20L%20-%20LOL%20Lovers)
-| 227 | 1913 A | Rating Increase | [Question](https://codeforces.com/problemset/problem/1913/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1913%20A%20-%20Rating%20Increase)
-| 228 | 1913 B | Swap and Delete | [Question](https://codeforces.com/problemset/problem/1913/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1913%20B%20-%20Swap%20and%20Delete)
-| 229 | 1913 C | Game with Multiset | [Question](https://codeforces.com/problemset/problem/1913/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1913%20C%20-%20Game%20with%20Multiset)
-| 230 | 1914 A | Problemsolving Log | [Question](https://codeforces.com/problemset/problem/1914/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20A%20-%20Problemsolving%20Log)
-| 231 | 1914 B | Preparing for the Contest | [Question](https://codeforces.com/problemset/problem/1914/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20B%20-%20Preparing%20for%20the%20Contest)
-| 232 | 1914 C | Quests | [Question](https://codeforces.com/problemset/problem/1914/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20C%20-%20Quests)
-| 233 | 1914 D | Three Activities | [Question](https://codeforces.com/problemset/problem/1914/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20D%20-%20Three%20Activities)
-| 234 | 1914 E1 | Game with Marbles (Easy Version) | [Question](https://codeforces.com/problemset/problem/1914/E1) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20E1%20-%20Game%20with%20Marbles%20(Easy%20Version))
-| 235 | 1914 E2 | Game with Marbles (Hard Version) | [Question](https://codeforces.com/problemset/problem/1914/E2) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20E2%20-%20Game%20with%20Marbles%20(Hard%20Version))
-| 236 | 1915 A | Odd One Out | [Question](https://codeforces.com/problemset/problem/1915/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20A%20-%20Odd%20One%20Out)
-| 237 | 1915 B | Not Quite Latin Square | [Question](https://codeforces.com/problemset/problem/1915/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20B%20-%20Not%20Quite%20Latin%20Square)
-| 238 | 1915 C | Can I Square | [Question](https://codeforces.com/problemset/problem/1915/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20C%20-%20Can%20I%20Square)
-| 239 | 1915 D | Unnatural Language Processing | [Question](https://codeforces.com/problemset/problem/1915/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20D%20-%20Unnatural%20Language%20Processing)
-| 240 | 1915 E | Romantic Glasses | [Question](https://codeforces.com/problemset/problem/1915/E) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20E%20-%20Romantic%20Glasses)
-| 241 | 1916 A | 2023 | [Question](https://codeforces.com/problemset/problem/1916/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20A%20-%202023)
-| 242 | 1916 B | Two Divisors | [Question](https://codeforces.com/problemset/problem/1916/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20B%20-%20Two%20Divisors)
-| 243 | 1916 C | Training Before the Olympiad | [Question](https://codeforces.com/problemset/problem/1916/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20C%20-%20Training%20Before%20the%20Olympiad)
-| 244 | 1916 D | Mathematical Problem | [Question](https://codeforces.com/problemset/problem/1916/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20D%20-%20Mathematical%20Problem)
-| 245 | 1917 A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20A%20-%20Least%20Product)
-| 246 | 1917 B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20B%20-%20Erase%20First%20or%20Second%20Letter)
-| 247 | 1918 A | Brick Wall | [Question](https://codeforces.com/problemset/problem/1918/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1918%20A%20-%20Brick%20Wall)
-| 248 | 1918 B | Minimize Inversions | [Question](https://codeforces.com/problemset/problem/1918/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1918%20B%20-%20Minimize%20Inversions)
-| 249 | 1919 A | Wallet Exchange | [Question](https://codeforces.com/problemset/problem/1919/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1919%20A%20-%20Wallet%20Exchange)
-| 250 | 1919 B | Plus-Minus Split | [Question](https://codeforces.com/problemset/problem/1919/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1919%20B%20-%20Plus-Minus%20Split)
-| 251 | 1920 A | Satisfying Constraints | [Question](https://codeforces.com/problemset/problem/1920/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1920%20A%20-%20Satisfying%20Constraints)
-| 252 | 1920 B | Summation Game | [Question](https://codeforces.com/problemset/problem/1920/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1920%20B%20-%20Summation%20Game)
-| 253 | 1921 A | Square | [Question](https://codeforces.com/problemset/problem/1921/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20A%20-%20Square)
-| 254 | 1921 B | Arranging Cats | [Question](https://codeforces.com/problemset/problem/1921/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20B%20-%20Arranging%20Cats)
-| 255 | 1921 C | Sending Messages | [Question](https://codeforces.com/problemset/problem/1921/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20C%20-%20Sending%20Messages)
-| 256 | 1921 D | Very Different Array | [Question](https://codeforces.com/problemset/problem/1921/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20D%20-%20Very%20Different%20Array)
-| 257 | 1927 A | Make it White | [Question](https://codeforces.com/problemset/problem/1927/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20A%20-%20Make%20it%20White)
-| 258 | 1927 B | Following the String | [Question](https://codeforces.com/problemset/problem/1927/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20B%20-%20Following%20the%20String)
-| 259 | 1927 C | Choose the Different Ones | [Question](https://codeforces.com/problemset/problem/1927/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20C%20-%20Choose%20the%20Different%20Ones)
-| 260 | 1927 D | Find the Different Ones! | [Question](https://codeforces.com/problemset/problem/1927/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20D%20-%20Find%20the%20Different%20Ones!)
-| 261 | 1927 E | Klever Permutation | [Question](https://codeforces.com/problemset/problem/1927/E) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20E%20-%20Klever%20Permutation)
+| 95 | 1391 B | Fix You | [Question](https://codeforces.com/problemset/problem/1391/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1391%20B%20-%20Fix%20You)
+| 96 | 1399 A | Remove Smallest | [Question](https://codeforces.com/problemset/problem/1399/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1399%20A%20-%20Remove%20Smallest)
+| 97 | 1426 A | Floor Number | [Question](https://codeforces.com/problemset/problem/1426/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1426%20A%20-%20Floor%20Number)
+| 98 | 1512 A | Spy Detected! | [Question](https://codeforces.com/problemset/problem/1512/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1512%20A%20-%20Spy%20Detected!)
+| 99 | 1582 B | Luntik and Subsequences | [Question](https://codeforces.com/problemset/problem/1582/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1582%20B%20-%20Luntik%20and%20Subsequences)
+| 100 | 1624 B | Make AP | [Question](https://codeforces.com/problemset/problem/1624/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1624%20B%20-%20Make%20AP)
+| 101 | 1633 A | Div. 7 | [Question](https://codeforces.com/problemset/problem/1633/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1633%20A%20-%20Div.%207)
+| 102 | 1676 A | Lucky | [Question](https://codeforces.com/problemset/problem/1676/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1676%20A%20-%20Lucky)
+| 103 | 1679 A | AvtoBus | [Question](https://codeforces.com/problemset/problem/1679/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1679%20A%20-%20AvtoBus)
+| 104 | 1692 A | Marathon | [Question](https://codeforces.com/problemset/problem/1692/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1692%20A%20-%20Marathon)
+| 105 | 1696 B | NIT Destroys the Universe | [Question](https://codeforces.com/problemset/problem/1696/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1696%20B%20-%20NIT%20Destroys%20the%20Universe)
+| 106 | 1703 A | YES or YES | [Question](https://codeforces.com/problemset/problem/1703/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1703%20A%20-%20YES%20or%20YES)
+| 107 | 1719 A | Chip Game | [Question](https://codeforces.com/problemset/problem/1719/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1719%20A%20-%20Chip%20Game)
+| 108 | 1719 B | Mathematical Circus | [Question](https://codeforces.com/problemset/problem/1719/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1719%20B%20-%20Mathematical%20Circus)
+| 109 | 1721 B | Deadly Laser | [Question](https://codeforces.com/problemset/problem/1721/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1721%20B%20-%20Deadly%20Laser)
+| 110 | 1726 A | Mainak and Array | [Question](https://codeforces.com/problemset/problem/1726/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1726%20A%20-%20Mainak%20and%20Array)
+| 111 | 1742 A | Sum | [Question](https://codeforces.com/problemset/problem/1742/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1742%20A%20-%20Sum)
+| 112 | 1742 C | Stripes | [Question](https://codeforces.com/problemset/problem/1742/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1742%20C%20-%20Stripes)
+| 113 | 1746 B | Rebellion | [Question](https://codeforces.com/problemset/problem/1746/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1746%20B%20-%20Rebellion)
+| 114 | 1748 A | The Ultimate Square | [Question](https://codeforces.com/problemset/problem/1748/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1748%20A%20-%20The%20Ultimate%20Square)
+| 115 | 1758 B | XOR = Average | [Question](https://codeforces.com/problemset/problem/1758/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1758%20B%20-%20XOR%20=%20Average)
+| 116 | 1760 A | Medium Number | [Question](https://codeforces.com/problemset/problem/1760/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1760%20A%20-%20Medium%20Number)
+| 117 | 1761 A | Two Permutations | [Question](https://codeforces.com/problemset/problem/1761/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1761%20A%20-%20Two%20Permutations)
+| 118 | 1766 A | Extremely Round | [Question](https://codeforces.com/problemset/problem/1766/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1766%20A%20-%20Extremely%20Round)
+| 119 | 1773 F | Football | [Question](https://codeforces.com/problemset/problem/1773/F) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1773%20F%20-%20Football)
+| 120 | 1777 A | Everybody Likes Good Arrays! | [Question](https://codeforces.com/problemset/problem/1777/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1777%20A%20-%20Everybody%20Likes%20Good%20Arrays!)
+| 121 | 1783 A | Make it Beautiful | [Question](https://codeforces.com/problemset/problem/1783/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1783%20A%20-%20Make%20it%20Beautiful)
+| 122 | 1788 A | One and Two | [Question](https://codeforces.com/problemset/problem/1788/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1788%20A%20-%20One%20and%20Two)
+| 123 | 1789 A | Serval and Mocha's Array | [Question](https://codeforces.com/problemset/problem/1789/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1789%20A%20-%20Serval%20and%20Mocha's%20Array)
+| 124 | 1791 B | Following Directions | [Question](https://codeforces.com/problemset/problem/1791/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1791%20B%20-%20Following%20Directions)
+| 125 | 1791 C | Prepend and Append | [Question](https://codeforces.com/problemset/problem/1791/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1791%20C%20-%20Prepend%20and%20Append)
+| 126 | 1792 A | Gaming Forces | [Question](https://codeforces.com/problemset/problem/1792/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1792%20A%20-%20Gaming%20Forces)
+| 127 | 1794 B | Not Dividing | [Question](https://codeforces.com/problemset/problem/1794/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1794%20B%20-%20Not%20Dividing)
+| 128 | 1795 B | Ideal Point | [Question](https://codeforces.com/problemset/problem/1795/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1795%20B%20-%20Ideal%20Point)
+| 129 | 1800 A | Is It a Cat | [Question](https://codeforces.com/problemset/problem/1800/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1800%20A%20-%20Is%20It%20a%20Cat)
+| 130 | 1805 A | We Need the Zero | [Question](https://codeforces.com/problemset/problem/1805/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1805%20A%20-%20We%20Need%20the%20Zero)
+| 131 | 1806 A | Walking Master | [Question](https://codeforces.com/problemset/problem/1806/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1806%20A%20-%20Walking%20Master)
+| 132 | 1807 D | Odd Queries | [Question](https://codeforces.com/problemset/problem/1807/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1807%20D%20-%20Odd%20Queries)
+| 133 | 1811 A | Insert Digit | [Question](https://codeforces.com/problemset/problem/1811/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1811%20A%20-%20Insert%20Digit)
+| 134 | 1814 A | Coins | [Question](https://codeforces.com/problemset/problem/1814/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1814%20A%20-%20Coins)
+| 135 | 1818 B | Indivisible | [Question](https://codeforces.com/problemset/problem/1818/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1818%20B%20-%20Indivisible)
+| 136 | 1822 A | TubeTube Feed | [Question](https://codeforces.com/problemset/problem/1822/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1822%20A%20-%20TubeTube%20Feed)
+| 137 | 1822 C | Bun Lover | [Question](https://codeforces.com/problemset/problem/1822/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1822%20C%20-%20Bun%20Lover)
+| 138 | 1828 A | Divisible Array | [Question](https://codeforces.com/problemset/problem/1828/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1828%20A%20-%20Divisible%20Array)
+| 139 | 1828 B | Permutation Swap | [Question](https://codeforces.com/problemset/problem/1828/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1828%20B%20-%20Permutation%20Swap)
+| 140 | 1829 A | Love Story | [Question](https://codeforces.com/problemset/problem/1829/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20A%20-%20Love%20Story)
+| 141 | 1829 B | Blank Spaces | [Question](https://codeforces.com/problemset/problem/1829/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20B%20-%20Blank%20Spaces)
+| 142 | 1829 C | Mr. Perfectly Fine | [Question](https://codeforces.com/problemset/problem/1829/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20C%20-%20Mr.%20Perfectly%20Fine)
+| 143 | 1829 D | Gold Rush | [Question](https://codeforces.com/problemset/problem/1829/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1829%20D%20-%20Gold%20Rush)
+| 144 | 1831 A | Twin Permutations | [Question](https://codeforces.com/problemset/problem/1831/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1831%20A%20-%20Twin%20Permutations)
+| 145 | 1832 A | New Palindrome | [Question](https://codeforces.com/problemset/problem/1832/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1832%20A%20-%20New%20Palindrome)
+| 146 | 1833 A | Musical Puzzle | [Question](https://codeforces.com/problemset/problem/1833/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1833%20A%20-%20Musical%20Puzzle)
+| 147 | 1833 B | Restore the Weather | [Question](https://codeforces.com/problemset/problem/1833/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1833%20B%20-%20Restore%20the%20Weather)
+| 148 | 1833 C | Vlad Building Beautiful Array | [Question](https://codeforces.com/problemset/problem/1833/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1833%20C%20-%20Vlad%20Building%20Beautiful%20Array)
+| 149 | 1834 A | Unit Array | [Question](https://codeforces.com/problemset/problem/1834/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1834%20A%20-%20Unit%20Array)
+| 150 | 1837 A | Grasshopper on a Line | [Question](https://codeforces.com/problemset/problem/1837/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1837%20A%20-%20Grasshopper%20on%20a%20Line)
+| 151 | 1837 B | Comparison String | [Question](https://codeforces.com/problemset/problem/1837/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1837%20B%20-%20Comparison%20String)
+| 152 | 1841 B | Keep it Beautiful | [Question](https://codeforces.com/problemset/problem/1841/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1841%20B%20-%20Keep%20it%20Beautiful)
+| 153 | 1843 A | Sasha and Array Coloring | [Question](https://codeforces.com/problemset/problem/1843/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1843%20A%20-%20Sasha%20and%20Array%20Coloring)
+| 154 | 1843 B | Long Long | [Question](https://codeforces.com/problemset/problem/1843/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1843%20B%20-%20Long%20Long)
+| 155 | 1844 A | Subtraction Game | [Question](https://codeforces.com/problemset/problem/1844/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1844%20A%20-%20Subtraction%20Game)
+| 156 | 1845 A | Forbidden Integer | [Question](https://codeforces.com/problemset/problem/1845/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1845%20A%20-%20Forbidden%20Integer)
+| 157 | 1846 A | Rudolph and Cut the Rope | [Question](https://codeforces.com/problemset/problem/1846/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1846%20A%20-%20Rudolph%20and%20Cut%20the%20Rope)
+| 158 | 1846 B | Rudolph and Tic-Tac-Toe | [Question](https://codeforces.com/problemset/problem/1846/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1846%20B%20-%20Rudolph%20and%20Tic-Tac-Toe)
+| 159 | 1846 C | Rudolf and the Another Competition | [Question](https://codeforces.com/problemset/problem/1846/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1846%20C%20-%20Rudolf%20and%20the%20Another%20Competition)
+| 160 | 1848 A | Vika and Her Friends | [Question](https://codeforces.com/problemset/problem/1848/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1848%20A%20-%20Vika%20and%20Her%20Friends)
+| 161 | 1849 A | Morning Sandwich | [Question](https://codeforces.com/problemset/problem/1849/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1849%20A%20-%20Morning%20Sandwich)
+| 162 | 1849 B | Monsters | [Question](https://codeforces.com/problemset/problem/1849/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1849%20B%20-%20Monsters)
+| 163 | 1850 A | To My Critics | [Question](https://codeforces.com/problemset/problem/1850/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20A%20-%20To%20My%20Critics)
+| 164 | 1850 B | Ten Words of Wisdom | [Question](https://codeforces.com/problemset/problem/1850/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20B%20-%20Ten%20Words%20of%20Wisdom)
+| 165 | 1850 C | Word on the Paper | [Question](https://codeforces.com/problemset/problem/1850/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20C%20-%20Word%20on%20the%20Paper)
+| 166 | 1850 D | Balanced Round | [Question](https://codeforces.com/problemset/problem/1850/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1850%20D%20-%20Balanced%20Round)
+| 167 | 1851 A | Escalator Conversations | [Question](https://codeforces.com/problemset/problem/1851/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1851%20A%20-%20Escalator%20Conversations)
+| 168 | 1851 B | Parity Sort | [Question](https://codeforces.com/problemset/problem/1851/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1851%20B%20-%20Parity%20Sort)
+| 169 | 1851 C | Tiles Comeback | [Question](https://codeforces.com/problemset/problem/1851/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1851%20C%20-%20Tiles%20Comeback)
+| 170 | 1853 A | Desorting | [Question](https://codeforces.com/problemset/problem/1853/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1853%20A%20-%20Desorting)
+| 171 | 1855 A | Dalton the Teacher | [Question](https://codeforces.com/problemset/problem/1855/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1855%20A%20-%20Dalton%20the%20Teacher)
+| 172 | 1855 B | Longest Divisors Interval | [Question](https://codeforces.com/problemset/problem/1855/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1855%20B%20-%20Longest%20Divisors%20Interval)
+| 173 | 1856 B | Good Arrays | [Question](https://codeforces.com/problemset/problem/1856/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1856%20B%20-%20Good%20Arrays)
+| 174 | 1857 A |  Array Coloring | [Question](https://codeforces.com/problemset/problem/1857/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1857%20A%20-%20%20Array%20Coloring)
+| 175 | 1857 B | Maximum Rounding | [Question](https://codeforces.com/problemset/problem/1857/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1857%20B%20-%20Maximum%20Rounding)
+| 176 | 1857 C | Assembly via Minimums | [Question](https://codeforces.com/problemset/problem/1857/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1857%20C%20-%20Assembly%20via%20Minimums)
+| 177 | 1858 A | Buttons | [Question](https://codeforces.com/problemset/problem/1858/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1858%20A%20-%20Buttons)
+| 178 | 1859 A | United We Stand | [Question](https://codeforces.com/problemset/problem/1859/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1859%20A%20-%20United%20We%20Stand)
+| 179 | 1860 A | Not a Substring | [Question](https://codeforces.com/problemset/problem/1860/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1860%20A%20-%20Not%20a%20Substring)
+| 180 | 1862 A | Gift Carpet | [Question](https://codeforces.com/problemset/problem/1862/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1862%20A%20-%20Gift%20Carpet)
+| 181 | 1862 B | Sequence Game | [Question](https://codeforces.com/problemset/problem/1862/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1862%20B%20-%20Sequence%20Game)
+| 182 | 1863 A | Channel | [Question](https://codeforces.com/problemset/problem/1863/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1863%20A%20-%20Channel)
+| 183 | 1864 A | Increasing and Decreasing | [Question](https://codeforces.com/problemset/problem/1864/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1864%20A%20-%20Increasing%20and%20Decreasing)
+| 184 | 1866 A | Ambitious Kid | [Question](https://codeforces.com/problemset/problem/1866/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1866%20A%20-%20Ambitious%20Kid)
+| 185 | 1869 A | Make It Zero | [Question](https://codeforces.com/problemset/problem/1869/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1869%20A%20-%20Make%20It%20Zero)
+| 186 | 1870 A | MEXanized Array | [Question](https://codeforces.com/problemset/problem/1870/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1870%20A%20-%20MEXanized%20Array)
+| 187 | 1872 A | Two Vessels | [Question](https://codeforces.com/problemset/problem/1872/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1872%20A%20-%20Two%20Vessels)
+| 188 | 1872 B | The Corridor or There and Back Again | [Question](https://codeforces.com/problemset/problem/1872/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1872%20B%20-%20The%20Corridor%20or%20There%20and%20Back%20Again)
+| 189 | 1872 C | Non-coprime Split | [Question](https://codeforces.com/problemset/problem/1872/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1872%20C%20-%20Non-coprime%20Split)
+| 190 | 1873 A | Short Sort | [Question](https://codeforces.com/problemset/problem/1873/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20A%20-%20Short%20Sort)
+| 191 | 1873 B | Good Kid | [Question](https://codeforces.com/problemset/problem/1873/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20B%20-%20Good%20Kid)
+| 192 | 1873 C | Target Practice | [Question](https://codeforces.com/problemset/problem/1873/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20C%20-%20Target%20Practice)
+| 193 | 1873 D | 1D Eraser | [Question](https://codeforces.com/problemset/problem/1873/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1873%20D%20-%201D%20Eraser)
+| 194 | 1875 A | Jellyfish and Undertale | [Question](https://codeforces.com/problemset/problem/1875/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1875%20A%20-%20Jellyfish%20and%20Undertale)
+| 195 | 1877 A | Goals of Victory | [Question](https://codeforces.com/problemset/problem/1877/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1877%20A%20-%20Goals%20of%20Victory)
+| 196 | 1878 A | How Much Does Daytona Cost | [Question](https://codeforces.com/problemset/problem/1878/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1878%20A%20-%20How%20Much%20Does%20Daytona%20Cost)
+| 197 | 1878 B | Aleksa and Stack | [Question](https://codeforces.com/problemset/problem/1878/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1878%20B%20-%20Aleksa%20and%20Stack)
+| 198 | 1878 C | Vasilije in Cacak | [Question](https://codeforces.com/problemset/problem/1878/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1878%20C%20-%20Vasilije%20in%20Cacak)
+| 199 | 1879 A | Rigged! | [Question](https://codeforces.com/problemset/problem/1879/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1879%20A%20-%20Rigged!)
+| 200 | 1879 B | Chips on the Board | [Question](https://codeforces.com/problemset/problem/1879/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1879%20B%20-%20Chips%20on%20the%20Board)
+| 201 | 1881 A | Don't Try to Count | [Question](https://codeforces.com/problemset/problem/1881/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1881%20A%20-%20Don't%20Try%20to%20Count)
+| 202 | 1881 B | Three Threadlets | [Question](https://codeforces.com/problemset/problem/1881/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1881%20B%20-%20Three%20Threadlets)
+| 203 | 1881 C | Perfect Square | [Question](https://codeforces.com/problemset/problem/1881/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1881%20C%20-%20Perfect%20Square)
+| 204 | 1883 B | Chemistry | [Question](https://codeforces.com/problemset/problem/1883/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1883%20B%20-%20Chemistry)
+| 205 | 1890 A | Doremy's Paint 3 | [Question](https://codeforces.com/problemset/problem/1890/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1890%20A%20-%20Doremy's%20Paint%203)
+| 206 | 1890 B | Qingshan Loves Strings | [Question](https://codeforces.com/problemset/problem/1890/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1890%20B%20-%20Qingshan%20Loves%20Strings)
+| 207 | 1891 A | Sorting with Twos | [Question](https://codeforces.com/problemset/problem/1891/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1891%20A%20-%20Sorting%20with%20Twos)
+| 208 | 1894 A | Secret Sport | [Question](https://codeforces.com/problemset/problem/1894/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1894%20A%20-%20Secret%20Sport)
+| 209 | 1895 A | Treasure Chest | [Question](https://codeforces.com/problemset/problem/1895/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1895%20A%20-%20Treasure%20Chest)
+| 210 | 1895 B | Points and Minimum Distance | [Question](https://codeforces.com/problemset/problem/1895/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1895%20B%20-%20Points%20and%20Minimum%20Distance)
+| 211 | 1896 A | Jagged Swaps | [Question](https://codeforces.com/problemset/problem/1896/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1896%20A%20-%20Jagged%20Swaps)
+| 212 | 1896 B | AB Flipping | [Question](https://codeforces.com/problemset/problem/1896/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1896%20B%20-%20AB%20Flipping)
+| 213 | 1898 A | Milica and String | [Question](https://codeforces.com/problemset/problem/1898/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1898%20A%20-%20Milica%20and%20String)
+| 214 | 1899 A | Game with Integers | [Question](https://codeforces.com/problemset/problem/1899/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1899%20A%20-%20Game%20with%20Integers)
+| 215 | 1900 A | Cover in Water | [Question](https://codeforces.com/problemset/problem/1900/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1900%20A%20-%20Cover%20in%20Water)
+| 216 | 1900 B | Laura and Operations | [Question](https://codeforces.com/problemset/problem/1900/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1900%20B%20-%20Laura%20and%20Operations)
+| 217 | 1901 A | Line Trip | [Question](https://codeforces.com/problemset/problem/1901/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1901%20A%20-%20Line%20Trip)
+| 218 | 1902 A | Binary Imbalance | [Question](https://codeforces.com/problemset/problem/1902/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1902%20A%20-%20Binary%20Imbalance)
+| 219 | 1903 A | Halloumi Boxes | [Question](https://codeforces.com/problemset/problem/1903/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1903%20A%20-%20Halloumi%20Boxes)
+| 220 | 1904 A | Forked! | [Question](https://codeforces.com/problemset/problem/1904/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1904%20A%20-%20Forked!)
+| 221 | 1904 B | Collecting Game | [Question](https://codeforces.com/problemset/problem/1904/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1904%20B%20-%20Collecting%20Game)
+| 222 | 1905 A | Constructive Problems | [Question](https://codeforces.com/problemset/problem/1905/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1905%20A%20-%20Constructive%20Problems)
+| 223 | 1905 B | Begginer's Zelda | [Question](https://codeforces.com/problemset/problem/1905/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1905%20B%20-%20Begginer's%20Zelda)
+| 224 | 1905 C | Largest Subsequence | [Question](https://codeforces.com/problemset/problem/1905/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1905%20C%20-%20Largest%20Subsequence)
+| 225 | 1907 A | Rook | [Question](https://codeforces.com/problemset/problem/1907/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907%20A%20-%20Rook)
+| 226 | 1907 B | YetnotherrokenKeoard | [Question](https://codeforces.com/problemset/problem/1907/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907%20B%20-%20YetnotherrokenKeoard)
+| 227 | 1907 C | Removal of Unattractive Pairs | [Question](https://codeforces.com/problemset/problem/1907/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1907%20C%20-%20Removal%20of%20Unattractive%20Pairs)
+| 228 | 1909 A | Distinct Buttons | [Question](https://codeforces.com/problemset/problem/1909/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1909%20A%20-%20Distinct%20Buttons)
+| 229 | 1912 L | LOL Lovers | [Question](https://codeforces.com/problemset/problem/1912/L) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1912%20L%20-%20LOL%20Lovers)
+| 230 | 1913 A | Rating Increase | [Question](https://codeforces.com/problemset/problem/1913/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1913%20A%20-%20Rating%20Increase)
+| 231 | 1913 B | Swap and Delete | [Question](https://codeforces.com/problemset/problem/1913/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1913%20B%20-%20Swap%20and%20Delete)
+| 232 | 1913 C | Game with Multiset | [Question](https://codeforces.com/problemset/problem/1913/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1913%20C%20-%20Game%20with%20Multiset)
+| 233 | 1914 A | Problemsolving Log | [Question](https://codeforces.com/problemset/problem/1914/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20A%20-%20Problemsolving%20Log)
+| 234 | 1914 B | Preparing for the Contest | [Question](https://codeforces.com/problemset/problem/1914/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20B%20-%20Preparing%20for%20the%20Contest)
+| 235 | 1914 C | Quests | [Question](https://codeforces.com/problemset/problem/1914/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20C%20-%20Quests)
+| 236 | 1914 D | Three Activities | [Question](https://codeforces.com/problemset/problem/1914/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20D%20-%20Three%20Activities)
+| 237 | 1914 E1 | Game with Marbles (Easy Version) | [Question](https://codeforces.com/problemset/problem/1914/E1) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20E1%20-%20Game%20with%20Marbles%20(Easy%20Version))
+| 238 | 1914 E2 | Game with Marbles (Hard Version) | [Question](https://codeforces.com/problemset/problem/1914/E2) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1914%20E2%20-%20Game%20with%20Marbles%20(Hard%20Version))
+| 239 | 1915 A | Odd One Out | [Question](https://codeforces.com/problemset/problem/1915/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20A%20-%20Odd%20One%20Out)
+| 240 | 1915 B | Not Quite Latin Square | [Question](https://codeforces.com/problemset/problem/1915/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20B%20-%20Not%20Quite%20Latin%20Square)
+| 241 | 1915 C | Can I Square | [Question](https://codeforces.com/problemset/problem/1915/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20C%20-%20Can%20I%20Square)
+| 242 | 1915 D | Unnatural Language Processing | [Question](https://codeforces.com/problemset/problem/1915/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20D%20-%20Unnatural%20Language%20Processing)
+| 243 | 1915 E | Romantic Glasses | [Question](https://codeforces.com/problemset/problem/1915/E) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1915%20E%20-%20Romantic%20Glasses)
+| 244 | 1916 A | 2023 | [Question](https://codeforces.com/problemset/problem/1916/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20A%20-%202023)
+| 245 | 1916 B | Two Divisors | [Question](https://codeforces.com/problemset/problem/1916/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20B%20-%20Two%20Divisors)
+| 246 | 1916 C | Training Before the Olympiad | [Question](https://codeforces.com/problemset/problem/1916/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20C%20-%20Training%20Before%20the%20Olympiad)
+| 247 | 1916 D | Mathematical Problem | [Question](https://codeforces.com/problemset/problem/1916/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1916%20D%20-%20Mathematical%20Problem)
+| 248 | 1917 A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20A%20-%20Least%20Product)
+| 249 | 1917 B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1917%20B%20-%20Erase%20First%20or%20Second%20Letter)
+| 250 | 1918 A | Brick Wall | [Question](https://codeforces.com/problemset/problem/1918/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1918%20A%20-%20Brick%20Wall)
+| 251 | 1918 B | Minimize Inversions | [Question](https://codeforces.com/problemset/problem/1918/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1918%20B%20-%20Minimize%20Inversions)
+| 252 | 1919 A | Wallet Exchange | [Question](https://codeforces.com/problemset/problem/1919/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1919%20A%20-%20Wallet%20Exchange)
+| 253 | 1919 B | Plus-Minus Split | [Question](https://codeforces.com/problemset/problem/1919/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1919%20B%20-%20Plus-Minus%20Split)
+| 254 | 1920 A | Satisfying Constraints | [Question](https://codeforces.com/problemset/problem/1920/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1920%20A%20-%20Satisfying%20Constraints)
+| 255 | 1920 B | Summation Game | [Question](https://codeforces.com/problemset/problem/1920/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1920%20B%20-%20Summation%20Game)
+| 256 | 1921 A | Square | [Question](https://codeforces.com/problemset/problem/1921/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20A%20-%20Square)
+| 257 | 1921 B | Arranging Cats | [Question](https://codeforces.com/problemset/problem/1921/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20B%20-%20Arranging%20Cats)
+| 258 | 1921 C | Sending Messages | [Question](https://codeforces.com/problemset/problem/1921/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20C%20-%20Sending%20Messages)
+| 259 | 1921 D | Very Different Array | [Question](https://codeforces.com/problemset/problem/1921/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1921%20D%20-%20Very%20Different%20Array)
+| 260 | 1927 A | Make it White | [Question](https://codeforces.com/problemset/problem/1927/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20A%20-%20Make%20it%20White)
+| 261 | 1927 B | Following the String | [Question](https://codeforces.com/problemset/problem/1927/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20B%20-%20Following%20the%20String)
+| 262 | 1927 C | Choose the Different Ones | [Question](https://codeforces.com/problemset/problem/1927/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20C%20-%20Choose%20the%20Different%20Ones)
+| 263 | 1927 D | Find the Different Ones! | [Question](https://codeforces.com/problemset/problem/1927/D) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20D%20-%20Find%20the%20Different%20Ones!)
+| 264 | 1927 E | Klever Permutation | [Question](https://codeforces.com/problemset/problem/1927/E) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20E%20-%20Klever%20Permutation)