Equations hdu1496(hash)

//一开始写的实话就感觉会超时，结构真的TLE。呵呵，一开始的想法太过简单，后来参考某大牛的代码之后终于AC #include //2337619 2010-04-13 22:44:10 Accepted 1496 218MS 8128K 797 B C++ 悔惜晟 #include #include using namespace std; int hash1[1000001]; int hash2[1000001]; int main() { int a, b, c, d; int i, j, sum, ans; while(cin>>a>>b>>c>>d) { if((a > 0 && b > 0 && c > 0 && d > 0 )||(a < 0 && b < 0 && c < 0 && d < 0)) { cout<<"0"< = 0) hash1[sum]++; else hash2[-sum]++; //这里要记得改成 - } int ans = 0; for(i = 1; i <= 100; i++) for(j = 1; j <= 100; j++) { sum = c * i * i + d * j * j; if(sum <= 0) ans += hash1[-sum]; else ans += hash2[sum]; } cout<<16 * ans< //2337472 2010-04-13 22:13:33 Time Limit Exceeded 1496 3000MS 272K 578 B C++ 悔惜晟 #include using namespace std; int main() { int a, b, c, d; int i, j, k, sum, count; while(cin>>a>>b>>c>>d) { count = 0; if((a > 0 && b > 0 && c > 0 && d > 0 )||(a < 0 && b < 0 && c < 0 && d < 0)) { cout<<"0"< 0 && t <= 100 ) count++; } cout<< 16 * count<