解鸡兔同笼到二元一次方程组通解

#include<bits/stdc++.h>
using namespace std;
int main()
{
	//cout << 2 << " " << 5; 解鸡兔同笼问题的直接输出法

	/*int x = 0 , y = 0 , head , foot ;
	cin >> head >> foot;
	y = (foot - 2 * head) / 2;
	x = head - y;
	cout << x << " " << y; */
	/*int x = 0 , y = 0 , a , b , head , foot ;
	cin >> head >> foot >> a >> b;
	y = (foot - a * head) / (b - a);
	x = head - y;
	cout << x << " " << y; */鸡兔同笼通解

	int x = 0 , y = 0 , a , b , k , c , m , n; //二元一次方程整数通解
	cin >> m >> n >> k >> a >> b >> c;

	/*y = (c - a * k / m) / (b - a * n / m);
	x = (k - n * y) / m; 方法1*/

	x = (c - b * k / n) / ( a - b * m / n);
	y = (k - m * x) / n; //方法2

	cout << x << " " << y;
	return 0;
}