subject
Computers and Technology, 21.12.2020 16:20 tai1611

size = 6 def get_numbers(num): numbers = [] user_input = input('Enter %s integers:\n' % num) i = 0 for token in user_input. split(): number = int(token) # Convert string input into integer numbers. append(number) # Add to numbers list print(i, number) i += 1 return numbers def print_all_numbers(numbers): # Print numbers print('Numbers:') def print_odd_numbers(numbers): # Print all odd numbers print('Odd numbers:') def print_negative_numbers(numbers): # Print all negative numbers print('Negative numbers:') nums = get_numbers(size) print_all_numbers(nums) print_odd_numbers(nums) print_negative_numbers(nums)

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 14:30
Create a pseudocode design to prompt a student for their student id and the titles of the three classes they want to add. the solution should display the student’s id and a total bill. • bill a student using the following rules: o students can only add up to 3 classes at a time.
Answers: 3
question
Computers and Technology, 22.06.2019 14:30
What percentage of companies is projected to use social media to locate new employees in 2012
Answers: 2
question
Computers and Technology, 23.06.2019 00:00
Suppose you have 9 coins and one of them is heavier than others. other 8 coins weight equally. you are also given a balance. develop and algorithm to determine the heavy coin using only two measurements with the of the balance. clearly write your algorithm in the form of a pseudocode using the similar notation that we have used in the class to represent sorting algorithms
Answers: 1
question
Computers and Technology, 23.06.2019 00:10
My has been slow anyone else’s ?
Answers: 1
You know the right answer?
size = 6 def get_numbers(num): numbers = [] user_input = input('Enter %s integers:\n' % num) i = 0 f...
Questions
question
Mathematics, 17.10.2021 14:00
question
Mathematics, 17.10.2021 14:00
question
Computers and Technology, 17.10.2021 14:00
Questions on the website: 13722360