poj 1840 -- Eqs

 1 /*======================================================================
 2  *           Author :   kevin
 3  *         Filename :   Eqs.cpp
 4  *       Creat time :   2014-07-24 17:49
 5  *      Description :
 6 ========================================================================*/
 7 #include <iostream>
 8 #include <algorithm>
 9 #include <cstdio>
10 #include <cstring>
11 #include <queue>
12 #include <cmath>
13 #define clr(a,b) memset(a,b,sizeof(a))
14 #define M 12500000
15 using namespace std;
16 short int ha[2*M+5];
17 int main(int argc,char *argv[])
18 {
19     int a,b,c,d,e;
20     while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)!=EOF){
21         clr(ha,0);
22         for(int i = -50; i <= 50; i++){
23             if(!i) continue;
24             for(int j = -50; j <= 50; j++){
25                 if(!j) continue;
26                 int s = a*i*i*i+b*j*j*j;
27                 ha[M-s]++;
28             }
29         }
30         int cnt = 0;
31         for(int i = -50; i <= 50; i++){
32             if(!i) continue;
33             for(int j = -50; j <= 50; j++){
34                 if(!j) continue;
35                 for(int k = -50; k <= 50; k++){
36                     if(!k) continue;
37                     int s = c*i*i*i+d*j*j*j+e*k*k*k;
38                     s = M+s;
39                     if(s < 2*M && s > 0)
40                         cnt += ha[s];
41                 }
42             }
43         }
44         printf("%d\n",cnt);
45     }
46     return 0;
47 }