直接暴力
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>
using namespace std;
typedef long long ll;
const int maxn = 10000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int n, m;
int main() {
cin >> n >> m;
int ans = 0;
int t = max(n, m);
for(int i = 0; i <= t; ++i) {
for(int j = 0; j <= t; ++j) {
if((i*i+j == n) && (i+j*j == m)) ans++;
}
}
cout << ans << endl;
return 0;
}