蓝桥题目：B-24、龟兔赛跑预测

最新推荐文章于 2023-12-30 13:56:54 发布

Yuyao_Xu

最新推荐文章于 2023-12-30 13:56:54 发布

阅读量346

点赞数

分类专栏： Lanqiao 文章标签： leetcode 蓝桥 c++ 算法

本文链接：https://blog.csdn.net/Yuyao_Xu/article/details/104252113

版权

Lanqiao 专栏收录该内容

18 篇文章 2 订阅

订阅专栏

#include <iostream>
#define l1 v1 * i1
#define l2 v2 * i2

using namespace std;

int main(){
	int v1, v2, t, s, l;
	cin >> v1 >> v2 >> t >> s >> l;
//	v1 = 10;
//	v2 = 3;
//	t = 20;
//	s = 15;
//	l = 3450;
//	cout << v1 <<" "<< v2 <<" "<< t <<" "<< s <<" "<< l <<endl; 
	
	int flag = 0, i1 = 1, i2 = 1;
	
	while(l1 < l && l2 < l){

//		cout << "第" << i2 << "秒：" << "i1:" << i1 << "; i2:"<< i2 << "; flag:"<< flag << endl;
//		cout << "	兔子跑了"<<v1*i1<<"	 乌龟跑了"<<v2*i2<<endl;

		if(l1 - l2 >= t && flag <= 0) flag = s;
		if(flag > 0) i1--;
		flag--;
		i1++;
		i2++;
	}
	
//	cout << "循环完成" << endl;
//	cout << "第" << i2 << "秒：" << "i1:" << i1 << "; i2:"<< i2 << "; flag:"<< flag << endl;
	
	if(l1 > l2){
		cout << "R" << endl << i2;
	}else if(l1 < l2){
		cout << "T" << endl << i2;
	}else if(l1 == l2){
		cout << "D" << endl << i2;
	}
	
	return 0;
}