Cod sursă (job #819819)

#include <bits/stdc++.h>
using namespace std;
int const N=10050;
int n,v[N];
void citire()
{
    cin>>n;
    for(int i=1 ; i<=n ; i++)
    {
        cin>>v[i];
    }
}
int rotire()
{
    int nas=0;
    for(int i=1 ; i<=n-1 ; i++)
    {
        if(v[i]<=v[i+1] && v[i]!=0)
        {
            v[i+1]=v[i+1]-v[i];
            nas=1;
        }

    }
    if(v[n]<=v[1] && v[n]!=0)
    {
        v[1]=v[1]-v[n];
        nas=1;
    }
    return nas;
}
void rez()
{
    int r=0,s=0;
    while(rotire()!=0)
    {
        r++;
    }
    for(int i=1 ; i<=n ; i++)
    {
        if(v[i]!=0)
        s++;
    }
    r++;
    cout<<r<<" "<<s;
}
int main()
{
    freopen("date.in","r",stdin);
    freopen("date.out","w",stdout);
    citire();
    rez();
    return 0;
}