Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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 = {x1, x2,..., ¤N}is the number of cool divisors of II, *i. 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.

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 = {x1, x2,..., ¤N}is the number of cool divisors of II, *i. 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.

Database System Concepts
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
icon
Related questions
Question
100%

Please Code this using C++ and provide snapshot of the following input case

Example Input

3

3 4 1 2

1 10 15 20

1 8 1 8

Example Output

10

0

1703

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 = {x1, x2,..., *N} is the number of cool divisors ofII"1 ¤i. 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.
Transcribed Image Text: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 = {x1, x2,..., *N} is the number of cool divisors ofII"1 ¤i. 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.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Datatypes
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS