AcWing 4615. 相遇问题(java)
原题链接
简单
作者:
CYHMMZDAN
,
2023-03-21 21:36:34
,
所有人可见
,
阅读 169
package hjk;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static long[] a=new long[1000005];
static long[] b=new long[1000005];
static int[] c=new int[200005];
static int[] d=new int[200005];
static int[] e=new int[200005];
static int[] f=new int[200005];
static int t=520;
static int ans=0;
static int max=-1;
static int min=(int)2e+9;
static int n=0;
static int m=0;
static HashMap<Integer,Integer> map=new HashMap<>();
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
while(n-->0) {
int x=sc.nextInt();
int y=sc.nextInt();
int l=sc.nextInt();
int r=sc.nextInt();
if((y-x)%(l+r)==0) {
System.out.println((y-x)/(l+r));
}
else {
System.out.println(-1);
}
}
}
}