1. input n 2. print n 3. if n = 1 then STOP 4. if n is odd then 5. else 6. GOTO 2
This blog provides acm problem solution, uva problem solution, Algorithms, Tutorials, Programming resource and some Articles.
menu
- Volume C(10000-10099)
- Volume CI(10100-10199)
- Volume CII (10200-10299)
- Volume CIII (10300-10399)
- Volume CIV (10400-10499)
- Volume CV (10500-10599)
- Volume CVI (10600-10699)
- Volume CVII (10700-10799)
- Volume CVIII (10800-10899)
- Volume CIX (10900-10999)
- Volume CX (11000-11099)
- Volume CXI (11100-11199)
- Volume CXII (11200-11299)
- Volume CXIII(11300-11399)
- Volume CXIV(11400-11499)
- Volume CXV(11500-11599)
- Volume CXVI(11600-11699)
- Volume CXVII(11700-11799)
- Volume 118(11800-11899)
- Volume 119(11900-11999)
Algorithm of 3n + 1 problem
Consider the following algorithm:
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Write your comment - Share Knowledge and Experience