http://acm.hdu.edu.cn/showproblem.php?pid=4993
Revenge of ex-Euclid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1093 Accepted Submission(s): 628
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
Source
BestCoder Round #9
ax + by = c的解的个数(x,y);
AC代码:
#include <iostream>
#include <cstdio>
using namespace std;
int a, b, c;
int ans;
int T;
int main() {
while(cin >> T) {
while(T--) {
ans = 0;
cin >> a >> b >> c;
for(int i = 1; i * a < c; i++) {
if((c - a * i) % b == 0) ans++;
}
cout << ans << endl;
}
}
return 0;
}