about summary refs log tree commit diff
path: root/codechef/matchs.c
diff options
context:
space:
mode:
authorNguyễn Gia Phong <vn.mcsinyx@gmail.com>2019-05-14 11:55:28 +0700
committerNguyễn Gia Phong <vn.mcsinyx@gmail.com>2019-05-14 11:55:28 +0700
commit267b2db7addc95c5eebb8bfb9ceeb7b953d85732 (patch)
tree8a9669a99fccaf520b3cb690143e539c58a92ca5 /codechef/matchs.c
parent887c286cc8228e13f85b587ab92b37e920161eb9 (diff)
downloadcp-267b2db7addc95c5eebb8bfb9ceeb7b953d85732.tar.gz
I has always believed that I'm good at solving math problems
Turns out I has been wrong all the time. And I'm not alone.
Diffstat (limited to 'codechef/matchs.c')
-rw-r--r--codechef/matchs.c23
1 files changed, 23 insertions, 0 deletions
diff --git a/codechef/matchs.c b/codechef/matchs.c
new file mode 100644
index 0000000..7831378
--- /dev/null
+++ b/codechef/matchs.c
@@ -0,0 +1,23 @@
+#include <stdio.h>
+#define MAX(x, y) (((n) > (m)) ? (n) : (m))
+#define MIN(x, y) (((n) > (m)) ? (m) : (n))
+
+int match(long long x, long long y, int ari)
+{
+	long long mod = x % y;
+	return (mod && x - y == mod) ? match(y, mod, !ari) : ari;
+}
+
+int main()
+{
+	int t;
+	long long n, m;
+
+	scanf("%d", &t);
+	while (t--) {
+		scanf("%lld %lld", &n, &m);
+		puts(match(MAX(n, m), MIN(n, m), 1) ? "Ari" : "Rich");
+	}
+
+	return 0;
+}