HDU4993 Revenge of ex-Euclid(hash)

看到这题就条件反射的想到了hash......

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int hash[1000001];

int main()
{
    int T;
    //freopen("d:\\test.txt","r",stdin);
    cin>>T;
    while(T--)
    {
        int a,b,c;
        int count=0;
        cin>>a>>b>>c;
        memset(hash,0,sizeof(hash));
        for(int x=1;x<=1000000;x++)
        {
            int sum=0;
            sum=c-a*x;
            if(sum<0) break;
            if(sum>1000000) break;
            hash[sum]++;
        }
        for(int y=1;y<=1000000;y++)
        {
            int sum=0;
            sum=b*y;
            if(sum>1000000) break;
            if(hash[sum]) count++;
        }
        cout<<count<<endl;
    }
    return 0;
}