leetcode 71

Author: Pankajcoder1

Codeforces/1452B-Toy_Blocks.cpp

@@ -4,98 +4,32 @@
 */
 #include <bits/stdc++.h>
 using namespace std;
-typedef long long ll ;
-typedef vector<ll> vl;
-#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
-// define values.
-// #define mod 1000000007
-#define phi 1.618
-/*  Abbrevations  */
-#define ff first
-#define ss second
-#define mp make_pair
-#define line cout<<endl;
-#define pb push_back
-#define Endl "\n"
-// loops
-#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
-// Some print
-#define no cout<<"NO"<<endl;
-#define yes cout<<"YES"<<endl;
-#define cc ll test;cin>>test;while(test--)
-// sort
-#define all(V) (V).begin(),(V).end()
-#define srt(V) sort(all(V))
-#define srtGreat(V) sort(all(V),greater<ll>())
-// function
+typedef long long ll;
 
-ll power(ll x,ll y,ll mod)
+int solve()
 {
-    ll res=1;
-    // x=x%mod;
-    while(y>0)
+    int n;
+    cin >> n;
+    vector<int> v(n);
+    int maxo = 0;
+    long long sum = 0;
+    for (auto &x : v)
     {
-        if(y%2==1)
-        {
-            res*=x;
-            // res=res%mod;
-        }
-        y/=2; x*=x; // x=x%mod;
+        cin >> x;
+        maxo = max(maxo, x);
+        sum += x;
     }
-    return res;
-}
-// datatype definination
-#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
-
-/* ascii value 
-A=65,Z=90,a=97,z=122
-*/
-/*  -----------------------------------------------------------------------------------*/
-
-
-ll solve()
-{
-    ll n;
-    cin>>n;
-    vl v(n);
-    forin(v,n);
-    srt(v);
-    ll sum=0;
-    for(ll i=0;i<n;i++)
-    {
-        sum+=v[i];
-    }
-    ll mini=LONG_MAX;
-    if((v[(n-1)]*(n-1))==sum)
-    {
-        cout<<0<<endl;
-        return 0;
-    }
-    ll maxo=v[n-1];
-            ll temp_sum=max((maxo*(n-1)),(sum));
-            if((temp_sum%(n-1))!=0)
-                temp_sum+=(n-1);
-            temp_sum/=(n-1);
-            temp_sum*=(n-1);
-            // cout<<"hi "<<endl;
-            cout<<abs(temp_sum-sum)<<endl;
+    long long k = max((long long)maxo, ((sum + n - 2) / (n - 1)));
+    cout << (k * (n - 1)) - sum << endl;
     return 0;
 }
-
 int main()
 {
-    //freopen("input.txt"a, "r", stdin);
-    pan;
-    // solve();
-    cc
+    int testCase = 1;
+    cin >> testCase;
+    while (testCase--)
     {
         solve();
     }
     return 0;
-}
-
-/* stuff you should look before submission 
-* int overflow
-* special test case (n=0||n=1||n=2)
-* don't get stuck on one approach if you get wrong answer
-*/
+}

LeetCode/71.Simplify Path.cpp

@@ -0,0 +1,54 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    string simplifyPath(string path)
+    {
+
+        stack<string> st;
+        string res;
+
+        for (int i = 0; i < path.size(); ++i)
+        {
+            if (path[i] == '/')
+                continue;
+            string temp="";
+            while (i < path.size() && path[i] != '/')
+            {
+                temp += path[i];
+                ++i;
+            }
+            if (temp == ".")
+                continue;
+            else if (temp == "..")
+            {
+                if (!st.empty())
+                    st.pop();
+            }
+            else{
+                st.push(temp);
+            }
+        }
+
+        while (!st.empty())
+        {
+            res = "/" + st.top() + res;
+            st.pop();
+        }
+
+        if (res.size() == 0){
+            return "/";
+        }
+
+        return res;
+    }
+};