四平方和（哈希）

题目：https://blog.csdn.net/qq_43469554/article/details/88764093

#include <iostream>
#include <map>
#include <cmath>
using namespace std;
map<int, int> mmp;
int main()
{
	int n;
	cin >> n;
	//预处理出mmp的值
	for (int c = 0; c * c <= n / 2; c++)
	{
		for (int d = c; c * c + d * d <= n; d++)
		{
			//c^2+d^2的值没有在mmp中的,进行下一行赋值
			if(mmp.find(c * c + d * d) == mmp.end())
			{
				mmp[c * c + d * d] = c;
			}
		}
	}
	for (int a = 0; a * a <= n / 4; a++)
	{
		for (int b = a; a * a + b * b <= n / 2; b++)
		{
			if (mmp.find(n - a * a - b * b) != mmp.end())
			{
				 int c2 = mmp[n - a * a - b * b];
				 int d2 = sqrt(n - a * a - b * b - c2 * c2);
				 cout << a << " " << b << " " << c2 << " " << d2 << endl;
				 return 0;//到一个解就停止
			}
		}
	}
	return 0;
}