Project Euler 28
来源：互联网 发布：主要矛盾知乎 编辑：程序博客网 时间：2024/06/03 04:42
这道题……看上去挺唬人……
其实解法很多，数学或者暴力随你……
我算是半数学吧……没大用公式，都是按照差来算的……
sum_up = 25last_max = 9#last_max is the previous circle's largest one. on the up-right corner.base = 25 #base is the base difference between last_max and the new circle's min.for circle in range(2, 501):base += 2sum_up += base*10 + last_max*4last_max += base*4print(sum_up)
- Project Euler - Problem 28
- Project Euler problem 28
- Project Euler 28
- project euler problem 28
- project euler 28
- Project Euler
- project euler
- Project Euler
- Project Euler：Problem 28 Number spiral diagonals
- 28 Number spiral diagonals - Project Euler +
- Project Euler .net
- Project Euler 0
- Project Euler 1-6
- Project Euler 7-10
- Euler Project Problem 6
- project euler problem 11
- project euler problem14
- Project Euler Problem 81
- SharedPreferences存储数据
- UIView只收集move轨迹，不接收“单击”、“长按”事件
- JQuery基本选择器
- 【折腾】centos mini安装后安装lnmp~
- BSTR、char*和CString转换
- Project Euler 28
- C字符串与NSString之间的转换
- 乐嘉老师给国内程序员的23条忠告，句句是金言[学习中。。。]
- java23种设计模式三(连载)
- 我的发布bolg test
- DrawCall
- LDAP初步释义
- linux下杀死进程的方法
- iOS与XML
