zju1095
2013-11-26 23:42
148 查看
#include <iostream> using namespace std; int FindMin(int a, int b, int c, int d); bool isNum(int n); int main() { int a[5850]; int n = 1; int p2 = 1, p3 = 1, p5 = 1, p7 = 1; a[1] = 1; while (a < 2000000000) { a[++n] = FindMin(2 * a[p2], 3 * a[p3], 5 * a[p5], 7 * a[p7]); if (a == 2 * a[p2]) ++p2; if (a == 3 * a[p3]) ++p3; if (a == 5 * a[p5]) ++p5; if (a == 7 * a[p7]) ++p7; } while (cin >> n && n) { if (n < 0 || n > 5842) break; cout << "The " << n; if (n % 10 == 1 && !isNum(n)) cout << "st "; else if (n % 10 == 2 && !isNum(n)) cout << "nd "; else if (n % 10 == 3 && !isNum(n)) cout << "rd "; else cout << "th "; cout << "humble number is " << a << endl; } return 0; } int FindMin(int a, int b, int c, int d) { int min = a; if (b < min) min = b; if (c < min) min = c; if (d < min) min = d; return min; } bool isNum(int n) { if (n == 11 || n == 12 || n == 13) return true; return false; }
相关文章推荐
- ZJU-1095
- hdu 3245 zoj zju 3188 树形DP
- URAL_1095_Nikifor 3
- 1008-Gnome Tetravex -zju
- zju monthly contest 2012 aug.
- http://pat.zju.edu.cn/contests/pat-practise/1037
- http://pat.zju.edu.cn/contests/pat-practise/1012
- zju 1082 Stockbroker Grapevine
- ZOJ 3681 ZJU2013年01月月赛F题 E - Cup 2
- [zju嵌入式]树莓派之修改源
- ZJU-PAT 1050
- bzoj 1095 ZJOI2007 捉迷藏
- 杭电1095
- POJ 1095 Trees Made to Order(卡特兰数列)
- zju(2)vivi的配置编译和固化
- HDU-1095
- zju pat 1036
- ZJU_BASIC LEVEL_1017 大数相除 递归的简单应用
- EASY_ZJU_PAT_ADVANCED LEVEL 1050 高效输入含有空格的字符串 高效删除字符串中的字符
- 九度oj 题目1007:奥运排序问题 【ZJU2010考研机试题3】【容易理解混乱】