08 2014 档案

摘要:Sudoku CheckerTime Limit:2000/1000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionSudoku is a p... 阅读全文
posted @ 2014-08-29 21:32 雪溯 阅读(306) 评论(0) 推荐(0) 编辑
摘要:Robot MotionTime Limit:1000MSMemory Limit:10000KTotal Submissions:10708Accepted:5192DescriptionA robot has been programmed to follow the instructions ... 阅读全文
posted @ 2014-08-29 09:54 雪溯 阅读(147) 评论(0) 推荐(0) 编辑
摘要:Crashing RobotsTime Limit:1000MSMemory Limit:65536KTotal Submissions:7799Accepted:3388DescriptionIn a modernized warehouse, robots are used to fetch t... 阅读全文
posted @ 2014-08-29 08:40 雪溯 阅读(151) 评论(0) 推荐(0) 编辑
摘要:ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:19716Accepted:11910DescriptionLet S = s1 s2...s2n be a well-formed string of parenth... 阅读全文
posted @ 2014-08-28 21:15 雪溯 阅读(141) 评论(0) 推荐(0) 编辑
摘要:TautologyTime Limit:1000MSMemory Limit:65536KTotal Submissions:9580Accepted:3640DescriptionWFF 'N PROOF is a logic game played with dice. Each die has... 阅读全文
posted @ 2014-08-28 16:41 雪溯 阅读(193) 评论(0) 推荐(0) 编辑
摘要:Y2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:10537Accepted:5264DescriptionAccounting for Computer Machinists (ACM) has suff... 阅读全文
posted @ 2014-08-28 11:49 雪溯 阅读(193) 评论(0) 推荐(0) 编辑
摘要:import java.math.BigInteger;import java.util.Scanner;public class Main { static BigInteger p,l,r,div; static int n; public static int cmp(Big... 阅读全文
posted @ 2014-08-28 10:24 雪溯 阅读(213) 评论(0) 推荐(0) 编辑
摘要:http://codeforces.com/contest/462A:Appleman and Easy Task要求是否全部的字符都挨着偶数个'o'#include using namespace std;char maz[101][101];int n;int cnt[101][101];con... 阅读全文
posted @ 2014-08-28 08:45 雪溯 阅读(343) 评论(0) 推荐(0) 编辑
摘要:ParatroopersTime Limit:1000MSMemory Limit:65536KTotal Submissions:7267Accepted:2194DescriptionIt is year 2500 A.D. and there is a terrible war between... 阅读全文
posted @ 2014-08-21 09:42 雪溯 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Going HomeTime Limit:1000MSMemory Limit:65536KTotal Submissions:17955Accepted:9145DescriptionOn a grid map there are n little men and n houses. In eac... 阅读全文
posted @ 2014-08-20 10:44 雪溯 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Minimum CostTime Limit:4000MSMemory Limit:65536KTotal Submissions:13511Accepted:4628DescriptionDearboy, a goods victualer, now comes to a big problem,... 阅读全文
posted @ 2014-08-20 09:52 雪溯 阅读(202) 评论(0) 推荐(0) 编辑
摘要:Jamie's Contact GroupsTime Limit:7000MSMemory Limit:65536KTotal Submissions:6511Accepted:2087DescriptionJamie is a very popular girl and has quite a l... 阅读全文
posted @ 2014-08-18 13:47 雪溯 阅读(234) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=3352有重边的话重边就不被包含在双连通里了割点不一定连着割边,因为这个图不一定是点连通,所以可能出现反而多增加了双连通分量数的可能必须要用割边的思路来看#include #include using namespace std;const int... 阅读全文
posted @ 2014-08-17 15:41 雪溯 阅读(163) 评论(0) 推荐(0) 编辑
摘要:http://codeforces.com/contest/459A题 Pashmak and Garden化简化简水题,都告诉平行坐标轴了,数据还出了对角线,后面两个点坐标给的范围也不错#include int x[4],y[4];int abs(int n){ return n#inclu... 阅读全文
posted @ 2014-08-17 02:52 雪溯 阅读(357) 评论(0) 推荐(0) 编辑
摘要:给你一个uint32 a,让你找到另一个uint32 b,使b > a,且b的二进制中1的个数等于a二进制中1的个数。且使b最小。(数据保证可出)1 因为1的个数不变,所以必然大于n+lowbit(n);(lowbit(int n){return n&-n;}//取n的最小一个100000串,也就是... 阅读全文
posted @ 2014-08-16 23:55 雪溯 阅读(233) 评论(0) 推荐(0) 编辑
摘要:http://poj.org/problem?id=2186注意是从起点往后搜索的,另外两集相交得到的就是拓扑序#include #include #include #include using namespace std;const int maxn=10010;const int maxm=5... 阅读全文
posted @ 2014-08-15 17:32 雪溯 阅读(105) 评论(0) 推荐(0) 编辑
摘要:Command NetworkTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%I64d & %I64uDescriptionAfter a long lasting war on words, a war on arms finally ... 阅读全文
posted @ 2014-08-15 16:07 雪溯 阅读(218) 评论(0) 推荐(0) 编辑
摘要:坑!!!我还以为一个整数会截到两行!!Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:40056Accepted:16303DescriptionFarmer John has been elected mayor of h... 阅读全文
posted @ 2014-08-13 15:19 雪溯 阅读(151) 评论(0) 推荐(0) 编辑
摘要:感受到出题人深深的~恶意这提醒人们以后。。。数字后面要用gets~不要getchar此外。。不要相信那个100?Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:8524Accepted:2872DescriptionThe... 阅读全文
posted @ 2014-08-13 12:09 雪溯 阅读(157) 评论(0) 推荐(0) 编辑
摘要:这教导人们一定要看题,要看题,元音包含了‘y’,完毕,要看题啊#include #include #include using namespace std;char buff[1001];int main(){ scanf("%s",buff); for(int i=0;buff[i];... 阅读全文
posted @ 2014-08-12 21:20 雪溯 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Shredding CompanyTime Limit:1000MSMemory Limit:10000KTotal Submissions:4115Accepted:2325DescriptionYou have just been put in charge of developing a ne... 阅读全文
posted @ 2014-08-12 10:26 雪溯 阅读(175) 评论(0) 推荐(0) 编辑
摘要:题目:给定3#include using namespace std;const int maxsum=250*250*2+1;const int maxhlen=250*250;bool vis[maxsum];int len[maxsum];int use[maxhlen];int heap[m... 阅读全文
posted @ 2014-08-10 10:53 雪溯 阅读(210) 评论(0) 推荐(0) 编辑
摘要:491. Study sister's wizard时间限制1000 ms内存限制65536 KB题目描述Study sister plays the game coc everyday. Now she wants to upgrade her wizard in laboratory,but s... 阅读全文
posted @ 2014-08-10 07:13 雪溯 阅读(201) 评论(0) 推荐(0) 编辑
摘要:1A. Theatre Squaretime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputTheatre Square in the capital c... 阅读全文
posted @ 2014-08-09 23:38 雪溯 阅读(153) 评论(0) 推荐(0) 编辑
摘要:488. 小妹妹个数时间限制3000 ms内存限制65536 KB题目描述喜欢焦叔叔的小妹妹实在是太多了,以至于焦叔叔不得不给她们编号1-N。焦叔叔对于编号为质数的小妹妹有种特别的好感,由于有好感的小妹妹数目太多,焦叔叔自己都数不清楚了,请你来帮忙数一下。输入格式多组数据,每行一个正整数N,N不大于... 阅读全文
posted @ 2014-08-07 15:51 雪溯 阅读(240) 评论(0) 推荐(0) 编辑
摘要:A. diffsum2014新生暑假个人排位赛09时间限制1000 ms内存限制65536 KB题目描述You are givin an array of integers, and you are to figure out the sum of differences between each ... 阅读全文
posted @ 2014-08-04 10:00 雪溯 阅读(289) 评论(0) 推荐(0) 编辑
摘要:这是一道水题,这里是最大流解法,之后再补坑在又忘了反向建边了题意:给你二维bool数组,让你求出能用多米诺骨牌覆盖所有 1 且骨牌最少的放法(因为多米诺骨牌1*2的结构方便描述,原题没有),原本的数据是字符数组,'*'为1,'o'为0,思路:仔细看看题会发现是上下左右只能取一个,不是那种十字星形的取... 阅读全文
posted @ 2014-08-04 09:37 雪溯 阅读(130) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示