moved to codes folder

Codes/118B Present from Lena/118B.cpp

@@ -1,86 +1,86 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int n;
-    cin>>n;
-    n++;
-    for(int i=1; i<=n; ++i)
-    {
-        int p=0;
-        for(int j=i; j<n; ++j)
-            cout<<"  ";
-        for(int j=0; j<i-1; ++j)
-        {
-            cout<<p++;
-            if(j+1<i)
-                cout<<" ";
-        }
-        for(int j=0; j<i; ++j)
-        {
-            cout<<p--;
-            if(j+1<i)
-                cout<<" ";
-        }
-        cout<<endl;
-    }
-    n--;
-    for(int i=0; i<=n; ++i)
-    {
-        int p=0;
-        for(int j=0; j<=i; ++j)
-            cout<<"  ";
-        for(int j=i; j<n-1; ++j)
-        {
-            cout<<p++;
-            if(j+1<n)
-                cout<<" ";
-        }
-        for(int j=i; j<n; ++j)
-        {
-            cout<<p--;
-            if(j+1<n)
-                cout<<" ";
-        }
-        cout<<endl;
-    }
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    //cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    n++;
+    for(int i=1; i<=n; ++i)
+    {
+        int p=0;
+        for(int j=i; j<n; ++j)
+            cout<<"  ";
+        for(int j=0; j<i-1; ++j)
+        {
+            cout<<p++;
+            if(j+1<i)
+                cout<<" ";
+        }
+        for(int j=0; j<i; ++j)
+        {
+            cout<<p--;
+            if(j+1<i)
+                cout<<" ";
+        }
+        cout<<endl;
+    }
+    n--;
+    for(int i=0; i<=n; ++i)
+    {
+        int p=0;
+        for(int j=0; j<=i; ++j)
+            cout<<"  ";
+        for(int j=i; j<n-1; ++j)
+        {
+            cout<<p++;
+            if(j+1<n)
+                cout<<" ";
+        }
+        for(int j=i; j<n; ++j)
+        {
+            cout<<p--;
+            if(j+1<n)
+                cout<<" ";
+        }
+        cout<<endl;
+    }
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    //cin >> TC;
+    while (TC--) solve();
 }

Codes/1328A Divisibility Problem/1328A.cpp

@@ -1,49 +1,49 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int x,y;
-    cin>>x>>y;
-    if(x%y)
-        cout<<y-(x%y)<<nl;
-    else
-        cout<<0<<nl;
-} 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int x,y;
+    cin>>x>>y;
+    if(x%y)
+        cout<<y-(x%y)<<nl;
+    else
+        cout<<0<<nl;
+} 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1360B Honest Coach/1360B.cpp

@@ -1,56 +1,56 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int n;
-    cin>>n;
-    vector<int>v(n);
-    fr(n)
-        cin>>v[i];
-    sort(all(v));
-    int diff=INT_MAX;
-    fro(n)
-    {
-        diff=min(v[i]-v[i-1],diff);
-    }
-    cout<<diff<<nl;
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    vector<int>v(n);
+    fr(n)
+        cin>>v[i];
+    sort(all(v));
+    int diff=INT_MAX;
+    fro(n)
+    {
+        diff=min(v[i]-v[i-1],diff);
+    }
+    cout<<diff<<nl;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1399A Remove Smallest/1399A.cpp

@@ -1,64 +1,64 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(m)       for(int i=0; i<m; i++)
-#define fro(m)      for(int i=1; i<m; i++)
-#define frj(m)      for(int j=0; j<m; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-#define PI          3.141592653589793238;
-#define INF         LONG_LONG_MAX;
-#define MOD         1e9+7;
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int n;
-    cin>>n;
-    vector<int>v(n);
-    fr(n) cin>>v[i];
-    if(n==1)
-    {
-        yes;
-        return;
-    }
-    sort(all(v));
-    fro(n)
-    {
-        if(v[i]-v[i-1]>1)
-        {
-            no;
-
-            return;
-        }
-    }
-    yes;
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(m)       for(int i=0; i<m; i++)
+#define fro(m)      for(int i=1; i<m; i++)
+#define frj(m)      for(int j=0; j<m; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+#define PI          3.141592653589793238;
+#define INF         LONG_LONG_MAX;
+#define MOD         1e9+7;
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    vector<int>v(n);
+    fr(n) cin>>v[i];
+    if(n==1)
+    {
+        yes;
+        return;
+    }
+    sort(all(v));
+    fro(n)
+    {
+        if(v[i]-v[i-1]>1)
+        {
+            no;
+
+            return;
+        }
+    }
+    yes;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1703A YES or YES/1703A.cpp

