cost 84 ms

[英]Given integers C and N, (c <= n <= 10^9), find the amount of pairs i,j (n >= i >= j >= 1), where gcd(i,j) == C

[英]Analyzing runtime of algorithm to find GCD

[英]Given an integer array A of size N. Find the sum of GCD (Greatest Common Divisor) of all elements with their frequency (In JAVA)

[英]Using GCD with a large set of numbers

2022-05-16 12:31:31   2   49    pari-gp

[英]Can I solve this problem with Dynamic Programming?

2022-03-28 10:19:36   1   145    java / lcm

[英]Variable won't increment. - Greatest Common Divisor in java

[英]Is it possible to find a few common multiples of a list of numbers, without them having to be integers?

[英]How to maximize the GCD of n positive integers with minimum number of removals from the sequence that represents them?

Numpy.gcd 使用超过 2 个 arrays

[英]Numpy.gcd using more than 2 arrays

[英]find maximum GCD of an array of triplets

[英]How to find the highest GCD of 2 numbers such that the 2 numbers are from a given range of numbers?

[英]why this javscript code giving undefined as a result? (Calculating GCD), I don't know why it's not entering if block

[英]gcd and lcm with multiple parameters Scheme, DRracket

[英]Number of ways we can partition a set into two subsets such that the GCD of product of the elements in both subsets is minimum