为什么访问别人的空间，都没有我的记录，怎样才能有记录

为什么访问别人的空间，都没有我的记录，怎样才能有记录

评价，留言

朋友。您好。

 

是系统原因。最近有大部份用户出现了这种情况。如果系统经核实您的号码近期内有大量频繁的访问不同号码的空间，鉴于安全性考虑，系统暂不计此号的访问记录，请确保此号不要在短时间内频繁访问他人空间，一段时间后此qq号码访问他人空间产生记录的功能即可再次恢复正常。

 

希望我的回答能够帮到你。望采纳。谢谢。

先给个版本，你先看看： #include class position { friend bool inputmaze(); friend void outputpath(); friend bool findpath(); public: operator int() const {return row;} private: int row, col; }; template void make2darray(t ** &x, int rows, int cols) { x = new t * [rows]; for (int i = 0; i < rows; i++) x[i] = new t [cols]; } template class stack { // lifo objects public: stack(int maxstacksize = 10); ~stack() {delete [] stack;} bool isempty() const {return top == -1;} bool isfull() const {return top == maxtop;} t top() const; stack& add(const t& x); stack& delete(t& x); private: int top; // current top of stack int maxtop; // max value for top t *stack; // element array }; template stack::stack(int maxstacksize) {// stack constructor. maxtop = maxstacksize - 1; stack = new t[maxstacksize]; top = -1; } template t stack::top() const { return stack[top]; } template stack& stack::add(const t& x) { stack[++top] = x; return *this; } template stack& stack::delete(t& x) { x = stack[top--]; return *this; } // globals int **maze, m; stack *path; // pointer to stack void welcome() {}; bool inputmaze() {// input the maze. cout << "enter maze size" << endl; cin >> m; make2darray(maze, m+2, m+2); cout << "enter maze in row major order" << endl; for (int i=1; i<=m; i++) for (int j=1; j<=m; j++) cin >> maze[i][j]; return true; } bool findpath() {// find a path from (1,1) to the exit (m,m). // return true if successful, false if impossible. // throw nomem exception if inadequate space. path = new stack(m * m - 1); // initialize offsets position offset[4]; offset[0].row = 0; offset[0].col = 1; // right offset[1].row = 1; offset[1].col = 0; // down offset[2].row = 0; offset[2].col = -1; // left offset[3].row = -1; offset[3].col = 0; // up // initialize wall of obstacles around maze for (int i = 0; i <= m+1; i++) { maze[0][i] = maze[m+1][i] = 1; // bottom and top maze[i][0] = maze[i][m+1] = 1; // left and right } position here; here.row = 1; here.col = 1; maze[1][1] = 1; // prevent return to entrance int option = 0; // next move int lastoption = 3; // search for a path while (here.row != m || here.col != m) {// not exit // find a neighbor to move to int r, c; while (option <= lastoption) { r = here.row + offset[option].row; c = here.col + offset[option].col; if (maze[r][c] == 0) break; option++; // next option } // was a neighbor found? if (option <= lastoption) {// move to maze[r][c] path->add(here); here.row = r; here.col = c; // set to 1 to prevent revisit maze[r][c] = 1; option = 0; } else {// no neighbor to move to, back up if (path->isempty()) return false; position next; path->delete(next); if (next.row == here.row) option = 2 + next.col - here.col; else option = 3 + next.row - here.row; here = next; } } return true; // at exit } void outputpath() {// output path to exit. cout << "the path is" << endl; position here; while (!path->isempty()) { path->delete(here); cout << here.row << ' ' << here.col << endl;} } void main(void) { welcome(); inputmaze(); if (findpath()) outputpath(); else cout << "no path" << endl; }

很久以前做的，现在都忘记了。你看一下吧。我的报告，也可以发给你，不过还是期望你自己可以学会怎么做，少年智则国智。C＋＋和C一回事，你把其中的语法规则改一下就好，比如输入输出语句，将结构体改成类，也可不改，都支持的。 #include "stdio.h" #include "conio.h" #define max 10 #define maxlength (max*max) #define zdir 4 #include "graphics.h" #include "dos.h" #include "time.h" #define M 10 #define N 10 void printmap(void); int zfindpath(int row,int col,int erow,int ecol); void creategraphich(int n1,int n2,int n3,int n4); void creategraphich(int n1,int n2,int n3,int n4); int zmap[max][max]={ {1,1,1,1,1,1,1,1,1,1}, {1,0,0,1,0,0,0,1,0,1}, {1,0,0,1,0,0,0,1,0,1}, {1,0,0,0,0,1,1,0,0,1}, {1,0,1,1,1,0,0,0,0,1}, {1,0,0,0,1,0,0,0,0,1}, {1,0,1,0,0,0,1,0,0,1}, {1,0,1,1,1,0,1,1,0,1}, {1,1,0,0,0,0,0,0,0,1}, {1,1,1,1,1,1,1,1,1,1} }; struct { int row,col; }offsets[zdir]={{0,1 }, {1,0 }, {0,-1}, {-1,0} }; struct { int row; int col; } path[maxlength]; int len; int zfindpath(int row,int col,int erow,int ecol) { int dir,row2,col2; sleep(1); setcolor(10); setfillstyle(1, 14); circle(150+(col)*22+10,100+(row)*22+10, 8); floodfill(150+(col)*22+10+4, 100+(row)*22+10+4, 10); if((row==erow)&&(col==ecol)) { path[0].row=erow; path[0].col=ecol; return 1; } zmap[row][col]=2; for(dir=0;dir0) { path[len].row=row2; path[len].col=col2; return ++len; } } } sleep(1); setfillstyle(1, 15); bar( 150+col*22,100+row*22,170+col*22,120+row*22); return 0; } void printmap() { int i,j; for(i=0;i0;i--) { trow=path[i-1].row-path[i].row; tcol=path[i-1].col-path[i].col; sleep(1); x=x+tcol*22; y=y+trow*22; putimage(x,y, buf, COPY_PUT); } setcolor(1); settextstyle(4, 0, 3); outtextxy(357,287,"sussessfully!!!"); getch(); closegraph(); free((void *)buf); } void changemap(int d) { FILE *fw; int i,j; if(d==1) { fw=fopen("c:\\tc\\a.txt","r"); if(!fw) {printf("not found!"); getch();return;} for(i=0;i0;i--) { printf("(%d,%d)\n",path[i].row,path[i].col); } getch(); printf("now,we will create the final graphics of the map:\n"); getch(); creategraphich(n5,n6,n3,n4); } }