codeforces 214A System of Equations_codeforces214a-优快云博客

本文链接：https://blog.youkuaiyun.com/zhang__liuchen/article/details/77905774

本文介绍了一个简单的数学问题——寻找整数对(a, b)来解决特定形式的方程组。给出了具体的输入输出示例，并提供了一段C++代码实现，用于计算符合条件的整数对的数量。

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

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.

        Examples
      
          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.

水题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
int main()
{
    int n,m,s=0;
    cin>>n>>m;
    for(int i=0;i<=1000;i++)
    {
        for(int j=0;j<=1000;j++)
        {
            if(i*i+j==n&&i+j*j==m)
                s++;
        }
    }
    cout<<s<<endl;
    return 0;
}