linlinsong—ACM界蒟水！

http://7xjob4.com1.z0.glb.clouddn.com/53e5c6d66221525b0c18113b513fc3fb很简单的排序和检索。 下面是AC代码：#include<cstdio>#include<algorithm>using namespace std;const int maxn=10000;int main(){ int n,q,x,a[maxn

Background Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world i

题目：http://7xjob4.com1.z0.glb.clouddn.com/c0d75d1818b79aa14b802f9660a055f7本题是set的简单用法。 下面是AC代码：#include<cstdio>#include<cstring>#include<string>#include<set>#include<sstream>#include<iostream>#in

http://acm.hust.edu.cn/vjudge/contest/128220#problem/D 中文题意：输入一些单词，找出满足如下条件的单词：该单词不能通过字母重排，得到文本中的另一个单词。在判断是否满足条件时，字母不分大小写，但在输出是应保留输入中的大小写，按字典序进行排序（所有大写字母在所有小写字母的前面）。下面是AC代码：#include<iostream>#include

题目：http://7xjob4.com1.z0.glb.clouddn.com/bc8f4a27cb57cafb184320d2484b0cda就是简单的队列模拟。 下面是AC代码：#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;int a[50];int ma

题目：http://7xjob4.com1.z0.glb.clouddn.com/4014fbee7e223cef72af57b4d654578c很简单的题目，只需分为两个集合，然后判断两个集合里的元素是不是完全相等就OK了。 下面是AC代码：#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#inc

题目链接：https://odzkskevi.qnssl.com/0a3315a2fe9c8c8a8d0f9f9a53ac18fa【题目分析】用队列来模拟一个多人排队的过程。#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#include<map>using namespace std;const int