Cod sursă (job #756509)

#include <fstream>
#include <cstring>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <map>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
using namespace std;
ifstream f("bizar.in");
ofstream g("bizar.out");
int nr,i,j,st,dr;
short z;
char sir[501],c,a[51],s[501],k;
int sol(int x)
{
    vector<int>a;
    int nr=0;
    while(f>>c)
    {
        if(c==' ')f>>c;
        if('0'<=c&&c<='9')nr=nr*10+(c-'0');
        if(c==',')
        {
            a.push_back(nr);
            nr=0;
        }
        if(c=='(')nr=sol(nr);
        if(c==')')
        {
            a.push_back(nr);
            nr=0;
            break;
        }
    }
    x--;
    return a[(x%a.size())];
}
int main()
{
    while(f>>c)
    {
        if(c==' ')f>>c;
        if('0'<=c&&c<='9')nr=nr*10+(c-'0');
        if(c=='(')nr=sol(nr);
    }
    g<<nr;
    return 0;
}