Merge pull request #52 from AsesinoAKg/akg8

Akg8

Author: kishanrajput23

.cph/.arrayrecovery.cpp_7b3b9871d14eed2f4ce9e9619c6c4e79.prob

@@ -0,0 +1 @@
+{"name":"Local: arrayrecovery","url":"c:\\Users\\CC\\Desktop\\git-anurag\\git-akpro\\leetcode-solutions-1\\arrayrecovery.cpp","tests":[{"id":1666365548858,"input":"","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\Users\\CC\\Desktop\\git-anurag\\git-akpro\\leetcode-solutions-1\\arrayrecovery.cpp","group":"local","local":true}

arrayrecovery.cpp

@@ -0,0 +1,66 @@
+// shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define pi (3.141592653589)
+#define mod 1000000007
+#define ll long long
+#define float double
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define all(c) c.begin(), c.end()
+#define min3(a, b, c) min(c, min(a, b))
+#define min4(a, b, c, d) min(d, min(c, min(a, b)))
+#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
+#define rep(i, n) for (int i = 0; i < n; i++)
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+ 
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        cin >> n;
+        int c = 0;
+        vector<int> a(n);
+        vector<int> b(n);
+        int flag = 0;
+        for (int i = 0; i < n; i++)
+        {
+            cin >> a[i];
+        }
+        b[0] = a[0];
+        for (int i = 1; i < n; i++)
+        {
+            if(a[i]==0){
+                b[i] = b[i-1] + a[i];
+                continue;
+            }
+            if (b[i-1] - a[i] >= 0)
+            {
+                flag = 1;
+                break;
+            }
+            else{
+                b[i] = a[i] + b[i - 1];
+            }
+        }
+        for (int i = 0; i < n; i++)
+        {
+            if (flag == 0)
+            {
+                cout << b[i] << " ";
+            }
+            else{
+                cout << "-1";
+                break;
+            }
+        }
+        cout<<endl;
+    }
+    return 0;
+}

arrayrecovery.exe

@@ -0,0 +1,54 @@
+//shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define pi (3.141592653589)
+#define mod 1000000007
+#define ll long long
+#define float double
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define all(c) c.begin(), c.end()
+#define min3(a, b, c) min(c, min(a, b))
+#define min4(a, b, c, d) min(d, min(c, min(a, b)))
+#define rrep(i, n) for(int i=n-1;i>=0;i--)
+#define rep(i,n) for(int i=0;i<n;i++)
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+
+int main()
+{
+
+
+    int t;
+    cin>>t;
+    while(t--)
+    {
+    int n, cv = 0, qw = 0, po = 0;
+    cin >> n;
+    std::vector<int> a(n);
+    for (int i = 0; i < n; i++)
+        cin >> a[i];
+    for (int j = 0; j < n; j++)
+    {
+        for (int i = 0; i < n; i++)
+        {
+                if (a[j] >= a[i]){
+                    cv++;
+                }
+                else{
+                    qw++;
+                }
+            
+        }
+        if (cv > qw)
+            po++;
+        cv = 0;
+      qw = 0;
+    }
+    cout << po << endl;
+}
+    return 0;
+}

averageflex.cpp

@@ -0,0 +1,45 @@
+//shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+
+int main()
+{
+
+
+    int tt;
+    cin>>tt;
+    while(tt--)
+    {
+        int n;
+        cin>>n;
+       
+        int a[n];
+        for (int i = 0; i < n; i++)
+        {
+            cin>>a[i];
+        }
+         int max1 = 0;
+        for (int i = 0; i < n; i++)
+        {
+            if(a[i]>a[max1])
+            max1 = i;
+        }
+        if(max1 == 0){
+            cout<<-1<<endl;
+        }
+        else{
+            cout<<max1<<endl;
+            for (int i = 0; i < max1; i++)
+            cout<<a[i]<<" ";
+            cout<<endl;
+            cout<<n-max1<<endl;
+            for(int i =max1; i<n; i++)
+            cout<<a[i]<<" ";
+            cout<<endl;
+            
+        }
+    }
+    return 0;
+}

confusingconcatenations.cpp

