(I3
I107
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'#include <iostream>\r\n#include <vector>\r\n#include <algorithm>\r\nusing namespace std;\r\nlong long n, x, l, d, a, b, k;\r\nbool flag, br=false;\r\nvector<int> s;\r\nint main()\r\n{\r\n    s.push_back(0);\r\n    cin>>n>>l>>d;\r\n    cin>>x>>a>>b;\r\n    s.push_back(l);\r\n    for (int i=0;i<n;i++)\r\n    {\r\n        s.push_back(x);\r\n        x=(x*a+b)%(l+1);\r\n        sort(s.begin(),s.end());\r\n        k=s.size();\r\n        flag=false;\r\n        for (int j=1;j<k;j++)\r\n        {\r\n            if (s[j]-s[j-1]>d) {flag=true; break;}\r\n        }\r\n        if (flag==false) \r\n        {\r\n            br=true;\r\n            cout<<i+1<<endl;\r\n            break;\r\n        }\r\n    }\r\n    if (br==false) cout<<"-1"<<endl;\r\n    return 0;\r\n}'
p3
tp4
stp5
.