(I3
I109
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'# include<iostream>\r\n# include<algorithm>\r\n# include<queue>\r\nusing namespace std;\r\n\r\nlong long kapki[10000001];\r\npriority_queue<long long> ka;\r\nint main()\r\n{\r\n    long long n,l,d;\r\n    cin>>n>>l>>d;\r\n    long long x,a,b;\r\n    cin>>x>>a>>b;\r\n    long long p=x,q;\r\n    if(x-0<=d && l-x<=d) {cout<<1<<endl; return 0;}\r\n    \r\n    ka.push(0);\r\n    ka.push(x);\r\n    ka.push(l);\r\n    for(long long i=1; i<n; i++)\r\n    {\r\n        q=(p*a+b)%(l+1);\r\n        \r\n        ka.push(q);\r\n        p=q;\r\n        long long j=0;\r\n        while(!ka.empty())\r\n        {\r\n            kapki[j]=ka.top();\r\n            ka.pop();\r\n            j++;\r\n        }\r\n        bool f=true;\r\n        ka.push(kapki[0]);\r\n        ka.push(kapki[j-1]);\r\n        for(long long k=1; k<j-1; k++)\r\n        {\r\n            ka.push(kapki[k]);\r\n            \r\n            if(kapki[k-1]-kapki[k]>d || kapki[k]-kapki[k+1]>d) {f=false;}\r\n        }\r\n        //cout<<j<<" "<<ka.size()<<endl;\r\n        //for(long long k=0; k<j; k++) cout<<kapki[k]<<" ";\r\n        //cout<<endl;\r\n        if(f) {cout<<i+1<<endl; return 0;}\r\n    }\r\n    cout<<-1<<endl;\r\n    return 0;\r\n}'
p3
tp4
stp5
.