Oops的博客

Cow BowlingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19801 Accepted: 13123DescriptionThe cows don't use actual bowling balls when they go bowling.

http://poj.org/problem?id=3107 题意：删掉某点后子树节点最多的最小思路：其实就是求树的重心代码：#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<vector>u...

题目链接：http://poj.org/problem?id=1811题意：判断一个数是否为素数，如果不是则找到它最小的素数因子。思路：因为n很大，不好打表处理，用miller_rabin判断n是否为素数，再用Pollard_rho算法找素数因子。代码：#include <iostream>#include <stdio.h>#include <string.h&...

Spell checkerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 26110 Accepted: 9569DescriptionYou, as a member of a development team for a new spell check

Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10268 Accepted: 4291DescriptionBessie is such a hard-working cow. In fact, she is so focused

Wooden SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23751 Accepted: 10236DescriptionThere is a pile of n wooden sticks. The length and weight o

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10203 Accepted: 4892DescriptionKeeping track of all the cows can be a tricky task so

Apple CatchingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12979 Accepted: 6308DescriptionIt is a little known fact that cows love apples. Farmer Joh

SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 19539 Accepted: 7635DescriptionFarmer John commanded his cows to search for different sets of nu

http://poj.org/problem?id=2378  题意：   给一颗n个结点的树，节点编号为1~n，把删除一个节点之后，    剩下的分支中节点数量最多的数量不大于总数量一半的编号全部按顺序输出 思路： 跟求树的重心一样的方法，先从下往上更新，在从上往下跟新即可。代码：#include<iostream>#include<stdi...