CodeForces 214A

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

You are given a system of equations:

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
1
Input
14 28
Output
1
Input
4 20
Output
0
Note (You Will Win)
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 <cstdio>#include <algorithm>#include <iostream>using namespace std;int main(){    int n,m;    scanf("%d%d",&n,&m);    int count=0;    for (int i=0;i<=n;i++){        for (int j=0;j<=m;j++){            if (i*i+j==n&&i+j*j==m){                count++;            }        }    }    printf("%d\n",count);    return 0;}