阅读背景:

UVA10104 Euclid Problem【数论 扩展欧几里得算法】

来源:互联网 

题目链接:10104 - Euclid Problem

From Euclid it is known that for any positive integers A and B there exist such integers X and Y that AX + BY = D, where D is the greatest common divisor of A and B. The problem is to find for given A and B corresponding X, Y and D.From Eucli




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: