System of Equations_system-of-equations-优快云博客

本文链接：https://blog.youkuaiyun.com/candouer/article/details/9849055

本博客介绍了解决方程系统的问题，重点在于计算满足特定条件的整数对的数量。通过输入两个参数n和m，读者可以学习如何找到满足给定方程系统的整数解，并理解在限制条件下解决问题的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://codeforces.com/problemset/problem/214/A

Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?

You are given a system of equations:

$\text{[math]}$

You should count, how many there are pairs of integers (a, b) (0 ≤ a, b) which satisfy the system.

Input

A single line contains two integers n, m (1 ≤ n, m ≤ 1000) — the parameters of the system. The numbers on the line are separated by a space.

Output

On a single line print the answer to the problem.

        Sample test(s) 
      
          input 
        
9 3

          output 
        
1

          input 
        
14 28

          output 
        
1

          input 
        
4 20

          output 
        
0

Note

In the first sample the suitable pair is integers (3, 0). In the second sample the suitable pair is integers (3, 5). In the third sample there is no suitable pair.

这个题就是解方程，只要注意限制条件就行了。我第一次直接忽略了 a、b都大于0，一直错误，我看到有平方就习惯性的考虑了负数导致错误。。

AC代码：

#include<iostream>
#include<cstdio>
#include<cmath>

using namespace std;

int main()
{
    int n,m,a,b,sum;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        sum = 0;
        for(a = 0; a <= 1000; a++)
        {
            if(a+a*a*a*a-2*a*a*n == m-n*n)
            {
                b = n-a*a;
                if(b >= 0)
                {
                    sum++;
                }
            }
        }
        printf("%d\n",sum);
    }

    return 0;
}