(I3
I101
I9
(dp0
Vagrain.%l
p1
(Vagrain3.cpp
p2
S"#include <bits/stdc++.h>\r\n#define endl '\\n'\r\nusing namespace std;\r\n\r\nstruct point\r\n{\r\n    int x, time;\r\n    \r\n    point(){}\r\n    point(int x, int time)\r\n    {\r\n        this->x = x;\r\n        this->time = time;\r\n    }\r\n};\r\n\r\nbool k;\r\nlong long n, l, d, x1, a, b, lastX;\r\nvector<point> points;\r\n\r\nbool cmp(point x, point y)\r\n{\r\n    return x.x < y.x;\r\n}\r\n\r\nint main()\r\n{\r\n    ios_base::sync_with_stdio(false);\r\n    cin.tie(NULL);\r\n    \r\n    cin>>n>>l>>d>>x1>>a>>b;\r\n    for(int i = 1; i <= n; i++)\r\n    {\r\n        points.push_back(point(x1, i));\r\n        x1 = (x1 * a + b) % (l + 1);\r\n    }\r\n    points.push_back(point(-1, 0));\r\n    points.push_back(point(l + 1, 0));\r\n    \r\n    sort(points.begin(), points.end(), cmp);\r\n    \r\n    for(int i = 1; i <= n; i++)\r\n    {\r\n        lastX = points[0].x;\r\n        k = false;\r\n        for(int j = 1; j < points.size(); j++)\r\n        {\r\n            if(points[j].time > i) continue;\r\n            \r\n            if(points[j].x - lastX - 1 > d)\r\n            {\r\n                k = true;\r\n                break;\r\n            }\r\n            lastX = points[j].x;\r\n        }\r\n        \r\n        if(!k)\r\n        {\r\n            cout<<i<<endl;\r\n            return 0;\r\n        }\r\n    }\r\n    \r\n    cout<<-1<<endl;\r\n    return 0;\r\n}"
p3
tp4
stp5
.