F-Number theory

The question of the coprime, the beginning of the topic is not how to read, then went to Baidu a bit, read some problem-solving report, and then have the idea, and then try to write slowly

#include <iostream>  #include <algorithm>  using namespace std;    int gcd (int n,int m)  {      while (n%m!=0)      {          int temp;          temp=m;          m=n%m;          n=temp;      }      return m;  }    int main ()  {      int t,n,m;      while (scanf ("%d", &t)!=eof)      {while          (t--)          {              scanf ("%d%d", &n,&m);              if (n<m)                  swap (n,m);              int FLAG=GCD (n,m);              if (flag==1)                  printf ("no/n");              else                  printf ("yes/n");          }      }      return 0;  }  

　　

F-Number theory