FEU - East Asia College ACM Student Chapter
Search
 
 

Display results as :
 


Rechercher Advanced Search

Latest topics
» “Cochin builders: Symbol of Innovative Architecture”
Thu Jul 18, 2013 8:11 pm by shevsoe

» SPICE (Cobol IDE)
Mon May 06, 2013 5:36 pm by 200730059

» YMCA and Global Services
Thu Sep 01, 2011 2:35 pm by Rene Churchill

» useDelimeter
Thu Jun 23, 2011 11:02 am by ern_andrew

» The City of Cochin
Thu Jun 16, 2011 7:31 pm by GhosnBachelder

» LIFE and LOVE GURU
Sat Oct 09, 2010 1:42 am by kggc09

» Interested to be an Adhoc?
Fri Oct 08, 2010 2:47 pm by rmsalazar

» Meeting! Officers + Members (Open Meeting)
Fri Oct 08, 2010 2:45 pm by rmsalazar

» Indescribable - Louis Giglio
Thu Oct 07, 2010 12:03 am by rmsalazar

September 2018
MonTueWedThuFriSatSun
     12
3456789
10111213141516
17181920212223
24252627282930

Calendar Calendar


Progamming Challenge #2

Go down

Progamming Challenge #2

Post by Chyrl on Thu Jul 22, 2010 11:04 pm

The Problem

Consider the following algorithm:
1. input n
2. print n
3. if n = 1 then STOP
4. if n is odd then
5. else
6. GOTO 2

Given the input 22, the following sequence of numbers will be printed 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

It is conjectured that the algorithm above will terminate (when a 1 is printed) for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.)

Given an input n, it is possible to determine the number of numbers printed (including the 1). For a given n this is called the cycle-length of n. In the example above, the cycle length of 22 is 16.

For any two numbers i and j you are to determine the maximum cycle length over all numbers between i and j.

The Input

The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 1,000,000 and greater than 0.

You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.

You can assume that no operation overflows a 32-bit integer.

The Output

For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear in the output in the same order in which they appeared in the input and should be followed by the maximum cycle length (on the same line).

Sample Input
1 10
100 200

Sample Output
1 10 20
100 200 125

Solutions are to be send to chyrl@live.com and not on this topic.
Thank you.

_________________
David Paul E. Badiola
Director for Education
200810270
chyrl@live.com
avatar
Chyrl
Level 0

Posts : 16
Reputation : 0
Join date : 2010-07-12

View user profile

Back to top Go down

Re: Progamming Challenge #2

Post by angelie on Sat Jul 24, 2010 2:15 am

kinuha sa uvatoolkit! lol! kayang-kaya, sagutan natin..

_________________
Cortez, Ma. Aura Angelie P.
200810554
3rd Year
BS in Computer Science
Director for Logistics
AY 2010 - 2011
FEU - East Asia College
maapcortez@yahoo.com
avatar
angelie
Level 0

Posts : 25
Reputation : 0
Join date : 2010-07-07

View user profile

Back to top Go down

Re: Progamming Challenge #2

Post by Chyrl on Tue Jul 27, 2010 1:28 pm

Hehehehe...
Pero ewan lang natin...

Sana marami makakuha nito.

_________________
David Paul E. Badiola
Director for Education
200810270
chyrl@live.com
avatar
Chyrl
Level 0

Posts : 16
Reputation : 0
Join date : 2010-07-12

View user profile

Back to top Go down

Re: Progamming Challenge #2

Post by Sponsored content


Sponsored content


Back to top Go down

Back to top


 
Permissions in this forum:
You cannot reply to topics in this forum