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:

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;
}
本文介绍了一个关于寻找整数解的方程组问题,通过给定的参数n和m,利用编程方法找到满足条件的整数对(a, b),并对样例进行了说明。
1072

被折叠的 条评论
为什么被折叠?



