Added new solutions

ACPC10A.CPP

@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);
+#define ll long long
+#define endl "\n"
+
+int main()
+{
+	fast;
+    int a1,a2,a3;
+    while(cin >> a1 >> a2 >> a3)
+    {
+        if(a1==0 && a2==0 && a3==0)
+            break;
+        if(a2-a1==a3-a2)
+        {
+            cout << "AP " << 2*a3-a2 << endl;
+        }
+        else if(a2/a1==a3/a2)
+        {
+            cout << "GP " << a3*a3/a2 << endl;
+        }
+    }
+}

ANARC05B.CPP

@@ -0,0 +1,59 @@
+    #include<bits/stdc++.h>
+    using namespace std;
+    #define ll long long int
+    #define pb push_back
+    #define PI 3.1415926535897932384626
+    #define boost ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
+    #define MOD 1000000007
+    #define forn(i,n) for(int i=0;i<n;i++)
+    int n;
+    int main()
+    {
+     boost;
+     cin>>n;
+     while(n)
+     {
+     int m,s1=1,s2=1,ans=0;
+     int arr[n];
+     forn(i,n)
+     cin>>arr[i];
+     cin>>m;
+     int brr[m];
+     forn(i,m)
+     cin>>brr[i];
+
+     int pref[n+1];
+     pref[0]=0;
+     pref[1]=arr[0];
+     for(int i=2;i<=n;i++)
+     pref[i]=pref[i-1]+arr[i-1];
+
+
+     int cref[m+1];
+     cref[0]=0;
+     cref[1]=brr[0];
+
+
+     for(int i=2;i<=m;i++)
+     cref[i]=cref[i-1]+brr[i-1];
+
+     for(int i=0;i<m;i++)
+     {
+     if(binary_search(arr,arr+n,brr[i]))
+     {
+     int idx=lower_bound(arr,arr+n,brr[i])-arr;
+     int valx=pref[idx+1]-pref[s1-1];
+     int valy=cref[i+1]-cref[s2-1];
+     ans+=max(valx,valy);
+     s1=idx+2;
+     s2=i+2;
+     }
+     }
+     int x=pref[n]-pref[s1-1];
+     int y=cref[m]-cref[s2-1];
+     ans+=max(x,y);
+     cout<<ans<<endl;
+     cin>>n;
+     }
+
+    }

ANARC09B.cpp

@@ -0,0 +1,39 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);
+#define ll long long
+#define endl "\n"
+
+long long gcd(long long a, long long b)
+{
+    if(b==0)
+        return a;
+    else
+        return gcd(b,a%b);
+}
+
+long long lcm(long long a, long long b)
+{
+    return a*b/gcd(a,b);
+}
+
+int main()
+{
+//    fast;
+    long long w, h, x, a, b;
+    while(cin >> w >> h)
+    {
+        if(w==0 && h==0)
+            break;
+        else
+        {
+            x=lcm(w,h);
+            a=x/w;
+            b=x/h;
+        }
+        cout << a*b << endl;
+    }
+
+}

AP2.cpp

@@ -0,0 +1,33 @@
+#include<iostream>
+#include<algorithm>
+#include<stack>
+
+using namespace std ;
+#define endl "\n"
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);
+#define ll long long
+
+int main ()
+{
+    int t, i;
+    cin >> t;
+    while(t--)
+    {
+        ll first_third,last_third,sum;
+        cin >> first_third >> last_third >> sum;
+        ll n= (sum*2)/(first_third+last_third);
+        cout << n << endl;
+        ll d=(last_third-first_third)/(n-5);
+//        cout << d << endl;
+        ll first_term=first_third-2*d;
+        ll x=first_term;
+        for(i=0;i<n;i++)
+        {
+            cout << x << " ";
+            x=x+d;
+        }
+        cout << endl;
+
+
+    }
+}

ARMY.cpp

