#BZOJ1421. A Modular Arithmetic Challenge
-
ID: 3668
Type: RemoteJudge
1000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
root
A Modular Arithmetic Challenge
No submission language available for this problem.
题目描述
求3<=(3*x) Mod 5<=4的最小正整数解是多少？3！这个很简单. 但当把数字放得很大呢?
输入格式
第一行一个整数。T代表数据组数。
接下来T行，每行4个数，M，D，L，R表示L<=(D*x Mod M)<=R。
T<=100,1<=M、D、L、R<=1000000000
输出格式
共T行，表示x的最小正整数解，若无解则输出-1。
1
5 3 3 4
1