hdu 4484 Hailstone HOTPO (暴力)

Hailstone HOTPO

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 356    Accepted Submission(s): 210

Problem Description

The  hailstone sequence is formed in the following way:

(1) If n is even, divide it by 2 to get n'
(2) If n is odd, multiply it by 3 and add 1 to get n'

It is conjectured that for any positive integer number n, the sequence will always end in the repeating cycle: 4, 2, 1, 4, 2, 1,... Suffice to say , when n == 1, we will say the sequence has ended.

Write a program to determine the largest value in the sequence for a given n.

 

Input

The first line of input contains a single integer P, (1<= P <= 100000), which is the number of data set s that follow. Each data set should be processed identically and independently.

Each data set consists of a single line of input consisting of two space separated decimal integers. The first integer is the data set number. The second integer is n, (1 <= n <= 100,000), which is the starting value.

 

Output

For each data set there is a single line of output consisting of the data set number, a single space, and the largest value in the sequence starting at and including n.

 

Sample Input

  
  

   
   4
1 1
2 3
3 9999
4 100000
  
  

 

Sample Output

  
  

   
   1 1
2 16
3 101248
4 100000
  
  
  
  


  
  
  
  


  
  
  
  

   
   直接暴力!
  
  
  
  


  
  
  
  

   
   
#include<stdio.h>
int fun(int m)
{
    int ans=m;
    while(m!=1)
    {
        if(m%2==0)
        {
            m/=2;
        }
        else
        {
            m=m*3+1;
        }
        ans=(ans<m?m:ans);
    }
    return ans;
}
int n,p;
int main()
{
    scanf("%d",&p);
    while(p--)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        printf("%d %d\n",a,fun(b));
    }
}