搬砖 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5134    Accepted Submission(s): 1288 Problem Description   小明现在是人见人爱,花见花开的高富帅,整天沉浸在美女环绕的笙歌妙舞当中.但是人们有所不知,春风得意的小明也曾有着一段艰苦的奋斗史. 那时的小明还没剪去长发,没有信用卡没…

1005 ACM组队安排 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description   ACM亚洲区比赛结束,意味着开始备战明年的浙江省大学生程序设计竞赛了!   杭州电子科技大学ACM集训队也准备开始组队.   教练想把所有的n个队员组成若干支队伍,原则是每支队伍至少一人,最多三人.   现在问题来了:如果已知集训队队员的数量n,请你帮教练计算出…

Study Words Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 195    Accepted Submission(s): 66 Problem Description Learning English is not easy, vocabulary troubles me a lot. One day an idea cam…

Polygon Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 195    Accepted Submission(s): 41 Problem Description Give you a simple polygon and a line, and your task is to calculate the length of t…

The Country List Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2464    Accepted Submission(s): 576 Problem Description As the 2010 World Expo hosted by Shanghai is coming, CC is very honorabl…

#include<cstdio> #include<cstring> #include<map> #include<string> #include<algorithm> using namespace std; int T; +]; +]; map<string,int>m; struct dan { +]; int num; }d[+]; int sum; int tot; bool cmp(const dan&a,con…

#include<cmath> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int whp,wat,wdef,bhp,bat,bdef; char s; int main() { while(~scanf("%c",&s)) { scanf("%d%d%d",&whp,&wat,&…

#include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> #include<math.h> #include<map> #include<queue> using namespace std; +; char s[maxn][maxn]; int n,m; int c[maxn][maxn]; *maxn][*maxn]; int…

#include<cstdio> #include<algorithm> using namespace std; using namespace std; +; int a[maxn],b[maxn]; int main() { int n,m; while(scanf("%d %d",&n,&m)!=EOF) { ; i<=n; i++) scanf("%d",&a[i]); ; i<=m; i++)…

#include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<algorithm> using namespace std; +; int G[maxn][maxn]; int f[maxn]; int n; struct Egde { int u,v; int val; } e[maxn*maxn]; bool cmp(const Egde&a,…