(I3
I118
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nstruct Intervals{\r\n     long long from;\r\n     long long to;\r\n     bool Get;\r\n};\r\nIntervals Inter[100000];\r\nlong long index=0,gets=0;\r\nint main (){\r\nlong long N,L,D,X1,A,B;\r\nlong long last,i,answ;\r\ncin>>N>>L>>D;\r\ncin>>X1>>A>>B;\r\nfor(i=1;i<L;i++){\r\n  Inter[index].from=i-1;\r\n  Inter[index].to=i+D-1;\r\n  Inter[index].Get=false;\r\n  index++;\r\n  i=i+D-1;\r\n}\r\nInter[0].from=1;\r\nInter[index-1].to=L;\r\nif(Inter[X1/D].Get==false){\r\n   Inter[X1/D].Get=true;\r\n   gets++;\r\n}\r\nif(Inter[index-1].to-Inter[index-1].from<D){\r\n   Inter[index-1].Get=true;\r\n   gets++;\r\n}\r\nlast=X1;\r\nlong long ost;\r\nfor(i=0;i<N and gets!=index-1;i++){\r\n   answ=(last*A+B)%(L+1);\r\n    ost=answ%D;\r\n   if(!Inter[(answ/D)+(ost/ost)].Get){\r\n     Inter[(answ/D)+(ost/ost)].Get=true;\r\n     gets++;\r\n   }\r\n   last=answ;\r\n}\r\ncout<<i+1<<endl;\r\nreturn 0;\r\n}\r\n'
p3
tp4
stp5
.