往返狗遇人次数问题

题目：有甲和乙相遇问题，在甲起始位置有一条狗，在甲乙间往返，遇到人便回头走，求甲和乙相遇时狗往返了几次

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
using namespace std;

const double Length=100;
const double v1=3,v2=4,v=5;
const double precision=0.0001;
double meetTime(double va,double vb,double length){
	return (length/(va+vb));
}
int main()
{	double t=0.0;
	int ans=0;
	double totalTime=meetTime(v1,v2,Length);
	while(fabs(totalTime-t)>precision){
		t=t+meetTime(v,v2,Length-t*v1-t*v2);
		ans++;
		if(fabs(totalTime-t)>precision){
			t=t+meetTime(v,v1,Length-t*v1-t*v2);
			ans++;
		}
	}
	printf("%d\n",ans);

	return 0;
}