241 teams scored 14591 points on this task, for a maximum score of 100, an average score of 61 and a median score of 61.
Evil George has kidnapped the princess. Now Drogo the dragon comes to rescue her. George prefers challenging the dragon intellectually rather than fighting him, so he tells Drogo: Can you help the dragon to solve this challenge and save the princess? Beware, George might be so evil that there is no possible answer! Note: the greatest common divisor of two positive integer numbers A and B is the greatest integer k such that both A and B are multiples of k.