流水依依

摘要： Stealing Harry Potter's PreciousTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Verno 阅读全文

摘要： Lights Against DudelyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionHarry: "But Hagrid. How am I going to pay for all of this? I haven't any money."Hagrid: "Well there's your money, Harry! Gringotts, the wizard bank! Ain't 阅读全文

摘要： #include #include #include #include using namespace std ;using namespace cv ;int main(){ Mat now=imread("girl.jpg") ; if(now.empty()){ cout(i,j)[k]=255-now.at(i,j)[k] ; } imshow("new!",re) ; imwrite("girl3.jpg",re) ; waitKey(0) ; return 0 ;} 阅读全文

摘要： #include #include #include using namespace cv ;using namespace std ;int main(){ Mat now ,result; now=imread("girl.jpg") ; if(now.empty()) return -1 ; //printf("%d %d\n",now.cols ,now.rows) ; imshow("mygirl",now) ; waitKey(0) ; int N=now.rows ; int M=now.cols ; resu... 阅读全文

摘要： 1738 - TWO NODES时间限制:10000 MS内存限制:65535 KB问题描述Suppose that G is an undirected graph, and the value of stab is defined as follows:Among the expression, G-i,-jis the remainder after removing node i, node j and all edges that are directly relevant to the previous two nodes.cntCompent(X) is the number o 阅读全文

摘要： Caocao's BridgesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionCaocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another 阅读全文

摘要： Ikki's Story IV - Panda's TrickTime Limit:1000MSMemory Limit:131072KTotal Submissions:7296Accepted:2705Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play ano 阅读全文

摘要： PartyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3551Accepted Submission(s): 1154Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？Inputn： 表示有n对夫妻被邀请 (n#include #inclu 阅读全文

摘要： Holiday's AccommodationTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 200000/200000 K (Java/Others)Total Submission(s): 2009Accepted Submission(s): 558Problem DescriptionNowadays, people have many ways to save money on accommodation when they are on vacation.One of these ways is exchanging 阅读全文

摘要： Drainage DitchesTime Limit:1000MSMemory Limit:10000KDescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of 阅读全文