#include <stdio.h>
#include <string.h>
int main()
{int i,j,n,m,z = 0;scanf("%d%d",&n,&m);for(i = 0;i <= 100;i ++)for(j = 0;j <= 100;j ++){if(i*i+j == n&&i+j*j == m)z ++;}printf("%d\n",z);return 0;
}

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <stdlib.h>
 4 int cmp(const void *a,const void *b)
 5 {
 6     return *(int *)b-*(int *)a;
 7 }
 8 int p[100001],o[100001];
 9 int main()
10 {
11     int i,j,n,m,z = 0,sum = 0,y = 1;
12     scanf("%d",&n);
13     for(i = 0; i <= n-1; i ++)
14     {
15         scanf("%d",&p[i]);
16         if(p[i] == 0)
17             z = 1;
18         sum += p[i];
19     }
20     qsort(p,n,sizeof(p[0]),cmp);
21     if(!z)
22         printf("-1\n");
23     else
24     {
25         if(sum % 3 != 0)
26         {
27             for(i = n-1; i >= 0; i --)
28             {
29                 if(p[i] % 3 == sum % 3)
30                 {
31                     o[i] = 1;
32                     break;
33                 }
34             }
35             j = 0;
36             if(i == -1)
37             {
38                 for(i = n-1; i >= 0; i --)
39                 {
40                     if(p[i]%3 != 0&&p[i] % 3 != sum % 3)
41                     {
42                         o[i] = 1;
43                         j ++;
44                     }
45                     if(j == 2)
46                         break;
47                 }
48                 if(j < 2)
49                 {
50                     printf("-1\n");
51                     y = 0;
52                 }
53             }
54         }
55         if(y)
56         {
57             z = 0;
58             for(i = 0; i <= n-1; i ++)
59             {
60                 if(!o[i])
61                 {
62                     if(p[i] != 0)
63                         z = 1;
64                     if(z)
65                         printf("%d",p[i]);
66                 }
67             }
68             if(!z)
69             printf("0");
70             printf("\n");
71         }
72     }
73     return 0;
74 }