摘要：
Pages The chunk of a process, known as pages. Frames Could be assigned to available chunks of memory, known as frames. 阅读全文
摘要：
Definition transport-layer multiplexing and demultiplexing The job of delivering the data in a transport-layer segment to the correct socket is called 阅读全文
摘要：
socat 公网ipv6 实现 FiveM 联机 不花一分钱 研究了三天终于研究明白了，首先大家需要测试家里的宽带是否有IPv6 本教程基于Linux实现，因为socat 目前a56爆大奖在线娱乐没找到好用的Windows版本 进入[https://www.test-ipv6.com/index.html.zh_CN 阅读全文
摘要：
#include<iostream> #include<malloc.h> #include<queue> using namespace std; #define MAX 10 typedef int E; typedef struct Node{ int nextVex; struct Node 阅读全文
摘要：
#include<iostream> #include<malloc.h> #include<string.h> using namespace std; #define MAX 10 #define INF 0; typedef int E; typedef struct GraphMartix{ 阅读全文
摘要：
#include <iostream> #include<malloc.h> using namespace std; typedef int E; typedef struct Node{ E element; struct Node *next; }*node; void initList(no 阅读全文
摘要：
#include<iostream> #define MAX 10 #include<malloc.h> #include<string.h> #include<stdlib.h> using namespace std; typedef char E; typedef struct Edge{ E 阅读全文
摘要：
#include<iostream> #include<malloc.h> #include<string.h> using namespace std; #define MAX 10 #define INF 0; typedef char E; typedef struct GraphMartix 阅读全文
摘要：
#include<iostream> #include<malloc.h> #include<queue> #define MAXV 10 using namespace std; typedef char E; typedef queue<int>* Queue; typedef struct N 阅读全文
摘要：
#include <cstdio> using namespace std; int main(){ int i,n,m,s,b,c,d,h; while(scanf("%d%d",&n,&m) !=EOF){ if(m==0&&n==0){ return 0; }else if(-39<=n&&n 阅读全文