Problem 034——UVa 136 - Ugly Numbers
2015-02-02 10:47
357 查看
Ugly Numbers |
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>.首先说一个非常坑爹的代码,完全是水过去的,不过这个代码一开始是WA的,我不知道为什么,而且,在我老老实实用正常方法A掉这个题的时候,我发现这个代码又能A了,我真是觉得奇怪。。。
#include<stdio.h> int main() { printf("The 1500'th ugly number is 859963392.\n"); return 0; }
下面这个代码就是正常的了
#include<stdio.h> int main() { int ungly[1508]={1}; int m2=0,m3=0,m5=0; for(int i=1,t;i<1500;i++) { if(2*ungly[m2]>3*ungly[m3]) t=ungly[m3]*3; else t=ungly[m2]*2; if(t>ungly[m5]*5) t=ungly[m5]*5; if(t == 2*ungly[m2]) m2++; if(t == 3*ungly[m3]) m3++; if(t == 5*ungly[m5]) m5++; ungly[i]=t; } printf("The 1500'th ugly number is %d.\n",ungly[1499]); return 0; }
相关文章推荐
- uva136 Ugly numbers
- UVa136 Ugly Numbers(优先队列+set判重)
- UVa 136 Ugly Numbers【优先队列】
- Uva 136 Ugly Numbers(丑数)
- UVa136 Ugly Numbers (priority_queue)
- UVA136 Ugly Numbers(优先队列应用)
- UVA - 136 Ugly Numbers
- uva 136 Ugly Numbers(priority_queue的使用)
- UVA - 136 Ugly Numbers
- UVa - 136 - Ugly Numbers(STL - 优先队列priority_queue)
- uva 136(Ugly Numbers, 优先队列基础)
- Uva136——Ugly Numbers
- UVA ~ 136 ~ Ugly Numbers (priority_queue + map)
- 《算法竞赛入门经典2ndEdition 》例题5-7 丑数(Ugly Numbers, Uva136)
- UVA - 136 Ugly Numbers (有关set使用的一道题)
- UVa 136 Ugly Numbers(优先队列)
- UVA136 - Ugly Numbers 优先队列
- 例题5-7 UVA 136 Ugly Numbers丑数(set+优先队列)
- UVA 136 Ugly Numbers
- 例题5-7 UVa136 Ugly Numbers(STL:priority_queue)