查询SQLServer正在执行的语句

查询，统计股票主要财务数据,查询Oracle正在执行的SQL语句,查询python模块的帮助文档,查询SQLServer正在执行的语句

查找/etc/passwd下bash为/bin/bash用户的数,查找两个有序数组中的中位数,查找数组中最大值最小值的另一种思路

[代码] [C/C++]代码

#include

class A {

public:

A( ):count(1) {}

virtual ~A( ) {}

virtual A* Copy( ) const = 0;

virtual void Out( ) const = 0;

protected:

int count;

};

class B:public A {

public:

~B( ) { --count; Out( ); }

virtual A* Copy( ) const {

B *p = new B(*this);

++p->count;

return p;

}

//C#起名函数（类似页游的用户名生成）

//C#求所有可能的排列组合

virtual void Out( ) const

{ cout << count << endl; }

};

void main( )

{

B b;

A* a1=&b;

a1->Out( );

a1 = a1->Copy( );

a1->Out( );

delete a1;

}

//c#删除指定文件夹下的文件方法封装

//C#设置开机启动程序

[代码] [C/C++]代码

#include

using namespace std;

int main() {

int b = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

int r,c,i,j;

int d;

while (cin>>r>>c)

{

int **a = new int*[r];

for (i=0; i

a[i] = new int[c];

}

for (i=0; i

for (j=0; j

cin>>a[i][j];

}

int dir =0;

int tempi, tempj;

d[0] = 0;//up

d[1] =c; //right

d = r;//down

d =0;//left

i=0;

j=0;

cout<

while (1) {

tempi = i+b[dir][0];

tempj = j+b[dir][1];

if (tempi>=d[0]&&tempi=d&&tempj

j = tempj;

cout<

}

else{

if (dir%3 == 0){

d[dir]++;

if (d[dir] == d[(dir+2)%4]) break;

}

else{

d[dir]--;

if (d[dir] == d[(dir+2)%4]) break;

}

dir = (dir+1)%4;

}

}

for (i=0; i

delete []a[i];

a[i] = NULL;

}

delete []a;

a = NULL;

}

return 0;

}

[代码] 普通递归算法

#include

using namespace std;

int partition(int *a, int l, int h){

int x = a[l];

int i = l;

int j = h+1;

int temp;

while (i

while (a[++i]

while(a[--j]>x);

if (i

temp = a[i];

a[i] = a[j];

a[j] = temp;

}

}

a[l] = a[j];

a[j] = x;

return j;

}

void qsort(int *a, int l, int h){

if (l>=h)

return;

int q = partition(a, l, h);

qsort(a, l, q-1);

qsort(a, q+1, h);

}

int main(){

int a = {9,8,7,6,5,4,3,2,1};

qsort(a,0,8);

for (int i=0; i<9; i++)

cout<

return 0;

}

.[代码] 非递归算法

//数据规模很大时，递归的算法很容易导致栈溢出，改为非递归，模拟栈操作，最大长度为n，每次压栈时先压长度较大的，此时栈深度为logn。

#include

using namespace std;

int partition(int *a, int l, int h){

int x = a[l];

int i = l;

int j = h+1;

int temp;

while (i

while (a[++i]

while(a[--j]>x);

if (i

temp = a[i];

a[i] = a[j];

a[j] = temp;

}

}

a[l] = a[j];

a[j] = x;

return j;

}

void qsort(int *a, int l, int h){ if (l>=h)

return;

int *s = new int[h-l+1];

int p = 0;

s[p++] = l;

s[p++] = h;

int low,high,q;

while (p>0){

high = s[--p];

low = s[--p];

if (low>=high)

break;

q = partition(a, low, high);

if (q-low > high-q){

s[p++] = low;

s[p++] = q-1;

if (high > q){

s[p++] = q+1;

s[p++] = high;

}

}else {

s[p++] = q+1;

s[p++] = high;

if (q > low){

s[p++] = low;

s[p++] = q-1;

}

}

}

delete []s;

}

int main(){

int a = {9,8,7,6,5,4,3,2,1};

//int a = {1,2,3,4,5,6,7,8,9}; qsort(a,0,8);

for (int i=0; i<9; i++)

cout<

}

[代码] [C/C++]代码

#include

#include

#include

int num[100];

char op[100];

int numcou = 0;

int opcou = 0;

void pushnum(int n)

{

num[numcou++] = n;

}

void pushop(char c)

{

op[opcou++] = c;

}

int numpop()

{

return num[--numcou];

}

char oppop()

{

return op[--opcou];

}

char opc = {'+', '-', '*', '/', '(', ')', '#'}; int p = {

{1,1,-1,-1,-1,1,1},

{1,1,-1,-1,-1,1,1},

{1,1,1,1,-1,1,1},

{1,1,1,1,-1,1,1},

{-1,-1,-1,-1,-1,0,-2},

{1,1,1,1,-2,1,1},

{-1,-1,-1,-1,-1,-2,0}

};

int pri(char s, char e)

{

int i, j, k;

for (i=0; i<7; i++)

{

if (s == opc[i])

if (e == opc[i])

{

k = i;

}

}

return p[j][k];

}

int result(int first, int second, char c) {

switch(c)

{

case '+':

return first + second;

break;

case '-':

return first - second;

break;

case '*':

return first * second;

break;

case '/':

return first / second;

break;

}

}

int calc(char *exp)

{

char c;

int first;

int second;

numcou = 0;

opcou = 0;

pushop('#');

while (*exp!='#' || op[opcou-1]!='#') {

if (isdigit(*exp))

{

pushnum(*exp-'0');

exp++;

continue;

}

else if (isalpha(*exp))

{

pushnum(*exp-'a'+10);

exp++;

continue;

}

else if (*exp=='+' || *exp=='-' || *exp=='*' || *exp=='#' || *exp=='(' || *exp==')')

{

switch(pri(op[opcou-1], *exp))

{

case 1:

c = oppop();

second = numpop();

first = numpop();

pushnum(result(first, second, c));

break;

case 0:

oppop();

exp++;

break;

case -1:

pushop(*exp);

exp++;

break;

default:

break;

}

}

else

exp++;

}

return num[numcou-1];

}

int main()

{

int n, len;

char fir[100], sec[100];

while (scanf("%d", &n)!=EOF)

{

getchar();

while (n--)

{

gets(fir);

len = strlen(fir);

fir[len] = '#';

gets(sec);

len = strlen(sec);

sec[len] = '#';

if (calc(fir) == calc(sec))

printf("YES\n");

else

printf("NO\n");

}

}

return 0;

}

[代码] [C/C++]代码

#include

#include

using namespace std;

int main()

{

int k, e, i, j, res = 1;

string strK[21], strE[21],strk[21], stre[21]; int num[21];

int maxlen = 0;

unsigned int loc = 0;

unsigned int loc1 = string::npos;

while (cin>>k>>e)

{

if(k<=0 || e<=0)

break;

for (i=0; i<21; i++)

num[i] = 0;

for (i=0; i

{

cin>>strK[i];

strk[i].assign(strK[i]);

for (j=0; j

if (strK[i][j]>='A' && strK[i][j]<='Z') strK[i][j]+=32;

}

getchar();

for (i=0; i

{

getline(cin, strE[i]);

stre[i].assign(strE[i]);

for (j=0; j

if (strE[i][j]>='A' && strE[i][j]<='Z')

strE[i][j]+=32;

}

maxlen = 0;

for (i=0; i< e; i++)

{

for (j=0; j

{

loc = 0;

while ((loc1=strE[i].find( strK[j],loc))!=string::npos) {

int b = loc1;

int en = loc1 + strK[j].size();

int len = strE[i].size();

if (b==0 || (b>0&& (strE[i][b-1]<'a'||strE[i][en]>'z'))) {

if (en'z'))

num[i]++;

else if(en == len)

num[i]++;

}

loc = loc1 + 1;

}

}

if (num[i] > maxlen)

maxlen = num[i];

}

cout<<"Excuse Set #"<

for (i=0; i

{

if (num[i] == maxlen)

cout<

}

cout<

}

return 0;

}

[代码] [C/C++]代码

#include

#include

using namespace std;

struct Point{

int x,y;

};

int R,C,cnt;

Point pos[5010];

bool map[5010][5010];

int cmp(Point A,Point B)

{

if(A.x==B.x)

return A.y

else

return A.x

}

void Solve()

{

int i,j,CC,ans=0;

bool f = true;

int disx,disy,tmpx,tmpy,testx,testy;

sort(pos+1,pos+cnt+1,cmp);

for(i=cnt;i>ans;i--) //从后向前，减少遍历次数

{

for(j=i-1;j>=ans;j--)

{

disx=pos[i].x-pos[j].x;

disy=pos[i].y-pos[j].y;

tmpx=pos[j].x;

tmpy=pos[j].y;

CC=2;

testx = pos[i].x+disx;

testy = pos[i].y+disy;

if((testx>=1&&testx<=R&&testy>=1&&testy<=C))

continue;

testx=pos[i].x-ans*disx;

testy=pos[i].y-ans*disy;https://www.360docs.net/doc/6214797415.html,

if (testx<1||testx>R||testy<1||testy>C||map[testx][testy]==0)//3.之前已经被遍历过

continue;

f = true;

while(tmpx-disx>=1 && tmpx-disx<=R && tmpy-disy>=1 && tmpy-disy<=C)//2.无法产生比ans更好地解

{

if(map[tmpx-disx][tmpy-disy]) {

tmpx=tmpx-disx;

tmpy=tmpy-disy;

CC++;

}

else

{

f = false;//跳不出田，不是有效解

break;

}

}

if(CC>ans&&f)

ans=CC;

}

}

if(ans<3)

cout<<'0'<

else

cout<

}

int main()

{

int i;

cin>>R>>C;

cin>>cnt;

memset(map,0,sizeof(map));

for(i=1;i<=cnt;i++)

{

cin>>pos[i].x>>pos[i].y;

map[pos[i].x][pos[i].y]=1;

}

Solve();

return 0;

}

[代码] [C/C++]代码

#include

#include

struct pos

{

int len;

int used;

int r;

int u;

}p[20][20];

int num, wallNum, w, h, Dx, Dy, minPath;

void DFS(int x, int y, int len, int flag)

{

if (len >= p[x][y].len[flag] && p[x][y].len[flag]!=0)

return;

if (x+y!=0 && (x!=Dx||y!=Dy))

p[x][y].len[flag] = len;

len++;

if (p[x][y].r==0 && x+1

DFS(x+1, y, len, flag);

if (p[x][y].u==0 && y+1

DFS(x, y+1, len, flag);

if (x-1>=0 && p[x-1][y].r==0)

DFS(x-1, y, len, flag);

if (y-1>=0 && p[x][y-1].u==0)

DFS(x, y-1, len, flag);

}

int judge()

{

int i, j;

for (i=0; i

for (j=0; j

{https://www.360docs.net/doc/6214797415.html, 秦皇岛同城购俷俸俹

if (p[i][j].used==0 && p[i][j].len[0]+p[i][j].len[1]<=minPath)

return 0;

if (p[i][j].r==1 && i+1minPath && p[i][j].len[1]+p[i+1][j].len[0]+1>minPath)

return 0;

if (p[i][j].u==1 && j+1minPath && p[i][j].len[1]+p[i][j+1].len[0]+1>minPath)

return 0;

}

return 1;

}

int main()

{

int x, y, x1, y1, x2, y2;

char c;

scanf("%d", &num);

while (num--)

{

memset(p, 0, sizeof(p));

scanf("%d %d\n", &w, &h);

p[0][0].used = 1;

Dx = Dy = minPath = 0;

while ((c=getchar())!='\n' && c!=EOF)

{

if (c == 'U')

p[Dx][++Dy].used = 1;

else if (c == 'D')

p[Dx][--Dy].used = 1;

else if (c == 'L')

p[--Dx][Dy].used = 1;

else if (c == 'R')

p[++Dx][Dy].used = 1;

minPath++;

}

scanf("%d", &wallNum);

while (wallNum--)

{

scanf("%d %d %d %d", &x1, &y1, &x2, &y2); x = x1 - x2;

y = y1 - y2;

if (x==0 && y==1)

p[x2][y2].u = 1;

else if (x==0 && y==-1)

p[x1][y1].u = 1;

else if (x==1 && y==0)

p[x2][y2].r = 1;

else if (x==-1 && y==0)

p[x1][y1].r = 1;

}

DFS(0, 0, 0, 0);

DFS(Dx, Dy, 0, 1);

if(judge())

printf("CORRECT\n");

else

printf("INCORRECT\n");

}

return 0;

}

[代码] [C/C++]代码

#include

int n, k, m, h, t;

int dest, f[1001];

char res[1001];

struct Node

{

int n,m,pre;

char ch;

}que[10000],tmp;

int bfs()

{

que[0].n = (n + 1000 * k) % k; que[0].m = (n + 1000 * m) % m; que[0].ch = 0;

que[0].pre = 0;

for (h=0,t=1; h

{

if (dest==que[h].n && h)

return 1;

tmp = que[h];

tn = (tn + m +1000 * k) % k; if (!f[tn])

{

f[tn] = 1;

tch = '+';

tpre = h;

que[t++] = tmp;

}

tmp = que[h];

tn = (tn - m + 1000 * k) % k; if (!f[tn])

{

f[tn] = 1;

tch = '-';

tpre = h;

que[t++] = tmp;

}

tmp = que[h];

tn = (tn * m + 1000 * k) % k; if (!f[tn])

{

f[tn] = 1;

tch = '*';

tm = (tm * m) % m;

tpre = h;

que[t++] = tmp;

}

tmp = que[h];

tn = (tm + 1000 * k) % k;

if (!f[tn])

{

f[tn] = 1;

tch = '%';

tpre = h;

que[t++] = tmp;

}

}

return 0;

}

int main()

{

int i, len;

while (scanf("%d %d %d", &n, &k, &m)!=EOF) {

if (n==0 && k==0 && m==0)

return 0;

dest = (n + 1 + 1000 * k) % k;

for (i=0; i<1001; i++)

f[i] = 0;

if (bfs())

{

len = 0;

while (h)

{

res[len++] = que[h].ch;

h = que[h].pre;

}

printf("%d\n", len);

for (i=len-1; i>=0; i--)

{

printf("%c", res[i]);

}

printf("\n");

}

else

printf("0\n");

}

return 0;

}

[代码] [C/C++]代码

#include

int dir = {{-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}}; int N, M;

char str[102][102];

void dfs(int x, int y)

{

int i;

if (x<0||y<0||x>=N||y>=M||str[x][y]=='.')

return;

else

{

str[x][y] = '.';

for (i=0; i<8; i++)

dfs(x+dir[i][0], y+dir[i][1]);

}

}

int main()

{

int i, j, res;

while (scanf("%d %d", &N, &M) != EOF)

{

res = 0;

for (i=0; i

scanf("%s", str[i]);

for (i=0; i

for (j=0; j

if (str[i][j] == 'W')

{

res++;

dfs(i, j);

}

printf("%d\n", res);

}

return 0;

}

[代码] [C/C++]代码

#include

#include

#include

int a, c, m, r0;

int main()

{

int *f, r1, i, max, beg, end, temp;

while (scanf("%d %d %d %d", &a, &c, &m, &r0) != EOF)

{

f = (int *)malloc(m * sizeof(int));

// memset(f, 0, sizeof(m * sizeof(int)));

for (i=0; i

f[i] = 0;

f[r0] = 1;

while (1)

{

r1 = (a * r0 + c) % m;

if (f[r1] == 0)

{

f[r1] = 1;

r0 = r1;

}

else

break;

}

max = 0;

i=0;

beg = end = -1;

while (i < m)//计算max的过程，注意不是相邻两次计算获得的值的差 {

if (f[i] == 0)

{

i++;

continue;

}

else if (beg == -1)

{

beg = i;

i++;

continue;

}

else

{

end = i;

temp = end-beg;

if (temp > max)

max = temp;

beg = end;

i++;

}

}

printf("%d\n", max);

free(f);

}

return 0;

}

[代码] [C/C++]代码

#include

int num, flag[1000000];

int main()

{

int temp, count, i;

while (scanf("%d", &num) != EOF)

{

for (i=0; i<1000000; i++)

flag[i] = -1;

count = 0;

for (i=9999; i>=0; i--)

{

temp = (num / 10)% 10000;

num = (temp*temp) % 1000000;

if (flag[num] == -1)

{

flag[num] = count;

count++;

}

else

{

printf("%d %d %d\n", num, count-flag[num], count+1); break;

}

}

}

return 0;

}