Three swimmers

A. Three swimmers
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.

It takes the first swimmer exactly a minutes to swim across the entire pool and come back, exactly b minutes for the second swimmer and c minutes for the third. Hence, the first swimmer will be on the left side of the pool after 0, a, 2a, 3a, … minutes after the start time, the second one will be at 0, b, 2b, 3b, … minutes, and the third one will be on the left side of the pool after 0, c, 2c, 3c, … minutes.

You came to the left side of the pool exactly p minutes after they started swimming. Determine how long you have to wait before one of the swimmers arrives at the left side of the pool.

Input
The first line of the input contains a single integer t (1≤t≤1000) — the number of test cases. Next t lines contains test case descriptions, one per line.

Each line contains four integers p, a, b and c (1≤p,a,b,c≤1018), time in minutes after the start, when you came to the pool and times in minutes it take the swimmers to cross the entire pool and come back.

Output
For each test case, output one integer — how long you have to wait (in minutes) before one of the swimmers arrives at the left side of the pool.

Example
inputCopy
4
9 5 4 8
2 6 10 9
10 2 5 10
10 9 9 9
outputCopy
1
4
0
8
Note
In the first test case, the first swimmer is on the left side in 0,5,10,15,… minutes after the start time, the second swimmer is on the left side in 0,4,8,12,… minutes after the start time, and the third swimmer is on the left side in 0,8,16,24,… minutes after the start time. You arrived at the pool in 9 minutes after the start time and in a minute you will meet the first swimmer on the left side.

In the second test case, the first swimmer is on the left side in 0,6,12,18,… minutes after the start time, the second swimmer is on the left side in 0,10,20,30,… minutes after the start time, and the third swimmer is on the left side in 0,9,18,27,… minutes after the start time. You arrived at the pool 2 minutes after the start time and after 4 minutes meet the first swimmer on the left side.

In the third test case, you came to the pool 10 minutes after the start time. At the same time, all three swimmers are on the left side. A rare stroke of luck!

In the fourth test case, all swimmers are located on the left side in 0,9,18,27,… minutes after the start time. You arrived at the pool 10 minutes after the start time and after 8 minutes meet all three swimmers on the left side.

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int UNINF=-0x3f3f3f3f;
const int INF=0x3f3f3f3f;
const int maxn=2e5+7;
inline int read(){
	int x=0,zf=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-') zf=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
	return zf*x;
}
#define read read()
//priority_queue<int,vector<int>,greater<int> >v;
int main(){
	int t=read;
	while(t--){
		ll T,a,b,c;
	/*	T=read;
		a=read;
		b=read;
		c=read;*/
		cin>>T>>a>>b>>c;
		ll resa=a-T%a;
		ll resb=b-T%b;
		ll resc=c-T%c;
		if(T){//以为T可以等0，所以判了一下
		if(T%a==0) resa=0;
		if(T%b==0) resb=0;
		if(T%c==0) resc=0;
		}
		//cout<<min(resa,min(resb,resc))<<endl;
		ll res;
		res=min(resa,resb);
		res=min(res,resc);
		cout<<res<<endl;
	}
}

氵t。
范围long long 被自以为是的int快读wa两次，我可以撞墙了.