暑假acm
文章平均质量分 78
每天都要有进步
这个作者很懒,什么都没留下…
展开
-
poj2586 Y2K Accounting Bug
Y2K Accounting BugTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8487 Accepted: 4191DescriptionAccounting for Computer Machinists (ACM) has sufferred fro原创 2013-07-23 00:30:06 · 525 阅读 · 0 评论 -
poj1328 Radar Installation
Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41948 Accepted: 9286DescriptionAssume the coasting is an infinite straight line. Land is原创 2013-07-22 18:37:35 · 355 阅读 · 0 评论 -
poj2965 The Pilots Brothers' refrigerator
The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15399 Accepted: 5776 Special JudgeDescriptionThe game “The Pilots B原创 2013-07-22 01:46:21 · 413 阅读 · 0 评论 -
poj1753 Flip Game
DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying e原创 2013-07-22 00:27:11 · 369 阅读 · 0 评论 -
fibmod and points for test
#include #include long long n, b, k;struct state { long long s[2][2]; state(long long a = 0, long long b = 0, long long c = 0, long long d = 0) { s[0][0] = a, s[0][1] = b, s[1][0] = c, s[1][1原创 2013-11-20 09:25:52 · 859 阅读 · 0 评论 -
mod fib
#include #include long long n, b, k;struct state { long long s[2][2]; state(long long a = 0, long long b = 0, long long c = 0, long long d = 0) { s[0][0] = a, s[0][1] = b, s[1][0] = c, s[1][1转载 2013-12-17 22:17:59 · 604 阅读 · 0 评论 -
poj1265 in e area
#include #include #include //#include #include using namespace std;struct POINT{ int x,y;}point[110];int n;double getArea(){ double sum = 0; for (int i = 0; i < n; ++ i) { sum += (转载 2013-12-17 22:33:41 · 402 阅读 · 0 评论