Project Euler problem 64
来源:互联网 发布:java命名规范 编辑:程序博客网 时间:2024/05/07 04:35
这题直接模拟就行了。
然后就看算出来的这个式子是否以前出现过
比如样例中的a5 = 1, 7/(sqrt(23) - 3)
这个23是固定的
所以只要看1, 7, -3这个组合以前出现过没
用hash就行。
当然我用的是python的dic
直接传一个tuple
import mathdef gao(n):m = int(math.sqrt(n))if m * m == n:return 0dic = {}d = ma = nb = -mc = 1len = 0while True:nc = a - b * bnc /= cnd = int((math.sqrt(a) - b) / nc)nb = -b - nd * nct = (nb, nc, nd)b = nbc = ncd = ndif not t in dic:len += 1dic[t] = 1else:breakreturn lenans = 0for i in range(1, 10001):k = gao(i)if k % 2 != 0:ans += 1print ans
- Project Euler problem 64
- Euler Project Problem 6
- project euler problem 11
- Project Euler Problem 81
- Project Euler Problem 60
- Project Euler Problem 59
- Project Euler Problem 58
- Project Euler Problem 57
- Project Euler Problem 16
- Project Euler Problem 30
- Project Euler Problem 31
- Project Euler Problem 32
- Project Euler Problem 14
- Project Euler Problem 15
- Project Euler Problem 17
- Project Euler - Problem 18
- Project Euler - Problem 67
- Project Euler - Problem 20
- Android IntentFilter 匹配原则浅析
- 学习 TimePicker 和 DatePicker 使用方法
- Google的一个面试题——数组原地置换
- C语言中的typeof关键字
- 手动安装jar包到本地Maven仓库
- Project Euler problem 64
- JUnit深入浅出
- 11111
- 【LeetCode】Longest Substring Without Repeating Characters
- pat1056
- Maven多模块布局实例详解
- va_start和va_end使用详解
- Leetcode: Integer to Roman
- 从百度被攻击事件浅谈 DNS 攻击