This challenge was inspired from a Project Euler
After converting a fraction into a floating point number, find the recurring cycle if there is one.
1/2 = 0.5
1/3 = 0.333333333333333333333 = 3
1/6 = 0.166666666666666666666 = 6
1/7 = 0.142857142857142857142 = 142857
1/9 = 0.111111111111111111111 = 1
This isn't a hard problem but I found it fun enough to share. Solve it any which way you want but bonus points for creativity. Since precision could be an issue, just assume that the provided string will be long enough for the recurring cycle to appear in its entirety at least twice. My solution is terribly inefficient and I will post it tomorrow.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
| & || & |
| < || < |
| > || > |
| [ || [ |
| ] || ] ||