@@ -0,0 +1,46 @@
+#include<bits/stdc++.h>
+#include<string.h>
+
+
+using namespace std;
+
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);
+#define ll long long
+#define endl "\n"
+
+int main()
+{
+    fast;
+    int t,i;
+    cin >> t;
+    while(t--)
+    {
+        int ng, nm,max1=0,max2=0;
+        cin >> ng >> nm;
+        int arr1[ng], arr2[nm];
+        for(i=0;i<ng;i++)
+        {
+            cin >> arr1[i];
+            max1=max(arr1[i],max1);
+        }
+        for(i=0;i<nm;i++)
+        {
+            cin >> arr2[i];
+            max2=max(arr2[i],max2);
+        }
+        if(max1>max2)
+        {
+            cout  << "Godzilla" << endl;
+        }
+        else if(max1<max2)
+        {
+            cout  << "MechaGodzilla" << endl;
+        }
+        else if(max1==max2)
+        {
+            cout << "Godzilla" << endl;
+        }
+
+    }
+
+}

BAISED.cpp

@@ -0,0 +1,55 @@
+    /************
+    Author :- Profesor(Abhishek)
+    24.09.2020  12.13.49
+    **********/
+    #include <bits/stdc++.h>
+    using namespace std;
+    #define ll long long
+    #define fast ios_base::sync_with_stdio(0);cin.tie(0);
+    #define endl "\n"
+    #define for0(i, n) for (int i = 0; i < n; i++)
+    #define for1(i, n) for (int i = 1; i < n; i++)
+    #define loop(i,a,b) for(int i=a;i<b;i++)
+    #define loopr(i,a,b) for(int i=a;i>b;i--)
+    #define forit(it,x) for (auto it=(x).begin();it!=(x).end(); it++)
+    #define all(x) (x).begin(),(x).end()
+    #define allr(x) (x).rbegin(),(x).rend()
+    #define eb emplace_back
+    #define pb push_back
+    #define mp make_pair
+    #define fi first
+    #define se second
+    #define sll set<ll>
+    #define vll vector<ll>
+    #define msl map<string,ll>
+    #define mll map<ll,ll>
+    ll i, j, k;
+    int main()
+    {
+        ll t;
+        cin >> t;
+        while(t--)
+        {
+            ll n;
+            cin >> n;
+            vll vec;
+            while(n--)
+            {
+                string s;
+                ll x;
+
+                cin >> s;
+                cin >> x;
+                vec.push_back(x);
+            }
+            sort(all(vec));
+            ll res = 0;
+            for (i = 0; i < vec.size();i++)
+            {
+                res += abs(vec[i] - (i+1));
+            } 
+            cout << res << endl;
+            vec.clear();
+
+        }
+    } 

BALIFE.cpp

@@ -0,0 +1,57 @@
+    /************
+    Author :- Profesor(Abhishek)
+    25.09.2020  11.23.42
+    **********/
+    #include <bits/stdc++.h>
+    using namespace std;
+    #define ll long long
+    #define fast ios_base::sync_with_stdio(0);cin.tie(0);
+    #define endl "\n"
+    #define for0(i, n) for (int i = 0; i < n; i++)
+    #define for1(i, n) for (int i = 1; i < n; i++)
+    #define loop(i,a,b) for(int i=a;i<b;i++)
+    #define loopr(i,a,b) for(int i=a;i>b;i--)
+    #define forit(it,x) for (auto it=(x).begin();it!=(x).end(); it++)
+    #define all(x) (x).begin(),(x).end()
+    #define allr(x) (x).rbegin(),(x).rend()
+    #define eb emplace_back
+    #define pb push_back
+    #define mp make_pair
+    #define fi first
+    #define se second
+    #define sll set<ll>
+    #define vll vector<ll>
+    #define msl map<string,ll>
+    #define mll map<ll,ll>
+    ll i, j, k;
+    int main()
+    {
+        ll n;
+        while (cin >> n)
+        {
+            if (n == -1) return 0;
+            ll arr[n], sum = 0, max_diff = 0;
+            for0(i, n)
+            {
+                cin >> arr[i];
+                sum += arr[i];
+            }
+            if(sum % n != 0)
+            {
+                cout << "-1" << endl;
+                continue;
+            }
+            else
+            {
+                ll load = sum / n;
+                 ll diff = 0;
+                for (ll i = 0; i < n; i++)
+                {
+
+                    diff += (arr[i] - load);
+                    max_diff = max(max_diff, abs(diff));
+                }
+            }
+            cout << max_diff << endl;
+            }
+    }