(I3
I102
I9
(dp0
Vagrain.%l
p1
(Vagrain.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\n#include <cstdio>\r\nusing namespace std;\r\n\r\n#define NMax 10000005\r\n\r\nint n,l,d,x,a,b,cnt;\r\nbool point[NMax],ok=1;\r\n\r\nint main()\r\n{\r\n    scanf("%d%d%d%d%d%d",&n,&l,&d,&x,&a,&b);\r\n    if(n<=10000)\r\n   {\r\n       for(int i=0;i<n;i++)\r\n    {\r\n        cnt=0,ok=1;\r\n        if(point[x]==1)continue;\r\n        point[x]=1;\r\n        for(int k=x-1,j=x+1;k>=0&&j<=l;k--,j++)\r\n        {\r\n            if(point[k]==1)\r\n            {\r\n                if(x-k>=d)\r\n                {\r\n                        printf("%d\\n",i);\r\n                        return 0;\r\n                }\r\n                else if(j-x>=d)\r\n                {\r\n                        printf("%d\\n",i);\r\n                        return 0;\r\n                }\r\n            }\r\n        }\r\n        x=(x*a+b)%(l+1);\r\n    }\r\n    printf("-1\\n");\r\n}\r\n    else printf("-1\\n");\r\n    return 0;\r\n}'
p3
tp4
stp5
.