From 8a8c8b4dbad5988d1df209271df210b7b0444f62 Mon Sep 17 00:00:00 2001
From: Titouan Rigoudy <titouan.rigoudy@gmail.com>
Date: Sat, 27 Sep 2014 02:18:37 -0400
Subject: [PATCH] Solved Sherlock and GCD

---
 sherlock_and_gcd/sherlock_and_gcd.py | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 sherlock_and_gcd/sherlock_and_gcd.py

diff --git a/sherlock_and_gcd/sherlock_and_gcd.py b/sherlock_and_gcd/sherlock_and_gcd.py
new file mode 100644
index 0000000..fd96f6f
--- /dev/null
+++ b/sherlock_and_gcd/sherlock_and_gcd.py
@@ -0,0 +1,25 @@
+#!/usr/bin/python3
+
+# https://www.hackerrank.com/challenges/sherlock-and-gcd
+
+import sys
+from fractions import gcd
+
+def gcd_all(numbers):
+    res = 0
+    for n in numbers:
+        res = gcd(res, n)
+    return res
+
+def main():
+    T = int(sys.stdin.readline())
+    for _ in range(T):
+        N = int(sys.stdin.readline())
+        A = [ int(x) for x in sys.stdin.readline().split() ]
+        if gcd_all(A) == 1:
+            print('YES')
+        else:
+            print('NO')
+
+if __name__ == '__main__':
+    main()
\ No newline at end of file