20分,求救
  • 板块B2066 救援
  • 楼主LzraSirrr
  • 当前回复0
  • 已保存回复0
  • 发布时间2025/1/8 15:27
  • 上次更新2025/1/8 21:36:25
查看原帖
20分,求救
1622400
LzraSirrr楼主2025/1/8 15:27
#include<bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin >> n;
	int x,y,num;
	double distance;
	double time = 0;
	for (int i = 1;i <= n;i++){
		cin >> x >> y >> num;
		distance = sqrt(x*x +y*y);
		time += 2*distance/50 + 1.5*num;
	}
	cout << ceil(time) << endl;
}
2025/1/8 15:27
加载中...