Codeforces 1624A. Plus One on the Subset Solution


   

Solution in C++: 

///******Bismillahir-Rahmanir-Rahim******///

///AH Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh


    #include <bits/stdc++.h>
    using namespace std;
    int main()
    {
        int t,n,i;
        cin>>t;
        while(t--)
        {
            cin>>n;
            int a[n+9];
            for(i=0; i<n; i++)
                cin>>a[i];
        sort(a,a+n);
        cout<<a[n-1]-a[0]<<endl;
        }
        return 0;
    }


    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.