UVA 11424 UVA 11424 GCD - Extreme (I) (欧拉函数)

Given the value of N, you will have to find the value of G. The definition of G is given below: i< N j≤N G= GCD(i,j) i=1 j=i+1 Here GCD(i,j) means the greatest common divisor of integer i and integer

>>阅读原文<<