用暴力循环解鸡兔同笼问题（特殊二元一次方程组）

//优化后代码
#include <bits/stdc++.h>
using namespace std;
int main()
{
	int foot , head , r;
	scanf("%d %d" , &foot , &head);
	for ( int i = 0 ; i <= foot / 2 ; i++ )
	{
		r = head - i;
		if ( i * 2 + r * 4 == foot && i + r == head )
			cout << i << " " << r; 
	}
	return 0;
}

优化前代码
#include <bits/stdc++.h>
using namespace std;
int main()
{
	int foot , head , r;
	scanf("%d %d" , &foot , &head);
	for ( int i = 0 ; i <= foot / 2 ; i++ )
	{
		for ( int j = 0 ; j <= foot / 4 ;j++ )
		{
			if ( i * 2 + j * 4 == foot && i + j == head )
			{
				cout << i << " " << j;
				
			} 
		}
	}
	return 0;
}