chengyangyy的专栏

多线程相关

原型：extern int strcmp(const void *s1, const void *s2);用法：#include 功能：比较字符串s1和s2是否相同,区分大小写。说明：如果s1=s2则返回零，否则返回非零值。原型：extern int stricmp(char *s1,char * s2);        用法：#in

#include #include #includeusing namespace std;int main(){ char str[20]; gets(str); puts(str); puts(str+4); printf("%s",str); // return 0; char ch; ch=getch

#include#includeusing namespace std;char str1[1000];char str2[1000];int a[1000];int b[1000];int i,j,k,len1,len2;bool sign;void mul(int *a, int *b){ int c[2000]={0},i,j,carry=0; for ( i =

改成 max=9223372036854775807LL; 这样就不会有警告了。这样这个数据在未赋值前就被认为是long long型的 (后面跟有LL）#includeusing namespace std;int main(){ unsigned long long i = 0; printf("long long type is %d bytes\n",si

OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17887 Accepted: 7194DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La

Time Limit: 1sec    Memory Limit:32MBDescriptionFight club is an organization where you release your pressure and emotion by fighting the other club members. The fight begins like this: n pe

#include #include #include #include using namespace std;int next[1000];void getnext(char *b,int lenb){ int k=-1,j=0; next[0]=-1; while(j<lenb-1) { if(b[k]==b[j]||k==-1) {

DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this probl

源代码如下所示：#includeusing namespace std;class BSTree{public: int data; BSTree *left; BSTree *right; BSTree(int data,BSTree *left = NULL ,BSTree * right= NULL) { this->data= data;

#ifndef _EXCELSIOR_CACHEMANAGE_H_#define _EXCELSIOR_CACHEMANAGE_H_#include using namespace std;#include "List.h"struct TCacheAllocStauts { UINT8** pType; UINT32 start; UINT32 size;

#include#includeusing namespace std;struct comp{ /* data */ typedef std::pair value_type; bool operator()(const value_type &ls,const value_type &rs) { return (ls.first<rs.first)||(ls.first==

#include#include#includeusing namespace std;const int Max=100;const int INF=5000;class Graph{public: /* data */ int VertexNum;//一个图的点数 int Edgeweight[Max][Max];//每条边的权值 bool type;//有向

#include#include#include#include using namespace std;int main(){ int n; cin>>n; vector v(n,8); for (int i = 0; i < 8; ++i) { /* code */ v.push_back(i); } copy(v.begi

#includeusing namespace std;int BFmatch(string a,string b){ //vectora; int aleng=a.length(); int bleng=b.length(); for(int i=0;i<=aleng-bleng;i++) { int j=0; while(a[i]==b[j]&&j<bleng)