黑猫5027的博客

PictureTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23002    Accepted Submission(s): 11710Problem DescriptionGive you the wid

改革春风吹满地Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26698    Accepted Submission(s): 13762Problem Description“ 改革春风吹满地,不会AC

人见人爱A^BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32219    Accepted Submission(s): 21834Problem Description求A^B的最后三位数表示的整数。

人见人爱A-BTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62480    Accepted Submission(s): 17461Problem Description参加过上个月月赛的同学一定还记得

杨辉三角Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51969    Accepted Submission(s): 21615Problem Description还记得中学时候学过的杨辉三角吗？具体的

进制转换Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37115    Accepted Submission(s): 20351Problem Description输入一个十进制数N，将它转换成R进制数

汉字统计Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35086    Accepted Submission(s): 19134Problem Description统计给定文本文件中汉字的个数。

Lowest Common Multiple PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46807    Accepted Submission(s): 19369Problem Description

海选女主角Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 47814    Accepted Submission(s): 21210Problem Descriptionpotato老师虽然很喜欢教书，但是

母牛的故事Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62577    Accepted Submission(s): 31061Problem Description有一头母牛，它每年年初生一头小母牛。

亲和数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30972    Accepted Submission(s): 18660Problem Description古希腊数学家毕达哥拉斯在自然数研究中

Equation AgainTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1455    Accepted Submission(s): 451Problem DescriptionThis problem

题目大意：给一个M*N的棋盘，其中上面有棋子，全都是黑白的，黑色是1，白色是0。要求把棋盘上的所有元素都给翻成白色的，每次翻动其中一颗棋子，上下左右的四颗棋子也会被翻动。问，如何用最少的次数将全部棋子变成白色，如果不能变成白色，就输出impossible。思路：        枚举出第一排的所有反转的方法。然后从第二排开始，如果上面一排是黑色，那么第二排就反转，以此类推，知道最

Switch GameTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14215    Accepted Submission(s): 8681Problem DescriptionThere are man

An easy problemTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18849    Accepted Submission(s): 12585Problem Descriptionwe defin

A + B AgainTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20734    Accepted Submission(s): 8940Problem DescriptionThere must be

Face The Right WayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3537 Accepted: 1638DescriptionFarmer John has arranged his N (1 ≤ N ≤ 5,000) cows in

龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14796    Accepted Submission(s): 5491Problem Description据说在很久很久以前，可怜的兔子经历了人生

The sum problemTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20449    Accepted Submission(s): 6006Problem DescriptionGiven a s

Clarke and chemistryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 195    Accepted Submission(s): 110Problem DescriptionClarke

Clarke and pointsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 146    Accepted Submission(s): 108Problem DescriptionClarke is

广工的网页http://gdutcode.sinaapp.com/contest.php?cid=1027转载的网页：http://blog.youkuaiyun.com/acm_fighting/article/details/50354098Problem H: 跑操场Description Three_Sbs赛跑，不不不，是三个sb绕一环形跑道

n个恶龙，m个勇士。只有当勇士的能力值大于等于恶龙的时候才能斩杀他，并且雇佣一定能力值的勇士需要一定的费用。问，如何用最小的费用来雇佣勇士，并且能杀完龙，如果不能就输出loowater...sort一下暴力就好了#include#include#includeusing namespace std;const int maxn = 20000 + 5;