标签:
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6089 Accepted Submission(s): 2465
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<string> #include<algorithm> #include<cstdlib> using namespace std; int hash1[1000005],hash2[5000005]; int a,b,c,d; int main() { while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF) { int ans=0,temp; if((a>0&&b>0&&c>0&&d>0)||(a<0&&b<0&&c<0&&d<0)) { printf("0\n"); continue; } for(int i=0;i<1000005;i++) hash1[i]=hash2[i]=0; for(int i=1;i<=100;i++) { for(int j=1;j<=100;j++) { temp=a*i*i+b*j*j; //printf("%d\n",temp); if(temp>=0) hash1[temp]++; else hash2[-temp]++; } } for(int i=1;i<=100;i++) { for(int j=1;j<=100;j++) { temp=c*i*i+d*j*j; if(temp>0) ans+=hash2[temp]; else ans+=hash1[-temp]; } //printf("%d\n",ans); } printf("%d\n",16*ans); } return 0; }
标签:
原文地址:http://www.cnblogs.com/water-full/p/4473478.html