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:
![](https://i-blog.csdnimg.cn/blog_migrate/107bfd473dc473d5b5f20b92ffb34579.png)
You should count, how many there are pairs of integers (a, b) (0 ≤ a, b) which satisfy the system.
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.
On a single line print the answer to the problem.
9 3
1
14 28
1
4 20
0
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 <stdio.h>
int main()
{
int n,m;
int cnt;
while(scanf("%d%d",&n,&m)!=EOF)
{
cnt=0;
for(int i=0;i*i<=n;i++)
{
double j=n-i*i;
if((int)j==j && j*j+i==m)
cnt++;
}
printf("%d\n",cnt);
}
return 0;
}