lhc-----

哈理工OJ-2330 Description ACM twist-toy encountered such a problem in the work, this article, to ensure that this article only lowercase letters and spaces, please send the articles in each word inve...

#1831 : 80 Days时间限制:1000ms单点时限:1000ms内存限制:256MB描述80 Days is an interesting game based on Jules Verne’s science fiction “Around the World in Eighty Days”. In this game, you have to manage the limi...

#include<bits/stdc++.h>using namespace std;int num=-1e9;struct node{ int x,y;} stu[55];int cmp(node a,node b){ if(a.x==b.x) return a.y<b.y; return a.x<b.x;}int main(...

Ignatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius want ...

HRBUST - 1248-The kth great number 【优先队列】 Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number i...

L一直喜欢玩游戏王这款声控印卡游戏，使用一套连锁式削血卡组便可战无不胜。每当陷入危机即将败北之际，L便会高呼“最强的决斗者一切都是必然的！”，然后发动闪光印卡技能，直接翻盘，伤害不多不少，正好足够击败对手。发动闪光印卡技能后，L抽取一张牌，然后微微一笑。接着L以一定顺序打出若干张牌，造成的伤害正好等于对方的生命值。每一张牌都有其发动速度以及效果。如果后发动的一张牌的发动速度不小于前一张牌，则后...

给你两个升序排列的集合，求出两个集合的交集。 // 2 3 1 2 1 2 3输出：1 2 //#include<bits/stdc++.h>using namespace std;int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int a...

hrbust-1170-语法检查-括号匹配【栈应用】 检索括号匹配 学会多行输入，每行检测方式。 还有栈。【先进后出】【后进先出】#include<bits/stdc++.h>using namespace std;char a[10000][10000];int main(){ while(scanf("%s",&a[0])!=EOF) { int i

SummaryProblem DescriptionSmall W is playing a summary game. Firstly, He takes N numbers. Secondly he takes out every pair of them and add this two numbers, thus he can get N*(N - 1)/2 new num

What Are You Talking About Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars an...

Skip the ClassProblem DescriptionFinally term begins. luras loves school so much as she could skip the class happily again.(wtf?)Luras will take n lessons in sequence(in another word, to have

主要是为了学习vector。参考了http://blog.youkuaiyun.com/lsh_2013/article/details/46731331?%3E1.声明： 一个vector类似于一个动态的一维数组。vector中可以存在重复的元素！ vector a;   // 声明一个元素为int类型的vector avectot a;  // 声明一个元素为MyType类型的

贪心思想是：数据排序的贪心方式进行n-1次甲方 每次最小的俩个和进入队列，然后将每次和相加#include&lt;bits/stdc++.h&gt;using namespace std;struct node{ int x; bool operator&lt;(const node &amp;a)const { return x &gt; a....