Project Euler 题解 #63 Powerful digit counts
来源:互联网 发布:linux卸载scim 编辑:程序博客网 时间:2024/05/31 19:57
题目:Powerful digit counts
The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number, 134217728=89, is a ninth power.
How many n-digit positive integers exist which are also annth power?
分析
假设一个位数为x的数S=kx,得到关系式:
右端可得:1<=k<=9
左端看得:k>=101-1/x,
题目的解就是统计满足上面不等式的k值的总数。
列图表解:
结果为49.
0 0
- Project Euler 题解 #63 Powerful digit counts
- Project Euler:Problem 63 Powerful digit counts
- Problem 63 Powerful digit counts
- Project Euler:Problem 56 Powerful digit sum
- Project Euler 题解 #30 Digit fifth powers
- Project Euler 题解 #16 Power digit sum
- Project Euler 题解 #20 Factorial digit sum
- Project Euler: Problem 17 Number letter counts
- Project Euler Problem 17 Number letter counts
- project euler 17 Number letter counts
- digit-counts
- Project Euler 51 Prime digit replacements(枚举)
- Project Euler 16: Power digit sum.
- Project Euler:Problem 16 Power digit sum
- Project Euler:Problem 20 Factorial digit sum
- Project Euler:Problem 30 Digit fifth powers
- Project Euler:Problem 33 Digit cancelling fractions
- Project Euler:Problem 34 Digit factorials
- C#程序以管理员权限运行
- 在CentOS6.2下搭建git服务器gitosis
- 深入学习Make命令和Makefile(上)(2)
- android GPS应用程序设计
- 小米手机修改android:icon="@drawable/icon"图标无变化的原因
- Project Euler 题解 #63 Powerful digit counts
- awk 简介
- 重写EditText,使其具有下划线
- LimeJS Demo学习2 box2d使用
- c++快速排序
- Linux下安装jdk
- Timus 1225. Flags Fibonacci的应用
- C语言程序员必读的五本书------转自嵌入式linux中文站
- Linux Shell脚本入门学习