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 #179: Consecutive positive divisors

Project Euler #179: Consecutive positive divisors

Problem
Submissions
Leaderboard
Discussions

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

Find the number of integers , for which and have the same number of positive divisors. For example, has the positive divisors , , , while has , , , .

Input Format

First line of input contains single integer which is the number of testcases. All of the following lines contain single integer each.

Constraints

Output Format

For each testcase output the only integer which is the answer to the problem.

Sample Input 0

3
3
15
100

Sample Output 0

1
2
15

Explanation 0

The only are and .

Author

adamant

Difficulty

Easy

Max Score

100

Submitted By

1692

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