/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

19 votes293 views3 answers
Convert a list ['Pythons syntax is easy to learn', 'Pythons syntax is very clear'] to a string using ‘&’.
Python
13 votes307 views5 answers
Prime number program in python using function
Python
0 vote333 views1 answer
Sklearn recognising sentences
Python
0 vote291 views1 answer
Outlier removal
Python
2 votes296 views2 answers
Str replace pandas
Python
0 vote306 views1 answer
Get type name python
Python
0 vote314 views1 answer
Reverse row order padnas
Python
0 vote364 views1 answer
Windows how to store filepath as variabley python
Python
0 vote247 views1 answer
Django time cualtulate
Python
51 votes372 views6 answers
Reverse array
Python