(I3
I105
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'#include <iostream>\r\n#include <cstdio>\r\n#include <algorithm>\r\nusing namespace std;\r\n\r\nint pos[1000005];\r\n\r\nint main()\r\n{\r\n\r\nlong long n,l,d,x,a,b,cnt,r1,r2,k,i,j;\r\nbool fl;\r\n\r\ncin>>n>>l>>d;\r\ncin>>x>>a>>b;\r\n\r\npos[1]=x;\r\ncnt=1;\r\n\r\n for(i=1;i<=n;i++)\r\n {  \r\n  r1=pos[1];\r\n  r2=l-pos[cnt];\r\n  fl=true;\r\n   \r\n   for(j=1;j<cnt;j++)\r\n   {\r\n    k=pos[j+1]-pos[j];\r\n     if(k>d)\r\n     {\r\n      fl=false;\r\n      break;\r\n     } \r\n   }\r\n   \r\n   //cout<<r1<<endl;\r\n   //cout<<r2<<endl;\r\n   if(fl && r1<=d && r2<=d)\r\n   {\r\n    cout<<cnt<<endl;\r\n    return 0;   \r\n   }\r\n   \r\n  x=(x*a+b)%(l+1);\r\n  cnt++;\r\n  pos[cnt]=x;\r\n  sort(pos+1,pos+cnt+1);\r\n }\r\n\r\ncout<<-1<<endl;\r\n\r\nreturn 0;\r\n}        '
p3
tp4
stp5
.