海岛Blog

Given the value of N, you will have to find the value of G. The definition of G is given below:G=∑i=1i<N∑j=i+1j≤NGCD(i,j)G =\sum_{i=1}^{i<N}\sum_{j=i+1}^{j≤N}GCD(i, j)G=i=1∑i<N​j=i+1∑j≤N​GCD(i,j)    Here GCD(i, j) means the g

Consider the following method of enumerating all rational numbers between 0 and 1 (inclusively).for d = 1 to infinity do for n = 0 to d do if gcd(n,d) = 1 then print n/dwhere gcd(n, d) is the greatest common divisor of n and d.   &nbs

The depth of phi value of a number is denoted by the number of steps required before it reaches 1. An example will make it very clear.ϕ(13) = 12 . . . step1ϕ(12) = 4 . . . step2ϕ(4) = 2 . . . step3ϕ(2) = 1 . . . step1    So the dep

Problem D. Euler FunctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1960 Accepted Submission(s): 1567Problem DescriptionIn number theory, Euler’s totient function φ(n) counts the positiv

找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19060 Accepted Submission(s): 10131Problem Description新年快到了，“猪头帮协会”准备搞一个聚会，已经知道现有会员N人，把会员从1到N编号，其中会长的号码是N号，凡是和会长是老朋友的，那么该会员的号码肯定和N有大于1的公约数，否则

GCD AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5927 Accepted Submission(s): 2749Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after o

The Euler functionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13612 Accepted Submission(s): 5384Problem DescriptionThe Euler function phi is an important kind of function in number theory,

Farey SequenceTime Limit:1000MS Memory Limit:65536K Total Submissions:18635 Accepted:7495 DescriptionThe Farey Sequence Fn for any integer n with n &gt;= 2 is the set of ir...

Primitive RootsTime Limit:1000MSMemory Limit:10000KTotal Submissions:4361Accepted:2568DescriptionWe say that integer x, 0 imod p) | 1 <= i <= p-1 } is equa

Fernando won a compass for his birthday, and now his favorite hobby is drawing stars: first, he marks N points on a circumference, dividing it into N equal arcs; then, he connects each point to the kth next point, until returning to the first point. 

Given the value of N, you will have to find the value of G. The definition of G is given below:G=∑i=1i<N∑j=i+1i≤NGCD(i,j)G =\sum_{i=1}^{i<N}\sum_{j=i+1}^{i≤N}GCD(i, j)G=i=1∑i<N​j=i+1∑i≤N​GCD(i,j)    Here GCD(i, j) means the g

When participating in programming contests, you sometimes face the following problem: You know how to calcutale the output for the given input values, but your algorithm is way too slow to ever pass the time limit. However hard you try, you just can’t disc

Visible Lattice PointsTime Limit:1000MS Memory Limit:65536K Total Submissions:8207 Accepted:5041 DescriptionA lattice point (x,y) in the first quadrant (xandyare intege...

GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5184 Accepted Submission(s): 2790Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a

RelativesTime Limit:1000MSMemory Limit:65536KTotal Submissions:15625Accepted:7932DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two int...

Goffi and GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1976 Accepted Submission(s): 697Problem DescriptionGoffi is doing his math homework and he finds an equality on his text book: gcd(n

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