HamsterandEquation

The test files contain one or more test cases, the first line contains a integer $T$ , representing the number of test cases in this file.

For the following $T$ lines, each line contains two integers $n,k$ , the constant of this equations. Here $1\le n,|k| \le 500$ .

It is guaranteed that $\sum n \le 2000$ for all the test cases.

C++ 解法, 执行用时: 674ms, 内存消耗: 9080K, 提交时间: 2021-08-28 14:35:17

#include<iostream>
#include<map>
using namespace std;
map<long long,int> a;
int main()
{
	int m;
	cin>>m;
	while(m--)
	{
		long long n,k,z=0;
		cin>>n>>k;
		for(int j=-n;j<=n;j++)
		for(int l=-n;l<=n;l++)
		a[j*(j+1)+l*(l+1)]++;
		for(int j=-n;j<=n;j++)
		for(int l=-n;l<=n;l++)
		z+=a[(j*(j+1)+l*(l+1))*k];
		cout<<z<<endl;
		a.clear();
	}
	
	return 0; 
 }

Python3(3.9) 解法, 执行用时: 1428ms, 内存消耗: 10624K, 提交时间: 2021-05-06 10:55:29

import collections

t = int(input())
for _ai in range(t):
    n, k = [int(i) for i in input().split()]
    dle = collections.defaultdict(int)
    ans = 0
    for x1 in range(-n, n+1):
        for x2 in range(-n, n+1):
            dle[x1 * (x1 + 1) + x2 * (x2 + 1)] += 1
    for p in dle:
        ans += dle[p] * dle.get(p*k, 0)
    print(ans)

详情