Project Euler 26 计算小数位循环的位数
来源:互联网 发布:制作传单的软件 编辑:程序博客网 时间:2024/06/16 20:57
A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
1/2= 0.51/3= 0.(3)1/4= 0.251/5= 0.21/6= 0.1(6)1/7= 0.(142857)1/8= 0.1251/9= 0.(1)1/10= 0.1
Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
解析:费马小定理的应用
def recu_cycle(d):for t in range(1,d):if 1 == 10**t % d:return t;return 0longest = max(recu_cycle(i) for i in range(2,1001))print [i for i in range(2,1001) if recu_cycle(i) == longest][0]
1 0
- Project Euler 26 计算小数位循环的位数
- Project Euler 26 Reciprocal cycles(计算有理小数循环节长度)
- Project Euler - Problem 26
- Project Euler 26
- Project Euler problem 26
- Python-Project Euler 26
- Project Euler 26~30
- project euler 26
- Project Euler 26
- Python计算Project Euler Problem 3
- 26 Reciprocal cycles - Project Euler
- Project Euler 26 Reciprocal cycles
- Project Euler 26-30题
- java 求无限循环小数的循环体/循环部分 project euler problem26
- 非负分数的循环小数位长度
- 如何按指定位数截取一个数字的小数位
- Project Euler
- project euler
- C/C++从文件末尾往前一行一行的读
- vs2010创建和使用动态链接库(dll)
- Visual Studio 2014 预览版 CTP3 发布了!可以下载
- java 基础程序设计
- JSP/Servlet中的Filter过滤器的用法小结
- Project Euler 26 计算小数位循环的位数
- ubuntu安装指南
- apache外网不能访问即解决方式
- HDU 3966 树链剖分
- POJ 2516 Minimum Cost(网络流之费用流)
- 类方法中self的用法
- Java 语言和 Java Media
- 筛选法求素数
- opencv求矩阵特征值