Odd divisors
Practice
2.8 (27 votes)
Basic programming
Problem
87% Success 9753 Attempts 20 Points 5s Time Limit 256MB Memory 1024 KB Max Code
You are given a positive integer \(N\).\(f(N)\) is the greatest odd divisor of \(N\).
Find the sum \((f(1) + f(2) + ... + f(N))\%M\).
Input format
- The first line of the input contains a single integer \(T\) \((T ≤ 100)\) denoting the number of test cases. The description of \(T\) test cases follows.
- The first line of each test case contains two integers \(N\) and \(M\) \((N ≤ 10^{18},\ M≤10^9)\).
Output format
For each value of \(N\), print the value of \((f(1) + f(2) + ... + f(N))\%M\) in a separate line.
Sample Input
5 1 100 110 30 12345 100000007 10 28383 100 5
Sample Output
1 18 50804693 36 4
Explanation
-
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Submissions
Please login to view your submissions
Similar Problems
Points:20
25 votes
Tags:
Basic ProgrammingC++
Points:30
31 votes
Tags:
AlgorithmsApprovedBit ManipulationDynamic ProgrammingMediumOpen
Points:20
22 votes
Tags:
ApprovedEasyMathOpenPrimality test
Editorial
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor