Codeforces round 996(B. World Cup)

///Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll n;

    cin>>n;

    ll arr[n+2],mi=1000000009,plu=0,flag=0;

    for(ll i=0; i<n; i++)

        cin>>arr[i],mi=min(mi,arr[i]);

    for(ll i=0; i<n; i++)

        arr[i]-=mi;

    ll start=mi%n;

    while(flag==0)

    {

        for(ll i=start; i<n; i++)

        {

            if(arr[i]<=plu)

            {

                flag=1;

                cout<<i+1<<endl;

                break;

            }

            plu++;

        }

        start=0;

    }

    return 0;

}

///Alhamdulillah

 

Problem Link:https://codeforces.com/problemset/problem/996/B