UVa 11388 & Silk Silks

have been thinking of silk to do not paste the question ... Later I think it is affixed to the bar ... Anyway, no one read ... blog is open to their own look ... Occasionally bored to play blog also seems to live very full ...

Test instructions

For a gcd and LCM to satisfy ah their smallest A and B.

SOL:

And thinking about the decomposition of the mass factor ... On the other GCD small number of GCD also can not become G ah ... This is not silk ... The youngest is not the gcd ...

Number theory begins with a few silk problems = = ...

　　

Code:

    #include <cstdio>      #include <cstdlib>      #include <cstring>            int main ()      {          int n,g, L;           while (scanf ("%d", &n)! = EOF) for               (int t = 1; t <= N; + + t) {                  scanf ("%d%d", &g,&l);                  if (l%g = = 0)                       printf ("%d%d\n", g,l);                  else printf (" -1\n");              }          return 0;      }  

UVa 11388 & Silk Silks