@@ -29,4 +29,22 @@ else:
if inq is not 1:
assert True
if inq is not 0:
- assert False
+ assert False
+
+assert pow(2,5000,2**59-1) == 17592186044416
+def g(x):
+ return x
+def f(x):
+assert (g(1), 2) == (1, 2)
+assert (
+ g(1),
+ 2
+) == (1, 2)
+assert f((
+)) == (1, 2)
@@ -1,15 +0,0 @@
-def g(x):
- return x
-def f(x):
-
-assert (g(1), 2) == (1, 2)
-assert (
- g(1),
- 2
-) == (1, 2)
-assert f((
-)) == (1, 2)