CodeSolved

A comprehensive source of programming questions and exercises

Three -digit individual numbers

Practice Easy 1239/ Download 390 Views

Write a program that kidneyThree -digit individual numbersDisplay.

19 Answers

This answer is only visible to premium members
This answer is only visible to premium members
This answer is only visible to premium members
let msg = 'error'
alert(msg) 
This answer is only visible to premium members
This answer is only visible to premium members

This answer is only visible to premium members

Subscription is currently unavailable.
This answer is only visible to premium members
This answer is only visible to premium members
This answer is only visible to premium members
let msg = 'error'
alert(msg) 
This answer is only visible to premium members
This answer is only visible to premium members

This answer is only visible to premium members

Subscription is currently unavailable.
This answer is only visible to premium members
This answer is only visible to premium members
This answer is only visible to premium members
let msg = 'error'
alert(msg) 
This answer is only visible to premium members
This answer is only visible to premium members

This answer is only visible to premium members

Subscription is currently unavailable.
number=int(input("enter a number:"))
if 99<number>1000 and number%2!=0:
    print(f"{number}is an odd and three_digit number.")
else:
    print(f"{number}is not an odd and three_digit number.")
fard = []
for i in range(100,1000):
    if i % 2 !=0:
        fard.append(i)
else:
    print(fard)
import time
a=101
tm=time.sleep
while a<1000:
    print(a)
    a+=2
    tm(0.5)
Saleh1391 Download Python
number1 = 100
new_list = []
while number1 < 1000 :
    number1 += 1
    if number1 % 2 != 0 :
        new_list.append(number1)
print(new_list)
Emrimo Download Python
list_number = []
def number(n) :
    if n > 1000 :
        return
    if n % 2 != 0 :
        list_number.append(n)
    number(n + 1)
number(100)
print(list_number)
Emrimo Download Python
<< Previous page 1 2 Next page >>

Submit answer

Submitting answers is currently unavailable.

×
×
Close