ZOJ 1003 Crashing Balloon

#include <iostream>
#include <algorithm>

using namespace std;

bool FlagA, FlagB;

void dfs(int A, int B, int MaxNumber)
{
if (FlagA == true)
{
return;
}
if (A == 1 && B == 1)  // it's possible to get A and B points
{
FlagA = true;
return;
}
if (B == 1)    // it's possible to get B points
{
FlagB = true;
}
for (int i = MaxNumber; i > 1; i--)
{
if (A%i == 0)
{
dfs(A / i, B, i - 1);
}
if (B%i == 0)
{
dfs(A, B / i, i - 1);
}
}
}

int main()
{
int A, B;
while (cin >> A >> B)
{
if (A < B)
{
swap(A, B);
}
FlagA = false;
FlagB = false;
dfs(A, B, 100);
if (!FlagA && FlagB)     // it's impossible to get A and B points
{						//but it's possible to get B points
cout << B << endl;
}
else
{
cout << A << endl;
}
}
return 0;
}