@@ -1,52 +1,52 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    string s;
-    cin>>s;
-    for(auto &c:s)
-        c=tolower(c);
-    if(s=="yes")
-        yes;
-    else
-        no;
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    string s;
+    cin>>s;
+    for(auto &c:s)
+        c=tolower(c);
+    if(s=="yes")
+        yes;
+    else
+        no;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1822C Bun Lover/1822C.cpp

@@ -1,47 +1,47 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    ll n;
-    cin>>n;
-    cout<<n*(n+1)+n+2<<nl;
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    ll n;
+    cin>>n;
+    cout<<n*(n+1)+n+2<<nl;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1837A Grasshopper on a Line/1837A.cpp

@@ -1,50 +1,50 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int x,k;
-    cin>>x>>k;
-    if(x%k!=0)
-        cout<<1<<nl<<x<<nl;
-    else
-        cout<<2<<nl<<k+1<<" "<<x-k-1<<nl;   
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int x,k;
+    cin>>x>>k;
+    if(x%k!=0)
+        cout<<1<<nl<<x<<nl;
+    else
+        cout<<2<<nl<<k+1<<" "<<x-k-1<<nl;   
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1850D Balanced Round/1850D.cpp

@@ -1,63 +1,63 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int n,k;
-    cin>>n>>k;
-    vector<int>v(n);
-    fr(n) cin>>v[i];
-    int mx=0,ct=1;
-    sort(all(v));
-    fro(n)
-    {
-        int d=v[i]-v[i-1];
-        if(d<=k)
-            ct++;
-        else
-        {
-            mx=max(mx,ct);
-            ct=1;
-        }
-    }
-    mx=max(mx,ct);
-    cout<<n-mx<<nl;
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int n,k;
+    cin>>n>>k;
+    vector<int>v(n);
+    fr(n) cin>>v[i];
+    int mx=0,ct=1;
+    sort(all(v));
+    fro(n)
+    {
+        int d=v[i]-v[i-1];
+        if(d<=k)
+            ct++;
+        else
+        {
+            mx=max(mx,ct);
+            ct=1;
+        }
+    }
+    mx=max(mx,ct);
+    cout<<n-mx<<nl;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }

Codes/1857A Array Coloring/1857A.cpp

@@ -1,57 +1,57 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define ll          long long
-#define ul          unsigned long long
-#define pb          push_back
-#define ss          second
-#define ff          first
-#define fr(n)       for(int i=0; i<n; i++)
-#define fro(n)      for(int i=1; i<n; i++)
-#define frj(n)      for(int j=0; j<n; j++)
-#define frr(n)      for(int i=n; i>=0; i--)
-#define nl          '\n'
-#define yes         cout<<"YES"<<nl
-#define no          cout<<"NO"<<nl
-#define all(x)      x.begin(), x.end()
-#define dbg(x)    cerr << #x <<" "<< x << endl;
-#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define PI          3.141592653589793238
-#define INF         LONG_LONG_MAX
-#define MOD         1e9+7
-
-ll fact(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 fact(n) / fact(n - r); }
-ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
-ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
-bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
-
-//////////////////////////////////Code Start/////////////////////////////////////
-
-void solve()
-{
-    int n;
-    cin>>n;
-    int sum=0;
-    fr(n)
-    {
-        int x;
-        cin>>x;
-        sum+=x;
-    }
-    if(sum&1)
-        no;
-    else 
-        yes;
-}
- 
-int main()
-{
-    fast_io;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) solve();
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(n)       for(int i=0; i<n; i++)
+#define fro(n)      for(int i=1; i<n; i++)
+#define frj(n)      for(int j=0; j<n; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+#define PI          3.141592653589793238
+#define INF         LONG_LONG_MAX
+#define MOD         1e9+7
+
+ll fact(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 fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(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);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    int n;
+    cin>>n;
+    int sum=0;
+    fr(n)
+    {
+        int x;
+        cin>>x;
+        sum+=x;
+    }
+    if(sum&1)
+        no;
+    else 
+        yes;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
 }