2013年8月8日
ACM POJ 3370 Halloween treats
摘要： Halloween treatsTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call o 阅读全文
posted @ 2013-08-08 11:03 围剿大叔 阅读(274) 评论(0) 推荐(0)
能不能不要手贱了
摘要： 总结下自己老是犯的2b错误1.=写成==2.for或者while后加了个；3.变量写错4.以后再补充以此为贱！ 阅读全文
posted @ 2013-08-08 10:01 围剿大叔 阅读(134) 评论(0) 推荐(0)
ACM POJ 2356
摘要： Find a multipleTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionThe input contains N natural (i.e. positive integer) numbers ( N #include const int N = 10001;int a[N],sum[N],visit[N] ;int n;void print(int i,int j){ printf("%d\n&qu 阅读全文
posted @ 2013-08-08 09:59 围剿大叔 阅读(195) 评论(0) 推荐(0)