ITeye博客

2010 年文章归档

共 1 篇文章

Projecteuler 169

http://projecteuler.net/index.php?section=problems&id=169 Define f(0)=1 and f(n) to be the number of different ways n can be expressed as a sum of integer powers of 2 using each power no more than twice. For example, f(10)=5 since there are five different ways to express 10: 1 + 1 + 8 1 + 1 + 4 + 4…

2010-08-29 20:54 · 数学&编程