poj上的水题
文章平均质量分 72
princeyuaner
这个作者很懒,什么都没留下…
展开
-
Quicksum解题报告
QuicksumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10341 Accepted: 7132DescriptionA checksum is an algorithm that scans a packet of data and re原创 2012-04-09 17:35:18 · 434 阅读 · 0 评论 -
I Think I Need a Houseboat解题报告
I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 68120 Accepted: 28722DescriptionFred Mapper is considering purchasing some原创 2012-04-09 19:13:13 · 430 阅读 · 0 评论 -
Hangover解题报告
HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 76928 Accepted: 36660DescriptionHow far can you make a stack of cards overhang a table? If y原创 2012-04-09 18:51:25 · 507 阅读 · 0 评论 -
POJ1083-Moving Tables解题报告
Moving TablesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20728 Accepted: 6814DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a原创 2012-07-17 19:10:47 · 509 阅读 · 0 评论 -
POJ3094-Quicksum解题报告
QuicksumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10876 Accepted: 7489DescriptionA checksum is an algorithm that scans a packet of data and return原创 2012-07-17 20:23:21 · 740 阅读 · 0 评论 -
POJ3006-Dirichlet's Theorem on Arithmetic Progressions解题报告
Dirichlet's Theorem on Arithmetic ProgressionsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11749 Accepted: 5923DescriptionIf a and d are relatively p原创 2012-07-17 19:57:29 · 868 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 30437 Accepted: 9390DescriptionFarmer John has been informed of the location of a fugiti原创 2012-07-19 10:13:07 · 419 阅读 · 0 评论 -
免费馅饼
#include#include#include#includeusing 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 · 765 阅读 · 0 评论 -
免费馅饼
#include#include#include#includeusing 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 · 794 阅读 · 0 评论