System of Equations

最新推荐文章于 2022-09-21 15:13:25 发布

cherkid

最新推荐文章于 2022-09-21 15:13:25 发布

阅读量223

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/cherkid/article/details/78360134

版权

水题专栏收录该内容

9 篇文章 0 订阅

订阅专栏

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.

Example

Input

9 3

Output

Input

14 28

Output

Input

4 20

Output

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.

这题一开始做时把两个合并得出（m-b^2）^2+b=n，只以这样来计算总数，最后肯定wa。。。

因为还需要判断一下这种情况下得出的b=n^2-a是不是大于等于零。

#include<bits/stdc++.h>
#define min(a,b) a>b?a:b

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

        printf("%d\n",sum);
    }
    return 0;
}