(I3
I104
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\nusing namespace std;\r\nunsigned long long n, l, d, x1, a, b, brtek, brmax, beg, en;\r\nint main ()\r\n{\r\n    cin >>n>>l>>d>>x1>>a>>b;\r\n    brmax=max(x1,l-x1);\r\n    if (brmax==l-x1) beg=x1, en=x1+brmax;\r\n    else beg=brmax-x1+1, en=x1;\r\n    if (brmax<=d)\r\n    {\r\n        cout <<"1\\n";\r\n        return 0;\r\n    }\r\n    for (long long i=1; i<n; i++)\r\n    {\r\n        cout <<x1<<" "<<beg<<" "<<en<<" "<<brmax<<endl;\r\n        if (brmax<=d)\r\n        {\r\n            cout <<i<<endl;\r\n            return 0;\r\n        }\r\n        x1=(x1*a+b)%(l+1);\r\n        if (x1<beg || x1>en) continue;\r\n        else\r\n        {\r\n            brmax=max(x1-beg+1, en-x1);\r\n            if (brmax==x1-beg+1) en=x1;\r\n            else beg=x1+1;\r\n        }\r\n    }\r\n    cout <<"-1\\n";\r\n    return 0;\r\n}\r\n/**\r\n123456 288391724 42666\r\n42 6408706 91620547\r\n*/\r\n'
p3
tp4
stp5
.