/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

96 votes176 views6 answers
Read json file
Python
-2 votes156 views1 answer
Configure your keyboards
Python
0 vote130 views1 answer
Pyqt5 book
Python
0 vote206 views1 answer
Adam optimizer keras learning rate degrade
Python
0 vote238 views1 answer
Code=H18 desc="Server Request Interrupted" django
Python Django
0 vote190 views1 answer
Django template render dict
Python Django
1 vote204 views1 answer
Exception: ROM is missing for space_invaders, see https://github.com/openai/atari-py#roms for instructions site:stackoverflow.com
Python
2 votes166 views1 answer
How to split and keep delimiter at the same line in python
Python
2 votes160 views2 answers
Payizone
Python
0 vote158 views1 answer
Python Sorted Word frequency count
Python