摘要:
B. Vasya and Cornfield time limit per test1 second memory limit per test:256 megabytes input:standard input output:standard output Vasya owns a cornfi 阅读全文
摘要:
简单的贪心问题,将需要接水时间最小的放到最前面可使整体接水时间最少。排一下序算一下总时间平均值。代码如下: c include include include include include include include include include include include includ 阅读全文
摘要:
sort Time Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 60210 Accepted Submission(s): 16618 Problem 阅读全文
摘要:
题目描述 对于一个递归函数w(a,b,c) 如果 a≤0 or b≤0 or c≤0 就返回值1. 如果 a 20 or b 20 or c 20 就返回w(20,20,20) 如果 a include define ll long long using namespace std ; ll f( 阅读全文
摘要:
简单的结构体排序,可是最后一组样例总是通不过?看了别人的题解才知道原来编号也得算进排序…题目里面还告诉了…结果WA了几次…果然这是没认真读题的后果…生日从大到小的意味着年份小,相同年分比月份小,相同月份比天数小,相同天数比编号大…代码如下: c++ include include include i 阅读全文
摘要:
店长终极推荐 Time Limit: 2000 MS Memory Limit: 65536 K Total Submit: 743(214 users) Total Accepted: 261(195 users) Rating: Special Judge: No Description 玩腻了 阅读全文
摘要:
直接用map容器建立对应关系水过…首先别忘记清空整个map容器,最后输入键使对应的值+1就好了。代码如下: c++ include include include include include include include include include include include incl 阅读全文
摘要:
STL的应用。想到全排列就想到了STL中的 next_permutation() 函数。用字符串读取输入,用 sort() 对其进行排序,再用 next_permutation() 输出结果。代码如下: c++ include include include include include incl 阅读全文