(I3
I113
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint main(){\r\n    int n,d,l,a,b;\r\n    int x;\r\n    cin>>n>>l>>d>>x>>a>>b;\r\n    int p[n],pl=3;\r\n    p[0]=0;\r\n    p[1]=x;\r\n    p[2]=l;\r\n    if(n>1000){\r\n        cout<<-1;\r\n        return 0;\r\n    }\r\n    for(int i=0;i<n-1;i++){\r\n            \r\n        p[pl]=(x*a+b)%(l+1);\r\n        x=(x*a+b)%(l+1);\r\n        pl++;\r\n        sort(p,p+pl);\r\n        bool end=true;\r\n        for(int k=0;k<pl-1 && end;k++){\r\n            if(p[k+1]-p[k]>d){\r\n                end=false;\r\n            }\r\n        }\r\n        if(end){\r\n            cout<<i+2;\r\n            return  0;\r\n        }\r\n    }\r\n        bool end=true;\r\n        for(int k=0;k<pl-1 && end;k++){\r\n            if(p[k+1]-p[k]>d){\r\n                end=false;\r\n            }\r\n        }\r\n        if(end){\r\n            cout<<1;\r\n            return  0;\r\n        }\r\n    cout<<-1;\r\n    return 0;\r\n}'
p3
tp4
stp5
.