@@ -0,0 +1,49 @@
+//shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define pi (3.141592653589)
+#define mod 1000000007
+#define ll long long
+#define float double
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define all(c) c.begin(), c.end()
+#define min3(a, b, c) min(c, min(a, b))
+#define min4(a, b, c, d) min(d, min(c, min(a, b)))
+#define rrep(i, n) for(int i=n-1;i>=0;i--)
+#define rep(i,n) for(int i=0;i<n;i++)
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+ 
+ 
+int main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int n,m;
+        cin>>n>>m;
+        vector<vector<int>> ma(m , vector<int> (2));
+        unordered_map<int,int> mp;
+        unordered_map<int,int> mq;
+        for (int i = 0; i < m; i++)
+        {
+            for (int j = 0; j < 2; j++)
+            {
+                cin>>ma[i][j];
+                mp[ma[i][0]]++;
+                mq[ma[i][1]]++;
+            }
+        }
+        if(n == m)
+        cout<<"NO"<<endl;
+        else if(mp.size()==m && mp.size()==m)
+        cout<<"YES"<<endl;
+        else
+        cout<<"NO"<<endl;
+    }
+    return 0;
+}

cowardly rooks.cpp

@@ -0,0 +1,53 @@
+//shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define pi (3.141592653589)
+#define mod 1000000007
+#define ll long long
+#define float double
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define all(c) c.begin(), c.end()
+#define min3(a, b, c) min(c, min(a, b))
+#define min4(a, b, c, d) min(d, min(c, min(a, b)))
+#define rrep(i, n) for(int i=n-1;i>=0;i--)
+#define rep(i,n) for(int i=0;i<n;i++)
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+
+int main()
+{
+
+
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int n;
+        cin>>n;
+        string as;
+        cin>>as;
+        int c1=0,c0=0;
+        for (int i = 0; i < n; i++)
+        {
+            if(as[i] == '1')
+            c1++;
+            else
+            c0++;
+        }
+        if(n%2==0){
+            if(c1%2 && c0%2)
+            cout<<"NO"<<endl;
+            else
+            cout<<"YES"<<endl;
+        }
+        else{
+            cout<<"YES"<<endl;
+        }
+        
+    }
+    return 0;
+}

palindromeflipping.cpp

@@ -0,0 +1,83 @@
+//shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define pi (3.141592653589)
+#define mod 1000000007
+#define ll long long
+#define float double
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define all(c) c.begin(), c.end()
+#define min3(a, b, c) min(c, min(a, b))
+#define min4(a, b, c, d) min(d, min(c, min(a, b)))
+#define rrep(i, n) for(int i=n-1;i>=0;i--)
+#define rep(i,n) for(int i=0;i<n;i++)
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+
+int main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        ll n;
+        cin>>n;
+        string as;
+        cin>>as;
+        if(as[0]=='0'){
+            for (int i = 0; i < 2*n; i++)
+            {
+                if(as[i]=='1'){
+                    as[i]='0';
+                }
+                else{
+                    as[i]='1';
+                }
+            }
+            
+        }
+        vector<ll> vc;
+        ll cc;
+        ll flag = 0;
+        ll an;
+        for (int i = 0; i < 2*n; i++)
+        {
+            if(as[i]=='0'){
+                vc.push_back(i);
+            }
+            if(as[i] != as[2*n-i-1]){
+                flag=1;
+                break;
+            }
+        }
+        if(flag){
+            cout<<"1\n";
+            cout<<2*n<<endl;
+            continue;
+        }
+        if(vc.size()==0){
+            cout<<"-1\n";
+        }
+        else{
+            cc=2*n-1-vc.back();
+            for(int i=vc.size()-1; i>=1; i--){
+                if(vc[i]-vc[i-1]-1!=cc){
+                    flag=1;
+                    cout<<"2\n";
+                    cout<<vc[i-1]+1<<" "<<2*n-1-vc[i-1]<<endl;
+                    break;
+                }
+            }
+            if(flag==0){
+                cout<<"2\n";
+                cout<<vc[vc.size()-2]+2<<" "<<2*n-2-vc[vc.size()-2]<<endl;
+
+            }
+        }
+    }
+    return 0;
+}

palindromepartition.cpp

@@ -0,0 +1,34 @@
+//shree ganeshay namah
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define pi (3.141592653589)
+#define mod 1000000007
+#define ll long long
+#define float double
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define all(c) c.begin(), c.end()
+#define min3(a, b, c) min(c, min(a, b))
+#define min4(a, b, c, d) min(d, min(c, min(a, b)))
+#define rrep(i, n) for(int i=n-1;i>=0;i--)
+#define rep(i,n) for(int i=0;i<n;i++)
+#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
+
+
+int main()
+{
+
+
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int ak,akg;
+        cin>>ak>>akg;
+        cout<<(ak/akg)*(ak/akg)<<endl;
+    }
+    return 0;
+}