给出N个固定集合{1,N},{2,N-1},{3,N-2},...,{N-1,2},{N,1}.求出有多少个集合满足:第一个元素是A的倍数且第二个元素是B的倍数。
提示:
对于第二组测试数据,集合分别是:{1,10},{2,9},{3,8},{4,7},{5,6},{6,5},{7,4},{8,3},{9,2},{10,1}.满足条件的是第2个和第8个。
Input
第1行:1个整数T(1<=T<=50000),表示有多少组测试数据。 第2 - T+1行:每行三个整数N,A,B(1<=N,A,B<=2147483647)
Output
对于每组测试数据输出一个数表示满足条件的集合的数量,占一行。
Input示例
2 5 2 4 10 2 3
Output示例
1 2 思路: 扩展欧几里得定理。#include <iostream> #include <cstdio> typedef long long ll; using namespace std; ll N, A, B; ll x, y; ll extgcd(ll a, ll b, ll &x, ll &y) { if (b == 0) { x = 1; y = 0; return a; } ll d = extgcd(b, a % b, x, y); ll t = x; x = y; y = t - (a / b) * y; return d; } ll solve() { ll result = 0; ll d = extgcd(A, B, x, y); ll C = A * B / d; if ((1 + N) % d) { return 0; } else { x = x * ((1 + N) / d); ll r = B / d; x = (x % r + r) % r; if (x == 0) { x += r; } ll temp = N - (x) * A; if (temp < 0) { return 0; } else { result++; result += temp / C; } } return result; } int main() { int T; cin >> T; for (int i = 0; i < T; i++) { cin >> N >> A >> B; cout << solve() << endl; } return 0; }