Alex_McAvoy的博客

【概念】1.公约数：有 k 个非零整数，若，s.t.，则称 d 为的公约数。2.最大公约数：公约数中最大的一个数称为最大公约数，记为：注： ① 最大公约数一定是存在的，其最小值为 1。 ② 当 GCD=1 时，则称这些数是互质的。 ③ 公约数一定是最大公约数的约数。3.公倍数：有 k 个非零整数，若，s.t.，则称 d 为的公倍数。4.最小...

Problem DescriptionTwo positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all relatively prime to 2006.Now y...

Problem DescriptionA frog has just learned some number theory, and can't wait to show his ability to his girlfriend.Now the frog is sitting on a grid map of infinite rows and columns. Rows are n...

题目描述输入2个正整数x0,y0​(2≤x0​<100000,2≤y0​<=1000000),求出满足下列条件的P,Q的个数条件:P,Q是正整数 要求P,Q以x0​为最大公约数,以y0​为最小公倍数.试求:满足条件的所有可能的2个正整数的个数.输入输出格式输入格式：2 个正整数x0​,y0​输出格式：1个数，表示求...

【题目描述】有两堆石子,两个人轮流去取。每次取的时候,只能从较多的那堆石子里取,并且取的数目必须是较少的那堆石子数目的整数倍，最后谁能够把一堆石子取空谁就算赢。比如初始的时候两堆石子的数目是25和7。25 7 --> 11 7 --> 4 7 --> 4 3 --> 1 3 --> 1 0选手1取选手2取选手1取选手2取...

Problem DescriptionSome days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.But I also don't want to use ...

Problem Descriptionnsoldiers are dispatched to somewhere in Byteland. These soldiers are going to set off now, but the target location is not so clear.Assume the target location is at(xe,ye), i...