绝尘

Given the value of N, you will have to find the value of G. The definition of G is given below: G=∑i=1n∑j=i+1nGCD(i,j)G= \sum\limits_{i=1}^{n} \sum\limits_{j=i+1}^nGCD(i,j) Here GCD(i, j) means the gr

HDU【5793】——A Boring QuestionHDU【5794】——A Simple ChessHDU【5795】——A Simple NimTo My GirlfriendHDU【5802】——Windows 10

Bzoj【2257】: [Jsoi2009]——瓶子和燃料【Bzoj】2299: [HAOI2011]——向量

【BZOJ】3122：【Sdoi2013】-随机数生成器【Bzoj】2242: [SDOI2011]——计算器离散对数大步小步算法bsgs

HDU【5763】——Another Meaning Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAs is known to all, in many cases, a word has two meanings. Such as “he

A. Opponents time limit per test 1 second memory limit per test 256 megabytesArya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents ha

All the people in the byteland want to stand in a line in such a way that no person stands closer to the front of the line than his father. You are given the information about the people of the bytela

Farey Sequence Time Limit: 1000MS Memory Limit: 65536KDescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b)

Relatives Time Limit: 1000MS Memory Limit: 65536KDescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime

Primitive Roots Time Limit: 1000MS Memory Limit: 10000KDescriptionWe say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is e

HDU【5832】——A water problemHDU【5833】——Zhu and 772002HDU【5834】——Magic boy Bi Luo with his excited treeHDU【5835】——DanganronpaHDU【5839】——Special TetrahedronHDU【5842】——Lweb and String