SPOJ Problems

Author: OmkarPathak

CompetitiveProgramming/SPOJ/P06_SMPDIV.py

@@ -0,0 +1,30 @@
+# Print all integers ai such that ai is divisible by x and not divisible by y, where 1 < ai < n < 100000.
+#
+# Input
+#
+# First, you are given t (t<100) - the number of test cases. In each of the following t lines, 3 integers: n x y.
+#
+# You might assume also that x < n and x is not divisible by y.
+#
+# Output
+#
+# In each of the following t lines, numbers requested in the problem description in the separated by a single space in
+# ascending order.
+#
+# Example
+#
+# Input:
+# 2
+# 7 2 4
+# 35 5 12
+# Output:
+# 2 6
+# 5 10 15 20 25 30
+
+testCases = int(input())
+for _ in range(testCases):
+    n, x, y = map(int, input().split())
+    for i in range(n):
+        if i % x == 0 and i % y != 0:
+            print(i, end = ' ')
+    print()