URAL 6089 Nine
2015-04-22 17:22
197 查看
水题,找误差范围之内9最多的时间,如果有多个,选择误差最小的一个,如果还有多个,选择字典序最小的一个。同一个时间可以有不同的表示方法,例如60:15也可以表示为59:75。
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> using namespace std; int main() { int ansx, ansy; int mm, ss, i, j; while (~scanf("%d:%d", &mm, &ss)) { if (mm == 0 && ss == 0) break; int t = mm * 60 + ss; int xx, yy; int maxn = -1; int minn = 999999999; for (i = 0; i <= 99; i++) { for (j = 0; j <= 99; j++) { int t9 = i * 60 + j; if (10 * abs(t - t9) < t) { int sum = 0; xx = i, yy = j; if (xx / 10 == 9)sum++; if (xx % 10 == 9)sum++; if (yy / 10 == 9)sum++; if (yy % 10 == 9)sum++; if (sum>maxn || (abs(t9 - t) < minn&&sum == maxn)) { ansx = xx; ansy = yy; maxn = sum; minn = abs(t9 - t); } sum = 0; if (yy < 40 && xx>0) { xx--; yy = yy + 60; if (xx / 10 == 9)sum++; if (xx % 10 == 9)sum++; if (yy / 10 == 9)sum++; if (yy % 10 == 9)sum++; if (sum > maxn || (abs(t9 - t) < minn&&sum == maxn)) { ansx = xx; ansy = yy; maxn = sum; minn = abs(t9 - t); } } } } } printf("%02d:%02d\n", ansx, ansy); } return 0; }
相关文章推荐
- UVALive 6089 Nine (暴力模拟)
- UVALive 6089 Nine
- ural 1208. Legendary Teams Contest 递归
- URAL 1018 Binary Apple Tree(树形dp)
- URAL 1272 Non-Yekaterinburg Subway (查并集)
- URAL 1022 Genealogical Tree (DFS)
- URAL 1980 Road to Investor (二分 + SPFA)
- URAL 1495 One-two, One-two 2 (BFS)
- URAL 1198 Jobbery (强连通分量 Tarjan)
- Ural 1091 Tmutarakan Exams
- [杂题]URAL2047. Maths
- URAL 1152 False Mirrors (DFS枚举)
- ural 1155. Troubleduons
- Ural 1297 Palindrome (后缀数组)
- NinePatchDrawable
- ural 1437. Gasoline Station
- ural 1341. Device
- URAL 1145—— Rope in the Labyrinth——————【求树的直径】
- ural 1071. Nikifor 2
- URAL 1837. Isenbaev's Number (map + Dijkstra || BFS)