initial commit

11A Increasing Sequence/11A.cpp

@@ -0,0 +1,58 @@
+#include<bits/stdc++.h>
+using namespace std;
+using ll = long long;
+
+void solve()
+{
+    int n,d;
+    cin>>n>>d;
+    vector<int>v;
+    for(int i=0; i<n; ++i)
+    {
+        int x;
+        cin>>x;
+        v.push_back(x);
+    }
+    int ct=0;
+    for(int i=1; i<n; ++i)
+    {
+        if(v[i]<=v[i-1])
+        {
+            int x=v[i-1]-v[i];
+            if(x==0)
+            {
+                v[i]+=d;
+                ct++;
+            }
+            else if(x%d==0)
+            {
+                int y=x/d;
+                ct+=y;
+                v[i]+=y*d;
+            }
+            else
+            {
+                int y=(x/d)+1;
+                ct+=y;
+                v[i]+=y*d;
+            }
+        }
+        if(v[i]==v[i-1])
+        {
+            v[i]+=d;
+            ct++;
+        }
+    }
+    cout<<ct<<endl;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int TC = 1;
+    //cin >> TC;
+    //cin.ignore();
+    while (TC--) solve();
+}

1389A LCM Problem/1389A.cpp

@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+using namespace std;
+using ll = long long;
+
+
+void solve()
+{
+    int l,r;
+    cin>>l>>r;
+    if(2*l>r)
+        cout<<-1<<" "<<-1<<endl;
+    else
+        cout<<l<<" "<<2*l<<endl;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int TC = 1;
+    cin >> TC;
+    cin.ignore();
+    while (TC--) solve();
+}

141A Amusing Joke/141A.cpp

@@ -0,0 +1,47 @@
+#include<bits/stdc++.h>
+using namespace std;
+using ll = long long;
+
+
+void solve()
+{
+    string a,b,c;
+    cin>>a>>b>>c;
+    map<char,int>letters;
+    for(int i=0; i<a.size(); ++i)
+    {
+        letters[a[i]]++;
+    }
+    for(int i=0; i<b.size(); ++i)
+    {
+        letters[b[i]]++;
+    }
+    for(int i=0; i<c.size(); ++i)
+    {
+        letters[c[i]]++;
+    }
+    bool matching=1;
+    for(auto it:letters)
+    {
+        if(it.second%2!=0)
+        {
+            matching=0;
+            break;
+        }
+    }
+    if(matching)
+        cout<<"YES"<<endl;
+    else
+        cout<<"NO"<<endl;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int TC = 1;
+    //cin >> TC;
+    //cin.ignore();
+    while (TC--) solve();
+}

151A Soft Drinking/151A.cpp

@@ -0,0 +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(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, k, l, c, d, p, nll, np;
+    cin>>n>>k>>l>>c>>d>>p>>nll>>np;
+    int drink=(k*l)/nll;
+    int slices=c*d;
+    int salt=p/np;
+    int toast=min({drink,slices,salt});
+    cout<<toast/n<<nl;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    //cin >> TC;
+    while (TC--) solve();
+}
+