n,m = map(int,input().split())
ans = 0
a = 0
while a*a <=n and a<=m:
b = n - a*a
if (a+b*b==m):
ans += 1
a += 1
print(ans)#include <stdio.h>
int main()
{
int m, n,count=0;
scanf("%d %d", &m, &n);
for(int i=0;i<=m;i++)
{
for(int j=0;j<=n;j++)
{
if(i*i+j==m && i+j*j==n)
{
count++;
}
}
}
printf("%d", count);
}
1480. Running Sum of 1d Array | 682. Baseball Game |
496. Next Greater Element I | 232. Implement Queue using Stacks |
844. Backspace String Compare | 20. Valid Parentheses |
746. Min Cost Climbing Stairs | 392. Is Subsequence |
70. Climbing Stairs | 53. Maximum Subarray |
1527A. And Then There Were K | 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers |
318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |
345. Reverse Vowels of a String | 628. Maximum Product of Three Numbers |
1526A - Mean Inequality | 1526B - I Hate 1111 |
1881. Maximum Value after Insertion | 237. Delete Node in a Linked List |
27. Remove Element | 39. Combination Sum |
378. Kth Smallest Element in a Sorted Matrix | 162. Find Peak Element |