#pragma warning(disable:4786)
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<ctime>
#include<string.h>
using namespace std;
#define pi acos(-1.0)
//#define LL __int64
typedef long long LL;
#define INF 0x7fffffffffffffff
#define bug puts("hear!")
#define inf 0x7fffffff
#define eps 1e-10
#define FRE freopen("in.txt","r",stdin)
#define E exp(1.0)
#define mod 1000000007
double ans[2050];
int main(){
int n,num,m,ia,ib,i,j;
double len,va,vb,dis;
scanf("%d",&n);
while(n--)
{
cin>>len>>va>>vb>>num;
j=1;
for(i=1;i<=1000;i++)
{
ans[j++]=(2*i-1)*len/(va+vb);
ans[j++]=(2*i-1)*len/fabs(va-vb);
}
sort(ans,ans+j);
dis=ans[num]*va;
while(dis-len>0) dis-=len;
if(len-dis<dis) dis=len-dis;
printf("Time=%.3lf Dist=%.3lf\n",ans[num],dis);
}
return 0;
}
一种是相遇:满足关系是 (va+vb)*t=L*(2*n-1)
一种是追及: 满足关系是 |va-vb|*t=L*(2*n-1)
还是很多数论都忘了啊。。。。。。。。。。。。。。。