UVA 136
来源:互联网 发布:电动插桶泵淘宝 编辑:程序博客网 时间:2024/04/29 15:04
Ugly Numbers
Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ...
shows the first 11 ugly numbers. By convention, 1 is included.
Write a program to find and print the 1500'th ugly number.
Input and Output
There is no input to this program. Output should consist of a single line as shown below, with <number> replaced by the number computed.
Sample output
The 1500'th ugly number is <number>.
这题不解释了 , 简单DP , 记得用long long。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;long long a[1505];int main(){ //freopen("in.txt" , "r" , stdin); int n , m1 , m2 , m3; a[1] = 1; m1 = m2 = m3 = 1; for(int i = 2 ; i <= 1500 ; i++) { a[i] = min(2 * a[m1] , min(3 * a[m2] , 5 * a[m3])); if(a[i] == 2 * a[m1])m1++; if(a[i] == 3 * a[m2])m2++; if(a[i] == 5 * a[m3])m3++; } printf("The 1500'th ugly number is %lld.\n",a[1500]); return 0;}
- UVA 136
- UVA - 136
- UVA 136
- UVa 136 - Ugly Numbers
- UVa 136 - Ugly Numbers
- UVa 136 - Ugly Numbers
- UVa 136 丑数
- UVA - 136 Ugly Numbers
- UVA 136 Ugly Numbers
- uva 136 丑数
- Uva - 136 - Ugly Numbers
- UVA 136 Ugly Numbers
- UVA 136 Ugly Numbers
- UVA - 136 Ugly Numbers
- UVA 136 Ugly Numbers
- UVa 136 Ugly Numbers
- UVa 136 Ugly Numbers
- UVA - 136 Ugly Numbers
- Spring IOC 的 Annotation 简析
- 【程序52】学习使用按位或 |
- LINUX IO - 同步,异步,阻塞,非阻塞全解析
- Static方法和Static程序块的用法总结
- IO 流
- UVA 136
- JSP 9 大内置对象详解
- 【程序53】学习使用按位异或 ^
- 求一个数是否为素数
- POJ1979(Red and Black)
- 中断处理的详细过程
- 输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字
- 流
- ctype.h库