苏格拉没有底

#include<iostream>#include<cstdio>using namespace std;#define M 4 //行数#define N 4 //列数#define MaxSize 100 //栈最多元素个数int mg[M+2][N+2]= { {1,1,1,1,1,1} ,{1,0,0,0,1...

题目：给一个由数字组成的字符串。求出其可能恢复为的所有IP地址。如：给出字符串 "25525511135"，所有可能的IP地址有两种： "255.255.11.135","255.255.111.35"（顺序无关紧要）代码：#include <iostream>#include <vector>#include <fstream>..

#include<iostream>#include<cstdio>#define MAXV 20 //最多顶点数#define INF 32767 //INF表示∞using namespace std;int sum=0;//typedef struct//{// int num; //顶点编号//} VertexType...

#include<iostream>#include<cstdio>#include <algorithm>#define MaxSize 100#define INF 32767 //INF表示∞#define MAXV 100 //最大顶点个数using namespace std;typedef int InfoType;int sum=...

#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<cstdlib>using namespace std;typedef struct{ char letter, *code; int weigh...