随笔分类 - 。。。背包
1
摘要:Piggy-Bank Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19387 Accepted Submission(s): 9822 Pr
阅读全文
摘要:钱币兑换问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8865 Accepted Submission(s): 5349 Problem
阅读全文
摘要:Modulo Sum time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Modulo Sum time limit per tes
阅读全文
摘要:Dima and Salad time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Dima and Salad time limit
阅读全文
摘要:C. Buns time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Lavrenty, a baker, is going to m
阅读全文
摘要:SumsetsTime Limit:2000MSMemory Limit:200000KTotal Submissions:15045Accepted:5997DescriptionFarmer John commanded his cows to search for different sets...
阅读全文
摘要:1079 - Just another RobberyPDF (English)StatisticsForumTime Limit:4 second(s)Memory Limit:32 MBAs Harry Potter series is over, Harry has no job. Since...
阅读全文
摘要:硬币找零时间限制:1000 ms | 内存限制:65535 KB 难度:3描述在现实生活中,我们经常遇到硬币找零的问题,例如,在发工资时,财务人员就需要计算最少的找零硬币数,以便他们能从银行拿回最少的硬币数,并保证能用这些硬币发工资。我们应该注意到,人民币的硬币系统是 100,50,20,10,5,...
阅读全文
摘要:In ActionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4764Accepted Submission(s): 1569Problem D...
阅读全文
摘要:The Highest MarkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 247Accepted Submission(s): 101Pr...
阅读全文
摘要:饭卡Time Limit : 5000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6Accepted Submission(s) : 3Problem Description电子科...
阅读全文
摘要:I NEED A OFFER!Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4Accepted Submission(s) : 2Problem D...
阅读全文
摘要:Bone Collector Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 21 Accepted Submission(s) : 6 Prob
阅读全文
摘要:悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6Accepted Submission(s) : ...
阅读全文
摘要:Euro EfficiencyTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 12Accepted Submission(s) : 3Problem ...
阅读全文
摘要:Proud MerchantsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 12Accepted Submission(s) : 5Problem...
阅读全文
摘要:又见01背包时间限制:1000ms | 内存限制:65535KB难度:3描述有n个重量和价值分别为wi 和 vi 的 物品,从这些物品中选择总重量不超过 W的物品,求所有挑选方案中物品价值总和的最大值。 1 2 struct goods{ 3 int w,v; 4 }goods[110]; 5...
阅读全文
摘要:欢迎“热爱编程”的高考少年——报考杭州电子科技大学计算机学院 寒冰王座Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12875Accepted S...
阅读全文
摘要:1 #include 2 #include 3 struct Case{ 4 int price,importance; 5 }data[25]; 6 int main(){ 7 int N,m,T,bag[30000],a,b; 8 scanf("%d",&T); 9 ...
阅读全文
摘要:1 #include 2 #include 3 #include 4 using namespace std; 5 int bag[1001]; 6 struct Case{ 7 int c,w; 8 }apple[1010]; 9 /*int cmp(Case a,Case b){10 ...
阅读全文
1