与公约数有关的问题

第一道题是2015年浙江理工12月比赛的一道题

4216: Jug Hard

Description

You have two empty jugs and tap that may be used to fill a jug. When filling a jug from the tap, you can only fill it completely (i.e., you cannot partially fill it to a desired level, since there are no volume measurements on the jug).

You may empty either jug at any point.

You may transfer water between the jugs: if transferring water from a larger jug to a smaller jug, the smaller jug will be full and there will be water left behind in the larger jug.

Given the volumes of the two jugs, is it possible to have one jug with some specific volume of water?

Input

The first line contains T, the number of test cases (1 ≤ T 100 000). Each test case is composed of three integers: a b d where a and b (1 ≤ a, b ≤ 10 000 000) are the volumes of the two jugs, and d is the desired volume of water to be generated. You can assume that d ≤ max(a,b).

Output

For each of the T test cases, output either Yes or No, depending on whether the specific volume of water can be placed in one of the two jugs.

Sample Input

3
8 1 5
4 4 3
5 3 4

Sample Output

Yes
No
Yes

通过推理可以发现，这题就是求a与b的最大公约数，然后看看d是不是这个约数的倍数。代码如下：

  #include<cstdio>
  int gcd(int a, int b){
      return b ? gcd(b, a%b) : a;
  }
    int main(){
    int T, a, b, d;
    scanf("%d", &T);
    while(T--){
         scanf("%d%d%d", &a, &b, &d);
         puts(d % gcd(a, b) ? "No" : "Yes");
     }
  }

第二道题目是很久以前在杭电上练的一道丢手帕问题

hide handkerchief

Problem Description

The Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game called hide handkerchief with my friends.
Now I introduce the game to you. Suppose there are N people played the game ,who sit on the ground forming a circle ,everyone owns a box behind them .Also there is a beautiful handkerchief hid in a box which is one of the boxes .
Then Haha(a friend of mine) is called to find the handkerchief. But he has a strange habit. Each time he will search the next box which is separated by M-1 boxes from the current box. For example, there are three boxes named A,B,C, and now Haha is at place of A. now he decide the M if equal to 2, so he will search A first, then he will search the C box, for C is separated by 2-1 = 1 box B from the current box A . Then he will search the box B ,then he will search the box A.
So after three times he establishes that he can find the beautiful handkerchief. Now I will give you N and M, can you tell me that Haha is able to find the handkerchief or not. If he can, you should tell me "YES", else tell me "POOR Haha".

 

Input

There will be several test cases; each case input contains two integers N and M, which satisfy the relationship: 1<=M<=100000000 and 3<=N<=100000000. When N=-1 and M=-1 means the end of input case, and you should not process the data.

 

Output

For each input case, you should only the result that Haha can find the handkerchief or not.

 

Sample Input

  
  

   
   3 2
-1 -1
  
  

 

Sample Output

  
  

   
   YES
  
  
  
  


  
  

这道题是判断两数是否互质问题，以下是代码：

#include <stdio.h>
int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}
int main()

{
    int n,m;
    while(scanf("%d%d",&n,&m),n!=-1&&m!=-1)
    {
         if(gcd(n,m)==1) puts("YES");
         else puts("POOR Haha");
    }
    return 0;
}

更多类似这样的题目我会在我遇到以后整理出来。