Given two integers n1, n2 greater than 1, find out if they have common divisors or are prime to each other. Return "true" if they have common divisors and "false" if they are prime to each other.
It seems to me that the logic of the test suite is reversed. You're asking if the numbers are coprime and yet want 0 (false) when they are.
@Guillaume: Your are right.
I re-wrote the text. The english got worse, but the clarity increased, I hope:))
I submitted this just to see if one can get away with a blatant cheat!
Until the test suite is changed, yes. Yes you can.
Well, test suite changed :)
Does the "tf = n1==27" still work? :)
My cheat does not pass new test suite, but tf = n2==123 does.
@Are Mjaavatten: Your are terrible:). I will change (improve:)) again the test-suite.
1360 Solvers
160 Solvers
216 Solvers
391 Solvers
Check that number is whole number
182 Solvers