Cod sursă (job #731461)

#include <fstream>

using namespace std;

ifstream in("ruleta1.in");
ofstream out("ruleta1.out");

int v[10005];

int main()
{
    int n,t,r=0;
    in >> n;
    bool merge = false;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
        if (v[i] >= v[i - 1] && i > 0&& v[i-1] != 0)
        {
            if(r == 0)
            {
                r = 1;
            }
            v[i] -= v[i - 1];
            merge = true;
        }
    }
    if (v[0] >= v[n - 1]&& v[n-1] != 0)
    {
        if(r == 0)
            {
                r = 1;
            }
        merge = true;
        v[0] -= v[n - 1];
    }
    merge = true;
    while (merge == true)
    {
        r++;
        merge = false;
        for (int i = 0; i < n; i++)
        {
            if (v[i] >= v[i - 1] && i > 0 && v[i-1] != 0)
            {
                v[i] -= v[i - 1];
                merge = true;
            }
        }
        if (v[0] >= v[n - 1] && v[n-1] != 0)
        {
            merge = true;
            v[0] -= v[n - 1];
        }
    }
    t=0;
    for (int i = 0; i < n; i++)
    {
        if(v[i] != 0)
        {
            t++;
        }
    }
    /*for (int i = 0; i < n; i++)
    {
        out << v[i] << ' ';
    }*/
    out<<r<<' '<<t;
    return 0;
}