# include<stdio.h> # include <algorithm> # include <string.h> # include <iostream> using namespace std; int main() { int n,m,i,j,k; int c1[110],c2[110]; int a[110],b[110]; while(~scanf("%d%d",&n,&m)) { for(i=0;i&l…
Fruit Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2432 Accepted Submission(s): 1345 Problem Description 转眼到了收获的季节,由于有TT的专业指导,Lele获得了大丰收.特别是水果,Lele一共种了N种水果,有苹果,梨子,香蕉,西瓜……不但味道好吃,样子更是好看. 于是,…
Fruit Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3514 Accepted Submission(s): 1998 Problem Description 转眼到了收获的季节,由于有TT的专业指导,Lele获得了大丰收.特别是水果,Lele一共种了N种水果,有苹果,梨子,香蕉,西瓜……不但味道好吃,样子更是好看. 于是,…
系数为1的母函数…… #include <cstdio> #include <cstring> using namespace std; int n,m,size[105][2],c1[105],c2[105]; int main(){ while(scanf("%d%d",&n,&m)!=EOF){ for(int i=1;i<=n;i++)scanf("%d%d",&size[i][0],&size[…
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2152 本题采用母函数模板求解,母函数模板如下: http://blog.csdn.net/ten_sory/article/details/59483762 本题中的价值v[i]均为1,s[i]=A[i],e[i]=B[i],套用上述模板,容易求解. C++代码如下: #include<iostream> using namespace std; int main() { int N,M; while…
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4000 Recently, dobby is addicted in the Fruit Ninja. As you know, dobby is a free elf, so unlike other elves, he could do whatever he wants.But the hands of the elves are somehow strange, so when he cuts…
Fruit Ninja Extreme Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 880 Accepted Submission(s): 231 Special Judge Problem Description Cut or not to cut, it is a question. In Fruit Ninja, com…
找单词 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4208 Accepted Submission(s): 3023 Problem Description 如果有x1个字母A, x2个字母B,..... x26个字母Z,同一时候如果字母A的价值为1,字母B的价值为2,..... 字母Z的价值为26.那么,对于给定的字母,能…
