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
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #14: Longest Collatz sequence

Project Euler #14: Longest Collatz sequence

Problem
Submissions
Leaderboard
Discussions

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

The following iterative sequence is defined for the set of positive integers:

Using the rule above and starting with 13, we generate the following sequence:

It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.

Which starting number, produces the longest chain? If many possible such numbers are there print the maximum one.

Note: Once the chain starts the terms are allowed to go above .

Input Format

The first line contains an integer , i.e., number of test cases.
Next lines will contain an integers .

Constraints

Output Format

Print the values corresponding to each test case.

Sample Input

3
10 
15
20

Sample Output

9
9
19

Explanation

Collatz sequence for is,

containing steps and is the longest for

Author

shashank21j

Difficulty

Easy

Max Score

100

Submitted By

9786

Need Help?


View discussions
View top submissions

rate this challenge

MORE DETAILS

Download problem statement
Download sample test cases
Suggest Edits

Choose a translation


  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy