2. Skipping Numbers Divisible by 7 Between a Range Using Continue by CodeChum Admin Ask the user to input two integers, x and y. Then, compute for the sum of all numbers that are not divisible by 7 from x to y (inclusive) and print it on the next line. Implement by using continue to skip numbers divisible by 7. Sample Output 1 Enter integer x: 1 Enter integer y: 5 Sum of all numbers: 15 Sample Output 2 Enter integer x: 3 Enter integer y: 7 Sum of all numbers: 18 Sample Output 3 Enter integer x: 8 Enter integer y: 14 Sum of all numbers: 63

2. Skipping Numbers Divisible by 7 Between a Range Using Continue by CodeChum Admin Ask the user to input two integers, x and y. Then, compute for the sum of all numbers that are not divisible by 7 from x to y (inclusive) and print it on the next line. Implement by using continue to skip numbers divisible by 7. Sample Output 1 Enter integer x: 1 Enter integer y: 5 Sum of all numbers: 15 Sample Output 2 Enter integer x: 3 Enter integer y: 7 Sum of all numbers: 18 Sample Output 3 Enter integer x: 8 Enter integer y: 14 Sum of all numbers: 63

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

/*code Kth Largest Factor A positive integer d is said to be a factor of another positive integer N if when N is divided by d, the remainder obtained is zero. For example, for number 12, there are 6 factors 1, 2, 3, 4, 6, 12. Every positive integer k has at least two factors, 1 and the number k itself.Given two positive integers N and k, write a program to print the kth largest factor of N. Input Format: The input is a comma-separated list of positive integer pairs (N, k). Output Format: The kth highest factor of N. If N does not have k factors, the output should be 1. Constraints: 1<N<10000000000 1<k<600. You can assume that N will have no prime factors which are larger than 13..
Eulers number e is used as the base of natural logarithm. It may be approximated using the formula e=1/0!+1/1!+1/2!…1/(n-1)!+1/n! When n is sufficiently large. Write a program that approximates e using a loop that terminates when the difference between the two successive values of e is less than 0.0000001.
Write a program that calculates the equivalent resistance of a circuit. n electrical resistors with resistance values R1, R2,.., Rn are said to be connected in parallel if the same voltage is applied across each. Their equivalent resistance Reg is related to the values R1, R2, ..., Rn by: 1 1 1 1 + +...+ R R R, R. "eq Write a program that prompts the user to enter the resistance of n resistors. The user should be prompted continuously by using a while loop until a zero or negative value is entered (the program should count the number of resistors n entered by the user and store the values in an array). Use another separate loop to print the resistance values entered by the user and the equivalent resistance Reg. Test your program with R1= 1 kn, R2= 2 kn, R3= 4 kQ and R4= 8 kQ.
JAVA PROGRAMMING LAB Write a program to reduce a user entered number to 1 using the given operations. Your task is to print minimum number of steps is required to do this. Given Operations: If user entered number is even then divide by 2. If user entered number is odd then we can do N + 1 or N - 1.
USE PYTHON A small shop sells 280 different items. Each item is identified by a 3 – digit code. All items that start with a zero (0) are cards, All items that start with a one (1) are sweets, All items that start with a two (2) are stationery and All items that start with a three (3) are toys. Write a program which inputs the 3 – digit code for all 280 items and outputs the number of cards, sweets, stationery and toys.
Given a number n, identify and print which in the given set of numbers are factors of n. Should there be no factors listed in the set of numbers, print "I'm alone". For example, given the number 36 and the set of numbers 2, 3, 5, 7, 12. Only print the numbers which are factors of 36, which are 2, 3, 12. Input The first line contains the number n; The second line contains how many numbers there are in the set of numbers; The third line contains the set of numbers. INPUT: 36 5 2·3·5·7·12 Output The set of numbers that are factors of n separated by a new line in order of appearance. If there are none, print "I'm alone" OUTPUT: 2 3 12
Your task: The sum of entries that are divisible by 8. For example if the input numbers are [-1, -8, -32, 16, -5, -4, 12, 0], the printed result should be -24.
Write a detailed code for Sum of Natural Numbers Using for..Loop in go lang programming language with detailed output for example of sum of natural number till 50. Answer with detailed code and output screenshot.
Write a program that reads from the user a character (‘s’ or ‘a’). ∙ If the character is ‘s’, the program reads 4 numbers from keyboard and then finds their sum. ∙ If the character is ‘a’, the program reads 4 numbers from keyboard and then finds their average. ∙ Otherwise, it prints “Wrong character” Sample Run: Sample Run1: Enter a character (s or a): s Input 4 numbers: 10.5 12 31 44 The sum of these 4 numbers is: 97.5 Sample Run2: Enter a character (s or a): a Input 4 numbers: 10 12 31 44 The average of these 4 numbers is: 24.375 Sample Run3: Enter a character (s or a): d Wrong character
Let n be a nonnegative integer. The factorial of n, written n!, is defined by 0!=1, n! =1*2*3*...n if n >= 1. For example, 4! = 1*2*3*4 = 24. Write a program that prompts the user to enter a nonnegative integer and outputs the factorial of the number.
Three numbersa. Write a program that reads three numbers and prints “all the same” if they are allthe same, “all different” if they are all different, and “neither” otherwise.b. Write a program that reads three numbers and prints “increasing” if they are inincreasing order, “decreasing” if they are in decreasing order, and “neither”otherwise. Here, “increasing” means “strictly increasing”, with each value largerthan its predecessor. The sequence 3 4 4 would not be considered increasing.c. Repeat part b. but before reading the numbers, ask the user whetherincreasing/decreasing should be “strict” or “lenient”. In lenient mode, thesequence 3 4 4 is increasing and the sequence 4 4 4 is both increasing anddecreasing
WATERSORT PROGRAM - JAVA •The aim of Part 2 is to set up the puzzle for the player to solve in Part 3. IMPORTANT NOTE: We are not going to start with 2 empty bottles, but rather with 8 empty slots spread over the 5 bottles as explained in the intro video. Start with 5 empty bottles. Use a random number generator to fill bottles one slot at a time with the colours while keeping 8 slots empty – there is a total of 5*4 = 20 slots – so if we will 12 slots, 8 are free. •Advantage: Easy to create a puzzle with a good mix •Disadvantage: With more colours and bottles and only 2 open bottles for more advanced versions of the game, the result might not be solvable. Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. •Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. •Disadvantage: It is hard to develop an algorithm which…