题目链接:HDU_1576
题目说明:
乘法逆元的应用,测一发模板(用模线性方程做的)
代码:
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
long long extend_gcd(long long a,long long b,long long &x,long long &y){
if(b==0){
x=1,y=0;
return a;
}
long long r=extend_gcd(b,a%b,y,x);
y-=a/b*x;
return r;
}
vector<long long> modular_linear_equation(long long a,long long b,long long n)
{
long long x,y;
long long d=extend_gcd(a,n,x,y);
vector<long long> ans;
ans.clear();
if(b%d==0)
{
x%=n,x+=n,x%=n;
ans.push_back(x*(b/d)%(n/d));
for(long long i=1;i<d;i++)
ans.push_back((ans[0]+i*n/d)%n);
}
return ans;
}
int main()
{
int T, a, b, n=9973;
scanf("%d",&T);
while(T--)
{
scanf("%d %d",&a,&b);
vector<long long> vec=modular_linear_equation(b,1,n);
printf("%d\n",(a*vec[0])%n);
}
return 0;
}
总结:
大家,新年快乐~