We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #211: Divisor Square Sum

Project Euler #211: Divisor Square Sum

Problem
Submissions
Leaderboard
Discussions

This problem is a programming version of Problem 211 from projecteuler.net


For a positive integer , let be the sum of the squares of its divisors. For example,

.

You are given two integers and , you need to find the sum of all such that is at most away from a perfect square.

Input Format

The first line of each test file contains a single integer which is the number of queries.
Each of the next lines contains two space-separated integers, and .

Constraints

  • .
  • .
  • .

Output Format

Print the answer to each query in a new line.

Sample Input

11
65 0
269 1
312 2
745 3
1457 4
1686 5
1882 6
4270 7
6242 8
9838 9
9868 10

Sample Output

43
7341
9651
46264
167332
226094
278015
1218448
2443417
5802272
5851533

Explanation

For the first one, the only integers less than for which is a square are and , hence the answer is 43.

Author

khalid_t

Difficulty

Hard

Max Score

100

Submitted By

785

Need Help?


View discussions
View top submissions

rate this challenge

MORE DETAILS

Download problem statement
Download sample test cases
Suggest Edits
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy