水题
文章平均质量分 92
overload1997
努力 努力 再努力
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
2015CCPC南阳场 H - Sudoku
比赛的时候都错了题意我去。。一直TLE+WA..赛后看了题解才知道都错了题意。。愧疚啊我去。。这次比赛我读的两道题都读错了题意,坑死队友。。H - SudokuTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU原创 2016-07-25 18:24:46 · 661 阅读 · 0 评论 -
ACM天梯赛 L2-016. 愿天下有情人都是失散多年的兄妹
L2-016. 愿天下有情人都是失散多年的兄妹时间限制200 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越呵呵。大家都知道五服以内不得通婚,即两个人最近的共同祖先如果在五代以内(即本人、父母、祖父母、曾祖父母、高原创 2016-07-19 23:19:47 · 1311 阅读 · 0 评论 -
某个比赛:Problem H: 1的最少个数
//http://acm.cug.edu.cn/JudgeOnline/problem.php?cid=1092&pid=7//Problem H: 1的最少个数#include#include#include#include#includeusing namespace std;int solve(int x){ if(x==0)return 0; int ans原创 2016-07-19 20:44:26 · 349 阅读 · 0 评论 -
杭电博弈入门题
Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8128 Accepted Submission(s): 5235Problem Description原创 2016-07-20 23:20:38 · 668 阅读 · 0 评论 -
2016ccpc杭州赛 hdu 5938 F.Four Operations
Four OperationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 79 Accepted Submission(s): 38Problem DescriptionLittle Ruins i原创 2016-10-29 20:28:14 · 819 阅读 · 0 评论 -
2016ccpc杭州赛 hdu 5935 C.Car
CarTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 93 Accepted Submission(s): 35Problem DescriptionRuins is driving a car to原创 2016-10-29 19:53:34 · 782 阅读 · 0 评论 -
2016 ICPC大连赛区 hdu5980 Find Small A
Find Small ATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 353 Accepted Submission(s): 179Problem DescriptionAs is known to原创 2016-11-18 19:24:59 · 477 阅读 · 0 评论 -
Codeforces Round #405 C. Bear and Different Names
C. Bear and Different Namestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the army, it isn't easy to fo原创 2017-03-20 23:24:49 · 394 阅读 · 0 评论 -
Codeforces Round #406 (Div. 2) ABCDE
题目链接大都是经典的套路题,下面我没做太多详细的叙述,不懂的留言就可以。A:暴力跑一遍就可以了#includeusing namespace std;const int maxn=1e4+10;int neg[maxn],pos[maxn];int main(){ int n,k,t; while(cin>>n>>k) { bool a原创 2017-04-09 22:36:30 · 264 阅读 · 0 评论
分享