oinei的博客

题意：输出1到=n的全排列。 输入样例： 3 输出样例： 123 132 213 231 312 321next_permutation(a,a+n); 按照字典序排序#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>

#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#define INF 0x3f3f3f3fusing namespace std;map<string,i

A computer is only connected with the computers next to it. At the beginning, T computers were infected with the Panda Virus, each with a different variation (Type 1, Type 2… Type T). Each computer in

寻找大于等于一个数的位置#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <map>#include <cmath>#include <iostream>#include <set>#include <vector>#define INF

栈和队列都没有迭代器 vector，map，set有迭代器（iterator）1.set set&amp;lt; int &amp;gt; q; //集合 q.insert(x); //将x推入集合，内部已自动排序且无重复项，无需sort与unique q.begin(); //集合的首地址 q.end(); //集合的尾地址 q.size();//集合的大小set&amp;lt; int &amp;gt; ...

Have you played Draw Something? It’s currently one of the hottest social drawing games on Apple iOS and Android Devices! In this game, you and your friend play in turn. You need to pick a word and draw

Chiaki has n strings s1,s2,…,sn consisting of ‘(’ and ‘)’. A string of this type is said to be balanced:if it is the empty stringif A and B are balanced, AB is balanced,if A is balanced, (A) is b...