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

In python
Could you please help me write a C++ code that does the following: experiment with the following STL algorithms. More precisely,write a test driver that uses each algorithm on a vector of integers anda vector of strings. Both of these algorithms are defined in the library filealgorithm and included in the std namespace. (a) replace(start, stop, x, y) replaces all occurrences of element x by a copy of element y in the range [start,stop). Uses ==on elements.(b) max_element(start, stop) returns an iterator that points tothe maximum element in the range [start,stop). Returns stopif the range is empty. Uses < on elements
PLZ write in SML language. Thank you Write a function maxGroup that determines, for a given integer list, the stored number of the longest consecutive group of equal numbers. For example, maxGroup [2, 9, 8, 8, 8, 7, 9, 1] should return 8 since there are three consecutive 8s in the list. Hint: Solve the problem in two steps. First, determine the length of each group of equal numbers. Then, determine which is the largest.
Does it hold for lists? :Write a function holds_for_lists : ’a list -> ’b list -> (’a -> ’b -> bool) -> bool = that takes an ’a list, an ’b list, a function f: ’ a -> ’b ->bool and returns true if and only if • The two list are of the same length, and • (f a b) is true for all pairs a, b such that a is from the first list, b is from the second list, and a and b appear in the same position in their lists. (oCaml)
For the following C++ code find and write the recurrence relation. You need to model the runtime of function "Func" in terms of n. (only the recurrence relation in terms of n, No output of the code or final runtime analysis is required) s= array L[] start index e= array L[] end index void Func(int L[], int s, int e) { if (s < e) { i=s-1; for (int j = s; j <= e - 1; j++) { if (A[j] <= x) { i++; swap (&L[i], &L[j]); } } swap (&L[i + 1], &L[e]); int k = i+1; Func(L, s, k - 1); Func(L, k + 1, e); } } Please explain how you get the relation Thank you!
Question 2: Write a function that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable. """ def removeOne(l, k):
Can you implement bucket sort algorithm in c++ for me and run a test program for it.