二元一次方程组解牛吃草问题

Ming_Law

于 2023-04-04 14:12:28 发布

阅读量116

点赞数

文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/m0_72121170/article/details/129951749

版权

#include<bits/stdc++.h>
using namespace std;
int main()
{
	double x = 0 , y = 0 , cows1 , days1 , cows2 , days2 , cows3 , days3;
	scanf("%lf %lf %lf %lf %lf" , &cows1 , &days1 , &cows2 , &days2 , &cows3);
	y = (cows2 * days2 - 1 * cows1 * days1 / 1) / (days2 - 1 * days1 / 1);
	x = ((cows2 * days2) - days2 * (cows1 * days1) / days1) / ( 1 - days2 * 1 / days1);
	days3 = x / (cows3 - y);
	cout << days3;
	return 0;
}