u013087645的专栏

//动态数组 vector/*assign();对vector 进行赋值at();返回指定位置的元素back() 返回最末元素begin() 返回第一个元素的迭代器capacity() 返回vector 所能容纳的元素数量clear() 清空所有元素empty() 判断vector是否为空end() 返回最末元素的迭代器erase() 删除指定元

题意给出m个bug，每一个bug有个复杂程度，有n个同学每一个同学有自己的能力值b，和想要的东西c，假设雇佣第i个同学，那么能解决全部复杂程度小于等于b[i]的bug，每天一人仅仅能解决一个，学校要付出c，不论i攻克了几个bug问，学校在付出不超过s，且最少的天数须要多少。有两个限制，1.总和不能超过s，2.要求最少天数。仅仅能限制一个，来求还有一个，假设求总和不能

DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind

今天出来实习的第四天实在无聊，就偷偷写着玩给一个字符二维数组让你按字典序进行排序#include#include#include#include#include#includeusing namespace std;bool compare(char *p1,char *p2){ if (strcmp(p1,p2)<0) return true; else

题目描述Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and benefits people a lot". However, If you ask Merlin this question on the New Ye

DescriptionWell, how do you feel about mobile phone? Your answer would probably be something like that "It's so convenient and benefits people a lot". However, If you ask Merlin this question on t

DescriptionThe D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprisi

DescriptionHardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter. America's temperate climates produce forests with

DescriptionIn a letter dated December 25, 1640; the great mathematician Pierre de Fermat wrote to Marin Mersenne that he just proved that an odd prime p is expressible as p = a2 + b2 if and only i

DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city coun

Description 在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所消耗体力之和。Input 第一行是一个整数n(1

DescriptionOur Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i equals 0. This Black Box proce