/Python/Let's consider an infinite sequence of digits constructed of ascending powers of 10 written one after another python solution

Let's consider an infinite sequence of digits constructed of ascending powers of 10 written one after another python solution

import math
import sys

f = lambda x: math.sqrt(2.0 * x + 0.25) - 0.5
g = lambda x: f(x) % 1 == 0

inp = map(int, sys.stdin.read().split()[1:])

print(" ".join("1" if g(x-1) else "0" for x in inp))

Source: stackoverflow.com

Similar codes

-1 vote144 views1 answer
Len
Python
0 vote143 views1 answer
Debug console shows blank
Python
7 votes217 views1 answer
Python join paths
Python
7 votes164 views3 answers
How to get all possible combinations in python
Python
12 votes170 views5 answers
Django-cors-headers
Python
1 vote177 views2 answers
Add element to array list python
Python
0 vote147 views1 answer
Dataframe python unique values rows
Python
0 vote173 views1 answer
Connect to spark cluster
Python
168 votes251 views6 answers
How to upgrade pip in python
Python
0 vote177 views1 answer
Django allauth Reverse for 'password_reset_confirm' not found. 'password_reset_confirm' is not a valid view function or pattern name.
Python Django