Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- A. Broken Clock (贪心)
来源:互联网 发布:空之境界知乎 编辑:程序博客网 时间:2024/05/10 12:30
大大体题意:
有12小时进制和24小时进制的时间,给你一个时间,hh:mm,如果合法 原样输出,否则修改最少的数字 改成合法的时间!
思路:
算不上贪心,想清楚就可以了!
其中分钟最简单, 如果 大于59 直接输出 0 + 个位数即可!
对于小时来说:
如果是24小时进制的: 如果大于23 直接变成 0 + 个位数!
如果是12小时进制的: 如果等于0 或者大于12 : 如果是10的倍数 就要变成 10,不是10的倍数 变成 0 + 个位数
合法直接输出即可!
#include <bits/stdc++.h>using namespace std;int main(){ int d; int h,m; scanf("%d",&d); scanf("%d:%d",&h,&m); if (d == 24){ if (h > 23) printf("0%d:",h%10); else printf("%02d:",h); if (m > 59){ printf("0%d",m%10); } else printf("%02d",m); } else { if (h > 12 || !h){ if (h % 10 == 0)printf("10:"); else printf("0%d:",h%10); if (m > 59){ printf("0%d",m%10); } else printf("%02d",m); }else { printf("%02d:",h); if (m > 59){ printf("0%d",m%10); } else printf("%02d",m); } } puts(""); return 0;}
0 0
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- A. Broken Clock (贪心)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- D. Generating Sets(贪心)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)D. Generating Sets(贪心)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) D. Generating Sets 贪心
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- B. Verse Pattern(水题)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) D. Generating Sets __ dfs+优先队列+贪心
- Codeforces Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) 部分题解
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) [D] Destroying Array
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) C 并查集
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) E
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) F
- codeforeces722 Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)F. Cyclic Cipher
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- C. Destroying Array (并查集)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) C. Destroying Array(并查集)
- 赛码网练习——黑默丁格的炮台
- LeetCode 14. Longest Common Prefix
- 树上最远点对的线性时间算法
- Maven依赖的jar包下载不了、jar更新不了的解决办法
- Linux学习笔记(一)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- A. Broken Clock (贪心)
- 队列(链式结构)的实现
- socket网络调优
- BOM screen history location navigator 延时函数 open frames
- CSS引入方式汇总
- Javascript解析参数字符串,截取每一个参数,返回以一个对象
- android 基础代码 备忘
- Running & Being
- climb stairs