[链接](https://www.luogu.org/recordnew/lists?uid=&pid=P2391&status=&sort=1)
by Viston @ 2018-10-01 20:31:09
什么方法
by 立花瀧 @ 2018-10-01 21:16:02
@[bian7772221](/space/show?uid=33682) 就是暴力啊，从后往前扫，一个一个判断
by Viston @ 2018-10-02 16:36:04
```
// luogu-judger-enable-o2
#include<bits/stdc++.h>
inline int read(){
int X=0;char ch=getchar();
while(!isdigit(ch)) ch=getchar();
while(isdigit(ch)) X=X*10+ch-'0',ch=getchar();
return X;
}
void print(int X){
if(X>=10) print(X/10);
putchar(X%10+'0');
}
inline int min(int a,int b){return a>b?b:a;}
inline int max(int a,int b){return a<b?b:a;}
int a,b,c,d,e[1000002];
int main(){
a=read(),b=read(),c=read(),d=read();
for(int i=1;i<=a;++i)
for(int j=b;j>=0;j--)
if((min((j*c+d)%a+1,(j*d+c)%a+1)<=i&&max((j*c+d)%a+1,(j*d+c)%a+1)>=i)||j==0){
print(j);putchar(10);break;
}
return 0;
}
```
我发的题解（目前还没通过）
by Viston @ 2018-10-02 16:36:51
~~~~
by WAWA @ 2019-07-10 17:01:31