poj上的水题
文章平均质量分 72
princeyuaner
这个作者很懒,什么都没留下…
展开
-
Quicksum解题报告
Quicksum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10341 Accepted: 7132 Description A checksum is an algorithm that scans a packet of data and re原创 2012-04-09 17:35:18 · 442 阅读 · 0 评论 -
I Think I Need a Houseboat解题报告
I Think I Need a Houseboat Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 68120 Accepted: 28722 Description Fred Mapper is considering purchasing some原创 2012-04-09 19:13:13 · 437 阅读 · 0 评论 -
Hangover解题报告
Hangover Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 76928 Accepted: 36660 Description How far can you make a stack of cards overhang a table? If y原创 2012-04-09 18:51:25 · 512 阅读 · 0 评论 -
POJ1083-Moving Tables解题报告
Moving Tables Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20728 Accepted: 6814 Description The famous ACM (Advanced Computer Maker) Company has rented a原创 2012-07-17 19:10:47 · 517 阅读 · 0 评论 -
POJ3094-Quicksum解题报告
Quicksum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10876 Accepted: 7489 Description A checksum is an algorithm that scans a packet of data and return原创 2012-07-17 20:23:21 · 747 阅读 · 0 评论 -
POJ3006-Dirichlet's Theorem on Arithmetic Progressions解题报告
Dirichlet's Theorem on Arithmetic Progressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11749 Accepted: 5923 Description If a and d are relatively p原创 2012-07-17 19:57:29 · 876 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30437 Accepted: 9390 Description Farmer John has been informed of the location of a fugiti原创 2012-07-19 10:13:07 · 426 阅读 · 0 评论 -
免费馅饼
#include #include #include #include using namespace std; int map[100001][11]={0}; int main() { int n,case_point,time,i,j; //printf("%d",map[100][10]); while(scanf("%d",&n),n) { memset(map,0,原创 2012-07-26 20:27:50 · 774 阅读 · 0 评论 -
免费馅饼
#include #include #include #include using namespace std; int map[100001][11]={0}; int main() { int n,case_point,time,i,j; while(scanf("%d",&n),n) { memset(map,0,sizeof(map)); int max_time=0;原创 2012-07-26 20:32:02 · 802 阅读 · 0 评论