Question: Code the following in C++ An integer X is cool if it has a primitive root modulo X. The coolness of a non-empty set of N distinct integers S = {*1, 2, ..., æN} is the number of cool divisors of , Xi. You are given four integers L, R, A and B. Let S be the set containing all integers between L and R (inclusive). Consider all non-empty subsets of S with size between A and B (inclusive). Find the sum of values of coolness of all these subsets. Since this sum can be huge, compute it modulo 998, 244, 353. Example Input: 3 3412 1 10 15 20 1818 Example Output: 10 1703

Question: Code the following in C++ An integer X is cool if it has a primitive root modulo X. The coolness of a non-empty set of N distinct integers S = {*1, 2, ..., æN} is the number of cool divisors of , Xi. You are given four integers L, R, A and B. Let S be the set containing all integers between L and R (inclusive). Consider all non-empty subsets of S with size between A and B (inclusive). Find the sum of values of coolness of all these subsets. Since this sum can be huge, compute it modulo 998, 244, 353. Example Input: 3 3412 1 10 15 20 1818 Example Output: 10 1703

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

Describe an efficient way of putting a VECTOR representing a deck of n cards into random order in C++. You may use the function randomlnt(n), which returns a random number between 0 and n-1, inclusive. Your method should guarantee that every possible ordering is equally likely. What is the running time of your function?
Code in C++ only. Correct answer will upvoted else downvoted. framework of size n×m, with the end goal that every cell of it contains either 0 or 1, is considered lovely if the total in each adjoining submatrix of size 2×2 is actually 2, i. e. each "square" of size 2×2 contains precisely two 1's and precisely two 0's. You are given a network of size n×m. At first every cell of this network is unfilled. How about we indicate the cell on the crossing point of the x-th line and the y-th segment as (x,y). You need to handle the inquiries of three sorts: x y −1 — clear the cell (x,y), in case there was a number in it; x y 0 — compose the number 0 in the cell (x,y), overwriting the number that was there already (assuming any); x y 1 — compose the number 1 in the cell (x,y), overwriting the number that was there beforehand (assuming any). After each question, print the number of ways of filling the unfilled cells of the grid so the subsequent network is delightful. Since the appropriate…
the language is C++, please take a screenshot of your output. (Recursive binary search) The binary search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the binary search algorithm. Also, write a version of the sequential search algorithm that can be applied to sorted lists. Add this operation to the class orderedArrayListType for array-based lists. Moreover, write a test program to test your algorithm.
Write a definition for the following C++ function:bool up_then_down(const int* arr, int n);// REQUIRES: n >= 1; elements arr[0] ... a[n-1] exist.// PROMISES: Returns true if the sequence of element values is strictly increasing// from a[0] to the first appearance of the maximum value, then strictly decreasing// from the first appearance of the maximum value to a[n - 1].// Otherwise, returns false. EXAMPLES (maximum values are bold):// The return value would be true for all of these sequences ...// {10}, {10, 20}, {20, 10}, {10, 20, 30, 25}, {10, 20, 30, 25, -2}// But would be false for all of these ...// {10, 20, 10, 15}, {10, 10, 20, 15}, {10, 20, 20, 15}.
In C++ Question A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example: head refers to the list of nodes 1 → 2 → 3 → 1 → NULL. There is a cycle where node 3 points back to node 1, so return 1. Function Description: Complete the has cycle function provided in the moodle assignment folder. It has the following parameter: • SinglyLinkedListNode pointer head: a reference to the head of the list. Returns: • int: 1 if there is a cycle or 0 if there is not. Note: if the list is empty, head will be null. Input Format: The code stub reads from stdin and passes the appropriate argument to your function. The custom test cases format will not be described for this question due to its complexity. Expand the section for the main function and review the code if you would like to figure out how to create…
I am having a vector of pair of integers. Write a comparator that sorts the vector on the basis of increasing order of the second element of the pair. C++ by default sorts it on the basis of the first element of the vector. But I want the vector to be sorted on the basis of the second element.
Using C++, code the following problem: In this problem, we are given a knapsack of fixed capacity C. We are also given a list of N objects, each having a weight W(I) and profit P(I). We can put any subset of the objects into the knapsack, as long as the total weight of our selection does not exceed C. The goal is to maximize the total profit, which is the sum of the profits of each object we put into the knapsack. Example: Input: C = 3 W: 1 2 3 P: 100 5 50 Selected Items: 1 2 Explanation: Possible selections that can be put in the knapsack are: 1 with profit 100 2 with profit 5 3 with profit 50 1 and 2 with profit 105 Note that in this problem, there is no need that the some of weights be exactly C. Hence, in this example, 1 is a valid solution but since the profit is lower than the maximum, is not the final answer. Input Format First line is C. Second line is the number of objects, N. The next N lines, each line contains two numbers: the first number is the weight of an…
Please written by computer source Question 1: Suppose we wish to write a procedure that computes the inner product of two vectors u and v. An abstract version of the function has a CPE of 14–18 with x86- 64 for different types of integer and floating-point data. By doing the same sort of transformations we did to transform the abstract program combine1 into the more efficient combine4, we get the following code: Our measurements show that this function has CPEs of 1.50 for integer data and 3.00 for floating-point data. For data type double, the x86-64 assembly code for the inner loop is as follows: Assume that the functional units have the characteristics listed in Figure 5.12. **See last page for figures A. Diagram how this instruction sequence would be decoded into operations and show how the data dependencies between them would create a critical path of operations, in the style of textbook Figures 5.13 and 5.14. vmovsd vmovsd vmulsd vaddsd | | | |…
C++ only Sam and Sangu played a game. First, the Sam gives Sangu a sequence of different numbers N a1, a2,., an (not really set) and the number K. Sangu should build all the sequences of the series in length K. In each row, he should write down the product of the numbers K - 2: all the features of the following except the smallest and finest element. Sangu wins the game if he can write down all these numbers and tell Sam their product (module 10° +7, as it can be very large). However, Sangu is a lazy child and wants to help him win the game. Count the number Sangu has to tell Sam! Input 1 43 1234 Output 36
code required for python: For this question, you will be required to use the binary search to find the root of some function f(x)f(x) on the domain x∈[a,b]x∈[a,b] by continuously bisecting the domain. In our case, the root of the function can be defined as the x-values where the function will return 0, i.e. f(x)=0f(x)=0 For example, for the function: f(x)=sin2(x)x2−2f(x)=sin2(x)x2−2 on the domain [0,2][0,2], the root can be found at x≈1.43x≈1.43 Constraints Stopping criteria: ∣∣f(root)∣∣<0.0001|f(root)|<0.0001 or you reach a maximum of 1000 iterations. Round your answer to two decimal places. Function specifications Argument(s): f (function) →→ mathematical expression in the form of a lambda function. domain (tuple) →→ the domain of the function given a set of two integers. MAX (int) →→ the maximum number of iterations that will be performed by the function. Return: root (float) →→ return the root (rounded to two decimals) of the given function. my code below , however as…
Write a function that takes a matrix of order 3 and prints the transpose of it. The transpose should be stored in a different matrix.Test the function in main().For example:Matrix =1 2 34 5 67 8 9Transpose =1 4 72 5 83 6 9 write code for it in c++
Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the nodes which are the right child of another node. The root of the tree is not a child of any node. Consider the following class definitions while writing your code.