UVA
巧克力Fyy
路漫漫其修远兮,吾将上下而求索。
展开
-
UVA10179 Irreducable Basic Fractions【数论 欧拉函数】
题目链接:10179 - Irreducable Basic Fractions A fraction m / n is basic if 0 ≤ m < n and it is irreducible if gcd(m, n) = 1. Given a positive integer n, in this problem you are required to find out the...原创 2018-07-24 16:52:44 · 231 阅读 · 0 评论 -
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 p...原创 2018-07-22 21:08:36 · 286 阅读 · 0 评论