/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

0 vote221 views1 answer
Poision in chinese
Python
0 vote212 views1 answer
Mad python
Python
0 vote231 views1 answer
Regex emaple py
Python
0 vote219 views1 answer
How to let the user input desmials in python
Python
0 vote286 views2 answers
Spark mllib tutorial
Python
48 votes216 views2 answers
Python regex tester
Python
1 vote208 views1 answer
Resto division python
Python
10 votes265 views5 answers
Python with file
Python
-1 vote251 views1 answer
Converting multipage tiff to pdf python
Python
1 vote256 views1 answer
ValueError: logits and labels must have the same shape ((None, 1) vs (None, 2))
Python