hdu 4993 Revenge of ex-Euclid（水题）

Revenge of ex-Euclid

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 686    Accepted Submission(s): 404

Problem Description

In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout's identity, that is integers x and y such that ax + by = gcd(a, b).
---Wikipedia

Today, ex-Euclid takes revenge on you. You need to calculate how many distinct positive pairs of (x, y) such as ax + by = c for given a, b and c.

 

Input

The first line contains a single integer T, indicating the number of test cases. 

Each test case only contains three integers a, b and c.

[Technical Specification]
1. 1 <= T <= 100
2. 1 <= a, b, c <= 1 000 000

 

Output

For each test case, output the number of valid pairs.

 

Sample Input

  
  

   
   2
1 2 3
1 1 4
  
  

 

Sample Output

  
  

   
   1
3
  
  

 

题意：求ax+by=c，abxy都是正整数，问一共有几组解(x,y)

思路：被题目误导了，在扩展欧几里得上改了很久一直WA。  后来发现是个水题。。直接枚举x就好了，最多枚举1000000一开始还以为过不了。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define LL long long

int main()
{
    LL T,x,y;
    LL a,b,c;
    scanf("%lld",&T);
    while(T--)
    {
        scanf("%lld %lld %lld",&a,&b,&c);
        LL ans=0;
        for(LL i=1;;i++)
        {
            if((c-a*i)/b<=0) break;
            if((c-a*i)%b!=0) continue;
            ans++;
        }
        printf("%lld\n",ans);
    }
    return 0;
}