1. Input two integer values. The first one shall acceptany integer from 0-9 and the other one shall take anon-zero positive integer.2. Using a while loop, count how many of the firstinteger (0-9) is present in the digits of the secondinputted integer and print the result (see sampleinput and output for example).3. Tip #1: You have to use your knowledge from theprevious problems in looping through the digits of anumber: % 10 to get the rightmost digit, while / 10 toremove the rightmost digit. Make sure to solve theprevious problems first.Instructions1. Create two variables assigned to an input() function.The first one shall accept any integer from 0-9 andthe other one shall take a random positive integer. Allthe needed values are to be inputted in one singleline.2. Using a while loop, count how many of the firstinteger (0-9) is present in the digits of the secondinputted integer and print the result (see sampleinput and output for example).InputA line containing two integers separated by a space.2 124218OutputA line containing an integer.

#Note no programming language is mentioned so I was used c++ programming…

Input two integer values. The first or nall accept any integer from 0-9 and the other one shall take a non-zero positive integer. 2. Using a while loop, count how many of the first integer (0-9) is present in the digits of the second inputted integer and print the result (see sample input and output for example). 3. Tip #1: You have to use your knowledge from the previous problems in looping through the digits of a number: % 10 to get the rightmost digit, while / 10 to remove the rightmost digit. Make sure to solve the previous problems first. ructions 1. Create two variables assigned to an input() function. The first one shall accept any integer from 0-9 and the other one shall take a random positive integer. All the needed values are to be inputted in one single line. 2. Using a while loop, count how many of the first integer (0-9) is present in the digits of the second inputted integer and print the result (see sample input and output for example).

Input two integer values. The first or nall accept any integer from 0-9 and the other one shall take a non-zero positive integer. 2. Using a while loop, count how many of the first integer (0-9) is present in the digits of the second inputted integer and print the result (see sample input and output for example). 3. Tip #1: You have to use your knowledge from the previous problems in looping through the digits of a number: % 10 to get the rightmost digit, while / 10 to remove the rightmost digit. Make sure to solve the previous problems first. ructions 1. Create two variables assigned to an input() function. The first one shall accept any integer from 0-9 and the other one shall take a random positive integer. All the needed values are to be inputted in one single line. 2. Using a while loop, count how many of the first integer (0-9) is present in the digits of the second inputted integer and print the result (see sample input and output for example).

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

using iostream domain and for loop
What is the solution of this problem (using java language)?
3. Out of the given loops, which loop/s will execute infinitely. a. for(; true; ) b. for(; false;) c. for(; 2==2; )
for a in range (7,20,3) : The above loop will run times а. 5 b. 7 С. б d. 4
Provide trace table for the following loops: int s = 1; int n =1; do { s = s + n; n++; } while ( s < 10 * n);
Write a while loop to add up the values 1 to 10 and print the sum once the loop has finished.
Use the variables k and total to write a while loop that computed the sum of the squares of the first 50 counting numbers, and assigns that value to total. Thus your code should assign 1*1+2*2+3*3+...+49*49+50*50 to total. Use no variables other than k and total.
Write a loop that counts and outputs the number of odd integers in the range 25 (exclusive) to 125 (inclusive).