Cod sursă (job #130857)

#include <fstream>
using namespace std;
ifstream in ("bizar.in");
ofstream out ("bizar.out");
char c; int n = 1, p = 1, v[100001], x[100001];
int main()
{
    in >> v[n]; x[1] = 1;
    while (in >> c)
    {
        if (c == '(')
        {
            x[++n] = p;
            p = n;
            in >> v[n];
        }

        if (c == ',')
            in >> v[++n];

        if (c == ')')
        {
            int k = v[p - 1] % (n - p + 1);
            if (!k) k = n - p + 1;
            v[p - 1] = v[p + k - 1];
            n = p - 1;
            p = x[n + 1];
        }
    }
    out << v[1] << '\n';
    out.close(); return 0;
}