welcome to 浩·C's blog

Solving OrderTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1306    Accepted Submission(s): 859Problem DescriptionWelcome to HD

//思路：用map记录重排string后出现的次数，如果为1次，就是我们想要的结果AC源码：#include #include #include #include #include #include using namespace std;map cnt;vector svec;void solve(){ string buf; while(cin>>bu

Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns. There are different normal forms that database may adhere

Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the qu

USACO ORZTime Limit: 5000/1500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4954    Accepted Submission(s): 1630Problem DescriptionLike everyone, c

Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 121221    Accepted Submission(s): 47632Problem DescriptionCo

//思路：如果x是丑数，那么2*x,3*x,5*x都是丑数，则可以用一个优先队列保存生成的丑数(另外需要判重即相同的丑数不能入队列)AC源码：#include #include #include #include using namespace std;const int A[]={2,3,5};typedef long long LL;int main(){

StonesTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2739    Accepted Submission(s): 1763Problem DescriptionBecause of the wron

ShopaholicTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3117    Accepted Submission(s): 1706Problem DescriptionLindsay is a sh

//思路:用vector存储，在sort排序就可以了AC代码：#include #include #include using namespace std;int main(){ int N,Q,kase=0; while(cin>>N>>Q&&N) { cout<<"CASE# "<<(++kase)<<":"<<endl; vector ivec;