Location:
Search - ugly numbers
Search list
Description: 一个捉虫子游戏（C＋＋课程设计时做的）。
通过该实践来加深理解面向对象编程里类的设计和使用（比如说继承，访问方式），里还有定时器和随机数的使用。该程序是用控制台写的。界面有点难看。
-a catch insects games (C + + programs designed to do). The adoption of the practice to deepen our understanding of object-oriented programming category Lane in the design and use (for instance, inheritance, access method), they still have timers and the use of random numbers. The program is used to write the console. Interface a bit ugly.
Platform: |
Size: 284234 |
Author: 李冰海 |
Hits:
Description: 一个捉虫子游戏（C＋＋课程设计时做的）。
通过该实践来加深理解面向对象编程里类的设计和使用（比如说继承，访问方式），里还有定时器和随机数的使用。该程序是用控制台写的。界面有点难看。
-a catch insects games (C++ programs designed to do). The adoption of the practice to deepen our understanding of object-oriented programming category Lane in the design and use (for instance, inheritance, access method), they still have timers and the use of random numbers. The program is used to write the console. Interface a bit ugly.
Platform: |
Size: 283648 |
Author: 李冰海 |
Hits:
Description: This a program to solve for ugly numbers. It is currently set to solve for the 1500th ugly number by default, but is easily changeable just by updating the condition of the while loop. Ugly numbers here are those which have only 2, 3, and/or 5 as prime factors.-This is a program to solve for ugly numbers. It is currently set to solve for the 1500th ugly number by default, but is easily changeable just by updating the condition of the while loop. Ugly numbers here are those which have only 2, 3, and/or 5 as prime factors.
Platform: |
Size: 1024 |
Author: Mezura |
Hits:
Description: 这是poj上2247丑数的代码 是自己写的-This is poj ugly numbers on the 2247 code is written in their own
Platform: |
Size: 1024 |
Author: 蒋松蓉 |
Hits:
Description: Ugly macro to convert literal channel numbers into their mhz equivalents There are certianly some conditions that will break this.
Platform: |
Size: 80896 |
Author: courielq |
Hits:
Description: 构造一个集合，里面的数都是丑数，那么任意取一个集合内的数，假设为k，那么2k,3k,5k,7k也是丑数，丢进集合中。因为要求第n小，那么考虑优先队列取前n小数，从1开始扩展集合，重复n次操作，最后的数便是答案。(Construct a set whose numbers are all ugly numbers, then take the number of a collection arbitrarily, assuming that it is K. Then 2K, 3k, 5K and 7K are also ugly numbers and are thrown into the set. Since the request for n is small, then the first N decimal number of priority queues is considered, and the set is extended from 1, and the N operation is repeated, and the final number is the answer.)
Platform: |
Size: 50176 |
Author: 姚任性
|
Hits: