04 2018 档案

poj 2184 Cow Exhibition
摘要：Cow Exhibition Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15034 Accepted: 6098 Description "Fat and docile, big and dumb, they look so 阅读全文

posted @ 2018-04-21 22:13 ZefengYao 阅读(260) 评论(0) 推荐(0)

hdoj 1072 Nightmare
摘要：Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13048 Accepted Submission(s): 6368 Prob 阅读全文

posted @ 2018-04-13 22:36 ZefengYao 阅读(204) 评论(0) 推荐(0)

foj 2111 Problem 2111 Min Number
摘要：Problem 2111 Min Number Accept: 1025 Submit: 2022Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 1025 Submit: 2022Time Limit: 1000 mSec Memory L 阅读全文

posted @ 2018-04-13 19:05 ZefengYao 阅读(123) 评论(0) 推荐(0)

hdoj 1175 连连看
摘要：连连看 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39496 Accepted Submission(s): 9797 Problem 阅读全文

posted @ 2018-04-12 21:13 ZefengYao 阅读(284) 评论(0) 推荐(0)

poj 2377 Bad Cowtractors
摘要：Bad Cowtractors Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17411 Accepted: 7059 Description Bessie has been hired to build a cheap int 阅读全文

posted @ 2018-04-12 19:22 ZefengYao 阅读(122) 评论(0) 推荐(0)

poj 3666 Making the Grade
摘要：Making the Grade Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8794 Accepted: 4117 Description A straight dirt road connects two fields o 阅读全文

posted @ 2018-04-12 18:46 ZefengYao 阅读(206) 评论(0) 推荐(0)

2018华南理工大学程序设计竞赛 H-对称与反对称
摘要：H-对称与反对称 题目描述 给出一个N*N的方阵A。构造方阵B,C: 使得A = B + C.其中 B为对称矩阵，C为反对称矩阵。 对于方阵S中的任意元素,若(S)ij = (S)ji,则称S为对称矩阵 对于方阵T中的任意元素,若(T)ij = -(T)ji,则称T为反对称矩阵 注意，所有运算在模M 阅读全文

posted @ 2018-04-11 22:58 ZefengYao 阅读(392) 评论(0) 推荐(0)

hdoj 4293 Groups
摘要：Groups Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1966 Accepted Submission(s): 778 Problem D 阅读全文

posted @ 2018-04-11 21:29 ZefengYao 阅读(170) 评论(0) 推荐(0)

FOJ Problem 2273 Triangles
摘要：Problem 2273 Triangles Accept: 201 Submit: 661Time Limit: 1000 mSec Memory Limit : 262144 KB Accept: 201 Submit: 661Time Limit: 1000 mSec Memory Limit 阅读全文

posted @ 2018-04-10 19:40 ZefengYao 阅读(216) 评论(0) 推荐(0)

poj 3411 Paid Roads
摘要：Paid Roads Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7996 Accepted: 2982 Description A network of m roads connects N cities (numbered 阅读全文

posted @ 2018-04-09 18:57 ZefengYao 阅读(137) 评论(0) 推荐(0)

poj 1795 DNA Laboratory
摘要：DNA Laboratory Time Limit: 5000MS Memory Limit: 30000K Total Submissions: 2892 Accepted: 516 Description Background Having started to build his own DN 阅读全文

posted @ 2018-04-08 22:06 ZefengYao 阅读(343) 评论(0) 推荐(0)

poj 2836 Rectangular Covering
摘要：Rectangular Covering Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2776 Accepted: 790 Description n points are given on the Cartesian pla 阅读全文

posted @ 2018-04-07 23:00 ZefengYao 阅读(129) 评论(0) 推荐(0)

poj 3254 Corn Fields
摘要：Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18381 Accepted: 9678 Description Farmer John has purchased a lush new rectangul 阅读全文

posted @ 2018-04-07 20:12 ZefengYao 阅读(127) 评论(0) 推荐(0)

第13届景驰-埃森哲杯广东工业大学ACM程序设计大赛部分题解
摘要：A 跳台阶 思路：其实很简单，不过当时直接dp来做了 AC代码： #define _CRT_SECURE_NO_DEPRECATE #include<iostream> #include<cmath> #include<algorithm> #include<cstring> #include<ve 阅读全文

posted @ 2018-04-07 16:27 ZefengYao 阅读(151) 评论(0) 推荐(0)

poj 2441 Arrange the Bulls
摘要：Arrange the Bulls Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 5427 Accepted: 2069 Description Farmer Johnson's Bulls love playing baske 阅读全文

posted @ 2018-04-06 13:59 ZefengYao 阅读(152) 评论(0) 推荐(0)

《挑战程序设计竞赛》P196 铺砖问题
摘要：题意：给定n*m格子,每个格子被染成了黑色或者白色，现在要用1*2的砖块覆盖这些格子，块与块不得重叠,且覆盖所有的白色格子,但不覆盖任意一个黑色格子，求一共有多少种覆盖方法。 思路：书上给的思路太巧妙以至于一时无法参透，于是找了一些相关的铺砖问题的解法，在此思路上改进了一下。具体思路可以参考http 阅读全文

posted @ 2018-04-05 22:31 ZefengYao 阅读(544) 评论(1) 推荐(0)

导航