CNnumen

<br />#include <cstdlib>#include <iostream>#include <vector>#include <numeric>using namespace std;typedef struct _NODE{ int id; int val; int operator()(int nod, _NODE &node) { return nod * (node.val); }

<br />#include <cstdlib>#include <iostream>#include <list>#include <iterator>#include <vector>#include <algorithm>#include <string>using namespace std;typedef struct _NODE{ int id; string str; _NODE(int id, string str

<br />#include <cstdlib>#include <iostream>#include <list>#include <iterator>#include <algorithm>using namespace std;typedef struct _NODE{ int id; string str; _NODE(int id, string str) : id(id), str(str){}; fri

<br />#include <cstdlib>#include <iostream>#include <map>using namespace std;int main(int argc, char *argv[]){ map<char, int> table; string numberStr; cout << "please input the number string: " << endl; cin >> numberStr;

<br />#include <cstdlib>#include <iostream>#include <stack>using namespace std;typedef struct _NODE{ string str; int id; _NODE(string str, int id) : str(str), id(id){}; friend ostream& operator << (ostream &os, con

<br />#include <cstdlib>#include <iostream>#include <set>#include <algorithm>#include <iterator>using namespace std;typedef struct _NODE{ string name; int id; _NODE(string name, int id) : name(name), id(id){};

<br />#include <cstdlib>#include <iostream>#include <list>#include <iterator>#include <algorithm>using namespace std;typedef struct _NODE{ string str; int id; _NODE(string str, int val) : str(str), id(val){}; f

<br />#include <cstdlib>#include <iostream>#include <queue>#include <iterator>using namespace std;int main(int argc, char *argv[]){ queue<int> que; for(int i=0; i<10; i++) que.push(i); cout << "queue size is:

<br /> 原文链接：http://blog.youkuaiyun.com/aipb2008/archive/2008/03/29/2227490.aspx<br /> 在标准库算法中,next_permutation应用在数列操作上比较广泛.这个函数可以计算一组数据的全排列.但是怎么用,原理如何,我做了简单的剖析.<br /> <br />首先查看stl中相关信息.<br />函数原型:<br />template<class BidirectionalIterator><br />   bool next_per

<br /> Description:<br />将01串首先按长度排序，长度相同时，按1的个数多少进行排序，1的个数相同时再按ASCII码值排序。<br /> Input:<br />输入数据中含有一些01串，01串的长度不大于256个字符。Output:<br />重新排列01串的顺序。使得串按基本描述的方式排序。Sample Input:10011111000011011010101101100Sample Output:01110010101010000110

<br />#include <cstdlib>#include <iostream>#include <algorithm>#include <vector>#include <string>#include <fstream>#include <iterator>using namespace std;typedef struct _NODE{ string str; int id; _NODE(string str,

<br />#include <cstdlib>#include <iostream>#include <vector>#include <algorithm>#include <fstream>#include <iterator>using namespace std;int main(int argc, char *argv[]){ ifstream input1("input1.txt"); ifstream input2("input2.txt"

#include #include #include #include #include using namespace std;typedef struct _NODE{ int id; int val; _NODE(int id, int val): id(id), val(val){}; friend ostream& operator

<br />#include <cstdlib>#include <iostream>#include <string>#include <sstream>using namespace std;string numericToStr(int val){ ostringstream os; if(os << val) return os.str(); return string();}int strToN

<br />#include <cstdlib>#include <iostream>#include <iterator>#include <vector>#include <string>#include <fstream>#include <algorithm>using namespace std;int const BUFFER_SIZE = 10;int main(int argc, char *argv[]){ istream_iterator

<br />#include <cstdlib>#include <iostream>#include <set>using namespace std;int main(int argc, char *argv[]){ set<int> s; for(int i=0 ;i<100; i++) { pair<set<int>::iterator, bool> ret; int val = rand() % 50

<br />#include <cstdlib>#include <iostream>#include <map>#include <utility>using namespace std;int main(int argc, char *argv[]){ map<int, int> m; typedef map<int, int>::value_type vt; for(int i=0; i<50; i++) {

<br />#include <cstdlib>#include <iostream>#include <vector>#include <algorithm>#include <iterator>using namespace std;bool cmp(const string &str1, const string str2){ return str1 < str2;}bool gt6(const string &str){ return

#include #include #include #include #include #include using namespace std;int main(int argc, char *argv[]){ string inputFileName("input.txt"); ifstream inputFile(inputFileName.c_str()); if(!inputFile) { cerr >

<br />#include <cstdlib>#include <iostream>#include <map>#include <fstream>#include <sstream>using namespace std;int main(int argc, char *argv[]){ string dicFileName("dicFile.txt"); string input("input.txt"); string output("out

#include #include #include #include #include #include #include #include #include using namespace std;int const MAX_NUM = 100;typedef struct _NODE{ int id; string str; _NODE(int id, string str) : id(id), str(str){};

<br />#include <cstdlib>#include <iostream>#include <vector>#include <string>#include <iterator>#include <fstream>using namespace std;typedef struct _NODE{ string str; int id; _NODE(string str, int id) : str(str), id(id

<br />#include <algorithm>#include <vector>#include <ctime>#include <iostream>using namespace std;const int MAX = 50;int main(int argc, char *argv[]){ vector<int> vec; int each; int count = 10; srand((unsigned)time(