Uniform Generator mathematical questions

[Cpp]
/* This type of question has been written twice. He is the first player in the first week. It is the result of two numbers, a, B. amodb, and mod B. If all the remainder can fill all the numbers in 0 -- mod-1.
The condition is met. In this way, you only need to determine the quality of a and B. */
# Include <stdio. h>
Int gcd (int a, int B)
{
Return B = 0? A: gcd (B, a % B );
}
Int main ()
{
Int a, B;
While (scanf ("% d", & a, & B) = 2)
{
Printf ("% 10d % 10d", a, B );
If (gcd (a, B) = 1) printf ("Good Choice \ n ");
Else printf ("Bad Choice \ n ");
Printf ("\ n ");
}
Return 0;
}