5-1

  1. #include <iostream>
  2. #include <cstdlib>
  3. using namespace std;
  5. template <class T> T maxn(T x[], int len)
  6. {
  7. 	int i;
  8. 	T store = x[0];
  10. 	int k = 0;
  11. 	for (i = 0; i < len; i++)
  12. 	{
  13. 		if(x[i] > x[k]) k = i;
  14. 	}
  16. 	store = x[k];
  18. 	return store;
  19. }
  21. class time0
  22. {
  23. 	private:
  24. 		int hh,mm,ss;
  25. 	public:
  26. 		time0(int a = 0, int b = 0, int c = 0):hh(a),mm(b),ss(c){};
  27. 		bool operator > (time0 &t);
  28. 		void display();
  29. };
  31. void time0::display()
  32. {
  33. 	cout << hh << " " << mm << " " << ss << endl;
  34. }
  36. bool time0::operator > (time0 &t)
  37. {
  38. 	int pre = 0, beh = 0;
  39. 	pre = hh * 3600 + mm * 60 + ss;
  40. 	beh = t.hh * 3600 + t.mm * 60 + ss;
  41. 	if(pre > beh)return true;
  42. 	else return false;
  43. }
  45. class date
  46. {
  47. 	private:
  48. 		int year,mouth,day;
  49. 	public:
  50. 		date(int a = 0, int b = 0, int c = 0):year(a),mouth(b),day(c){};
  51. 		bool operator > (date &d);
  52. 		void display();
  53. };
  55. void date::display()
  56. {
  57. 	cout << year << " " << mouth << " " << day << endl;
  58. }
  60. bool date::operator > (date &d)
  61. {
  62. 	int pre = 0, beh = 0;
  63. 	pre = year * 365 + mouth * 30 + day;
  64. 	beh = d.year * 365 + d.mouth * 30 + day;
  65. 	if(pre > beh)return true;
  66. 	else return false;
  67. }
  69. int intArray[100];
  71. double douArray[100];
  73. time0 timeArray[100];
  75. date dateArray[100];
  77. int main()
  78. {
  79. 	int ope;
  80. 	int i,j;
  81. 	while(cin >> ope)
  82. 	{
  83. 		if(ope == -1)break;
  85. 		if(ope == 1)
  86. 		{
  87. 			int tot = 0;
  88. 			while(1)
  89. 			{
  90. 				int w;
  91. 				cin >> w;
  92. 				if(w == 0)break;
  94. 				intArray[tot++] = w;
  95. 			}
  97. 			double result = 0;
  98. 			result = maxn<int> (intArray,tot);
  100. 			cout << result << endl;
  101. 		}
  102. 		else if(ope == 2)
  103. 		{
  104. 			int tot = 0;
  105. 			while(1)
  106. 			{
  107. 				double w;
  108. 				cin >> w;
  109. 				if(w == 0)break;
  111. 				douArray[tot++] = w;
  112. 			}
  114. 			double result = 0;
  115. 			result = maxn<double> (douArray,tot);
  117. 			cout << result << endl;
  118. 		}
  119. 		else if(ope == 3)
  120. 		{
  121. 			int hh1,mm1,ss1;
  122. 			int tot = 0;
  123. 			while(1)
  124. 			{
  125. 				cin >> hh1;
  126. 				if(hh1 == 0)break;
  128. 				cin >> mm1 >> ss1;
  130. 				time0 t(hh1,mm1,ss1);
  131. 				timeArray[tot++] = t;
  132. 			}
  134. 		    time0 result;
  135. 		    result = maxn<time0> (timeArray, tot);
  137. 		    result.display();
  138. 		}
  139. 		else if(ope == 4)
  140. 		{
  141. 			int hh1,mm1,ss1;
  142. 			int tot = 0;
  143. 			while(1)
  144. 			{
  145. 				cin >> hh1;
  146. 				if(hh1 == 0)break;
  148. 				cin >> mm1 >> ss1;
  150. 				date t(hh1,mm1,ss1);
  151. 				dateArray[tot++] = t;
  152. 			}
  154. 		    date result;
  155. 		    result = maxn<date> (dateArray, tot);
  157. 		    result.display();
  158. 		}
  159. 	}
  160. 	return 0;
  161. }

5-2

  1. #include <iostream>
  2. #include <cstdlib>
  3. #include <string>
  4. using namespace std;
  6. template <class T> int addSet(T * myset, T elem,int len)
  7. {
  8. 	if(len > 100)
  9. 	{
  10. 		cout << "Full Set." << endl;
  11. 		return len;
  12. 	}
  14. 	int i, j;
  15. 	for(i = 0; i < len; i++)
  16. 	{
  17. 		if(*(myset + i) == elem)
  18. 		{
  19. 			cout << elem << " is already exist!" << endl;
  20. 			return len;
  21. 		}
  22. 	}
  24. 	*(myset + len) = elem;
  26. 	cout << len-1 << endl;
  28. 	len ++;
  30. 	return len;
  31. }
  33. template <class T> int deleSet(T * myset, T elem, int len)
  34. {
  35. 	int i, j;
  37. 	bool flag = false;
  38. 	int beg = 1;
  39. 	for(i = 0; i < len; i++)
  40. 	{
  41. 		if(*(myset + i) == elem)
  42. 		{
  43. 			flag = true;
  44. 			beg = i;
  45. 			break;
  46. 		}
  47. 	}
  49. 	if(!flag)
  50. 	{
  51. 		cout << elem << " is not exist!" << endl;
  52. 		return len;
  53. 	}
  55. 	cout << beg-1 << endl;
  57. 	for(i = beg, j = beg + 1; j < len; i++, j++)
  58. 	{
  59. 		*(myset + i) = *(myset + j);
  60. 	}
  62. 	len --;
  64. 	return len;
  65. }
  67. template <class T> int findElem(T * myset, T elem, int len)
  68. {
  69. 	int i, j;
  71. 	for(i = 0; i < len; i++)
  72. 	{
  73. 		if(*(myset + i) == elem)
  74. 		{
  75. 			return i;
  76. 		}
  77. 	}
  79. 	return -1;
  80. }
  82. int intSet[100];
  84. double douSet[100];
  86. string StrSet[100];
  88. int main()
  89. {
  90.     int intLen = 1, douLen = 1, strLen = 1;
  92. 	int i;
  94. 	int ope;
  96. 	while(cin >> ope)
  97. 	{
  98. 		if(ope == 0)break;
  100. 		if(ope == 1)
  101. 		{
  102. 			int nope, inum;
  103. 			cin >> nope >> inum;
  105. 			if(nope == 1)
  106. 			{
  107. 				intLen = addSet<int> (intSet, inum, intLen);
  108. 			}
  109. 			else if(nope == 2)
  110. 			{
  111. 				intLen = deleSet<int> (intSet, inum, intLen);
  112. 			}
  113. 			else if(nope == 3)
  114. 			{
  115. 				int judge = findElem<int> (intSet, inum, intLen);
  116. 				if(judge == -1)
  117. 				{
  118. 	                cout << inum << " is not exist!" << endl;
  119. 				}
  120. 				else
  121. 				{
  122. 					cout << judge-1 << endl;
  123. 				}
  124. 			}
  125. 		}
  126. 		else if(ope == 2)
  127. 		{
  128. 			int nope;
  129. 			double inum;
  130. 			cin >> nope >> inum;
  132. 			if(nope == 1)
  133. 			{
  134. 				douLen = addSet<double> (douSet, inum, douLen);
  135. 			}
  136. 			else if(nope == 2)
  137. 			{
  138. 				douLen = deleSet<double> (douSet, inum, douLen);
  139. 			}
  140. 			else if(nope == 3)
  141. 			{
  142. 				int judge = findElem<double> (douSet, inum, douLen);
  143. 				if(judge == -1)
  144. 				{
  145. 	                cout << inum << " is not exist!" << endl;
  146. 				}
  147. 				else
  148. 				{
  149. 					cout << judge-1 << endl;
  150. 				}
  151. 			}
  152. 		}
  153. 		else if(ope == 3)
  154. 		{
  155. 			int nope;
  156. 			string inum;
  157. 			cin >> nope >> inum;
  159. 			if(nope == 1)
  160. 			{
  161. 				strLen = addSet<string> (StrSet, inum, strLen);
  162. 			}
  163. 			else if(nope == 2)
  164. 			{
  165. 				strLen = deleSet<string> (StrSet, inum, strLen);
  166. 			}
  167. 			else if(nope == 3)
  168. 			{
  169. 				int judge = findElem<string> (StrSet, inum, strLen);
  170. 				if(judge == -1)
  171. 				{
  172. 	                cout << inum << " is not exist!" << endl;
  173. 				}
  174. 				else
  175. 				{
  176. 					cout << judge-1 << endl;
  177. 				}
  178. 			}
  179. 		}
  180. 	}
  181. 	return 0;
  182. }

5-3

(听说用5-2的代码也能过噢

  1. #include <iostream>
  2. #include <stdlib.h>
  3. using namespace std;
  5. template <class T> class MySet
  6. {
  7. private:
  8.     T data[100];
  9.     int count;
  11. public:
  12. 	MySet()
  13. 	{
  14. 		count = 0;
  15. 	};
  17.     int addSet(T elem)
  18.     {
  19. 	    if(count > 100)
  20. 	    {
  21. 		    cout << "Full Set." << endl;
  22. 		    return count;
  23. 	    }
  25. 	    int i, j;
  26. 	    for(i = 0; i < count; i++)
  27. 	    {
  28. 		    if(data[i] == elem)
  29. 		    {
  30. 			    cout << elem << " is already exist!" << endl;
  31. 			    return count;
  32. 		    }
  33. 	    }
  35. 	    data[count] = elem;
  37. 	    cout << count << endl;
  39. 	    count ++;
  41. 	    return count;
  42.     };
  44.     int deleSet(T elem)
  45.     {
  46. 	    int i, j;
  48. 	    bool flag = false;
  49. 	    int beg = 1;
  50. 	    for(i = 0; i < count; i++)
  51. 	    {
  52. 		    if(data[i] == elem)
  53. 		    {
  54. 			    flag = true;
  55. 			    beg = i;
  56. 			    break;
  57. 		    }
  58.  	    }
  60. 	    if(!flag)
  61. 	    {
  62. 		    cout << elem << " is not exist!" << endl;
  63. 		    return count;
  64. 	    }
  66. 	    cout << beg << endl;
  68. 	    for(i = beg, j = beg + 1; j < count; i++, j++)
  69. 	    {
  70. 		    data[i] = data[j];
  71. 	    }
  73. 	    count --;
  75. 	    return count;
  76.     };
  78.     int findElem(T elem)
  79.     {
  80. 	    int i, j;
  82. 	    for(i = 0; i < count; i++)
  83. 	    {
  84. 		    if(data[i] == elem)
  85. 		    {
  86. 			    return i;
  87. 		    }
  88. 	    }
  90. 	    return -1;
  91.     };
  93. };
  95. //int MySet::addSet(T elem)
  97. //int MySet::deleSet(T elem)
  99. //int MySet::findElem(T elem)
  101. int main()
  102. {
  103. 	MySet<int> intSet;
  104.     MySet<double> douSet;
  105.     MySet<string> strSet;
  107.     int intLen = 1, douLen = 1, strLen = 1;
  109. 	int i;
  111. 	int ope;
  113. 	while(cin >> ope)
  114. 	{
  115. 		if(ope == 0)break;
  117. 		if(ope == 1)
  118. 		{
  119. 			int nope, inum;
  120. 			cin >> nope >> inum;
  122. 			if(nope == 1)
  123. 			{
  124. 				intLen = intSet.addSet(inum);
  125. 			}
  126. 			else if(nope == 2)
  127. 			{
  128. 				intLen = intSet.deleSet(inum);
  129. 			}
  130. 			else if(nope == 3)
  131. 			{
  132. 				int judge = intSet.findElem(inum);
  133. 				if(judge == -1)
  134. 				{
  135. 	                cout << inum << " is not exist!" << endl;
  136. 				}
  137. 				else
  138. 				{
  139. 					cout << judge << endl;
  140. 				}
  141. 			}
  142. 		}
  143. 		else if(ope == 2)
  144. 		{
  145. 			int nope;
  146. 			double inum;
  147. 			cin >> nope >> inum;
  149. 			if(nope == 1)
  150. 			{
  151. 				douLen = douSet.addSet(inum);
  152. 			}
  153. 			else if(nope == 2)
  154. 			{
  155. 				douLen = douSet.deleSet(inum);
  156. 			}
  157. 			else if(nope == 3)
  158. 			{
  159. 				int judge = douSet.findElem(inum);
  160. 				if(judge == -1)
  161. 				{
  162. 	                cout << inum << " is not exist!" << endl;
  163. 				}
  164. 				else
  165. 				{
  166. 					cout << judge << endl;
  167. 				}
  168. 			}
  169. 		}
  170. 		else if(ope == 3)
  171. 		{
  172. 			int nope;
  173. 			string inum;
  174. 			cin >> nope >> inum;
  176. 			if(nope == 1)
  177. 			{
  178. 				strLen = strSet.addSet(inum);
  179. 			}
  180. 			else if(nope == 2)
  181. 			{
  182. 				strLen = strSet.deleSet(inum);
  183. 			}
  184. 			else if(nope == 3)
  185. 			{
  186. 				int judge = strSet.findElem(inum);
  187. 				if(judge == -1)
  188. 				{
  189. 	                cout << inum << " is not exist!" << endl;
  190. 				}
  191. 				else
  192. 				{
  193. 					cout << judge << endl;
  194. 				}
  195. 			}
  196. 		}
  197. 	}
  198. 	return 0;
  199. }

5-4

注意：(备注说明：分数为0时，表示成0z1m，如果结果为负数，那么分子取负数，分母为正数)

  1. #include <iostream>
  2. #include <cstdlib>
  3. #include <sstream>
  4. #include <cmath>
  5. using namespace std;
  7. int small(int a, int b)
  8. {
  9. 	if(a == 0 || b == 0)return 0;
  11. 	int t;
  12. 	if(a < b)
  13. 	{
  14. 		t = a; a = b; b = t;
  15. 	}
  16. 	int c = a % b;
  17. 	while(c != 0)
  18. 	{
  19. 		a = b;
  20. 		b = c;
  21. 		c = a % b;
  22. 	}
  24. 	return b;
  25. }
  27. class FS
  28. {
  29. 	private:
  30. 		int fz,fm;
  31. 	public:
  32. 		FS(int a = 0, int b = 0):fz(a),fm(b){};
  33. 		FS operator + (const FS &f);
  34. 		void display();
  35. };
  37. void FS::display()
  38. {
  39. 	bool flag = false;
  41. 	if(fz * fm == 0)
  42. 	{
  43. 		cout << "0z1m" << endl;
  44. 		return ;
  45. 	}
  47. 	if(fz * fm < 0)
  48. 	{
  49. 	    flag = true;
  50. 	}
  51. 	if(fz < 0)fz = -fz;
  52. 	if(fm < 0)fm = -fm;
  54. 	if(flag)cout << "-";
  56. 	cout << fz << "z" << fm << "m" << endl;
  57. }
  59. FS FS::operator + (const FS &f)
  60. {
  61. 	bool flag1 = false, flag2 = false; // false - true +
  63. 	if(fz*fm < 0)flag1 = true;
  64. 	if(f.fz*f.fm < 0)flag2 = true;
  66. 	int newfz = 0,newfm = 0;
  67. 	if(!flag1 && !flag2)
  68. 	{
  69. 		int common = 0;
  70. 		if(fz == 0 || f.fz == 0)
  71. 		{
  72. 			if(fz == 0)
  73. 			{
  74. 				newfz = f.fz;
  75. 				newfm = f.fm;
  76. 			}
  77. 			else if(f.fz == 0)
  78. 			{
  79. 				newfz = fz;
  80. 				newfm = fm;
  81. 			}
  82. 		}
  83. 		else
  84. 		{
  85. 			newfz = fz * f.fm + fm * f.fz;
  86. 		    newfm = fm * f.fm;
  87. 		}
  89. 		if(newfz != 0)
  90. 		{
  91. 			common = small(newfz,newfm);
  92. 			newfz /= common;
  93. 			newfm /= common;
  94. 		}
  95.  	}
  96.  	else if(!flag1 && flag2)
  97.  	{
  98.  		int common = 0;
  99. 		if(fz == 0 || f.fz == 0)
  100. 		{
  101. 			if(fz == 0)
  102. 			{
  103. 				newfz = f.fz;
  104. 				newfm = f.fm;
  105. 			}
  106. 			else if(f.fz == 0)
  107. 			{
  108. 				newfz = fz;
  109. 				newfm = fm;
  110. 			}
  111. 		}
  112. 		else
  113. 		{
  114. 			newfz = fz * f.fm + fm * f.fz;
  115. 		    newfm = fm * f.fm;
  116. 		}
  118. 		if(newfz != 0)
  119. 		{
  120. 			common = small(newfz,newfm);
  121. 			newfz /= common;
  122. 			newfm /= common;
  123. 		}
  124. 	}
  125. 	else if(flag1 && !flag2)
  126.  	{
  127.  		int common = 0;
  128. 		if(fz == 0 || f.fz == 0)
  129. 		{
  130. 			if(fz == 0)
  131. 			{
  132. 				newfz = f.fz;
  133. 				newfm = f.fm;
  134. 			}
  135. 			else if(f.fz == 0)
  136. 			{
  137. 				newfz = fz;
  138. 				newfm = fm;
  139. 			}
  140. 		}
  141. 		else
  142. 		{
  143. 			newfz = fz * f.fm + fm * f.fz;
  144. 		    newfm = fm * f.fm;
  145. 		}
  147. 		if(newfz != 0)
  148. 		{
  149. 			common = small(newfz,newfm);
  150. 			newfz /= common;
  151. 			newfm /= common;
  152. 		}
  153. 	}
  154. 	else if(flag1 && flag2)
  155.  	{
  156.  		int common = 0;
  157.  		newfz = - (fz * f.fm + fm * f.fz);
  158. 		newfm = fm * f.fm;
  160. 		if(newfz != 0)
  161. 		{
  162. 			common = small(newfz,newfm);
  163. 			newfz /= common;
  164. 			newfm /= common;
  165. 		}
  167. 		newfz = -newfz;
  168. 	}
  170. 	FS f1(newfz,newfm);
  171. 	return f1;
  172. }
  174. int main()
  175. {
  176. 	int n;
  177. 	int i,j,k;
  178. 	cin >> n;
  180. 	string s1,s2;
  181. 	stringstream stream;
  182. 	int sfz = 0, sfm = 0;
  183. 	for(k = 1; k <= n; k++)
  184. 	{
  185. 		cin >> s1 >> s2;
  187. 		string s;
  188. 		for(i = 0; i < s1.length(); i++)
  189. 	    {
  190. 	    	if(s1[i] == 'z')
  191. 			{
  192. 				stream << s;
  193. 				stream >> sfz;
  194. 				stream.clear();
  195. 				s = "";
  197. 				continue;
  198. 			}
  200. 			if(s1[i] == 'm')
  201. 			{
  202. 				stream << s;
  203. 				stream >> sfm;
  204. 				stream.clear();
  205. 				s = "";
  207. 				break;
  208. 			}
  210. 			s += s1[i];
  211. 		}
  213. 		FS c1(sfz,sfm);
  214. 		s = "";
  215. 		sfz = 0;
  216. 		sfm = 0;
  218. 		for(i = 0; i < s2.length(); i++)
  219. 	    {
  220. 	    	if(s2[i] == 'z')
  221. 			{
  222. 				stream << s;
  223. 				stream >> sfz;
  224. 				stream.clear();
  225. 				s = "";
  227. 				continue;
  228. 			}
  230. 			if(s2[i] == 'm')
  231. 			{
  232. 				stream << s;
  233. 				stream >> sfm;
  234. 				stream.clear();
  235. 				s = "";
  237. 				break;
  238. 			}
  240. 			s += s2[i];
  241. 		}
  243. 		FS c2(sfz,sfm);
  244. 		s = "";
  245. 		sfz = 0;
  246. 		sfm = 0;
  248. 		FS c3 = c1 + c2;
  249. 		c3.display();
  250. 	}
  252. 	return 0;
  253. }

5-5

考虑的情况比较多，需要耐心。

  1. #include <iostream>
  2. #include <cstdlib>
  3. #include <string>
  4. #include <sstream>
  5. using namespace std;
  7. class Complex
  8. {
  9. 	private:
  10. 		int real, imag;
  11. 	public:
  12. 		Complex(int a = 0, int b = 0):real(a), imag(b){};
  13. 		void display();
  14. 		Complex operator * (Complex &b);
  15. };
  17. void Complex::display()
  18. {
  19. 	if(real == 0 && imag == 0)
  20. 	{
  21. 		cout << "0" << endl;
  22. 		return ;
  23. 	}
  25. 	else if(real == 0)
  26. 	{
  27. 		if(imag != 1 && imag != -1)
  28. 		cout << imag << "i" << endl;
  29. 		else if(imag == 1)
  30. 		cout << "i" << endl;
  31. 		else
  32. 		cout << "-i" << endl;
  34. 		return ;
  35. 	}
  37. 	else if(imag == 0)
  38. 	{
  39. 		cout << real << endl;
  40. 		return ;
  41. 	}
  43. 	if(imag < 0)
  44. 	{
  45. 		if(imag != -1)
  46. 		cout << real << imag << "i" << endl;
  47. 		else cout << real << "-i" << endl;
  48. 	}
  49. 	else
  50. 	{
  51. 		if(imag != 1)
  52. 		cout << real << "+" << imag << "i" << endl;
  53. 		else if(imag == 1)
  54. 		cout << real << "+i" << endl;
  55. 	}
  56. }
  58. Complex Complex::operator * (Complex &b)
  59. {
  60. 	int creal = 0, cimag = 0;
  61. 	creal = real * b.real - imag * b.imag;
  62. 	cimag = real * b.imag + b.real * imag;
  64. 	Complex c(creal, cimag);
  65. 	return c;
  66. }
  68. int main()
  69. {
  70. 	string s1, s2;
  71. 	int i;
  72. 	while (cin >> s1 >> s2)
  73. 	{
  74. 		string s;
  75. 		stringstream stream;
  77. 		int areal = 0, aimag = 0;
  78. 		int breal = 0, bimag = 0;
  79. 		for (i = 0; i < s1.length(); i++)
  80. 		{
  81. 			if (i == 0 && s1[0] == '-')
  82. 			{
  83. 				s += '-';
  84. 				continue;
  85. 			}
  87. 			if (s1[i] == '+' || s1[i] == '-')
  88. 			{
  89. 				stream << s;
  90. 				stream >> areal;
  91. 				stream.clear();
  93. 				s = "";
  95. 				if (s1[i] == '-')
  96. 				s += '-';
  98. 				continue;
  99. 			}
  101. 			if (s1[i] == 'i')
  102. 			{
  103. 				if(s == "-" || s == "")
  104. 				{
  105. 					if(s == "-")aimag = -1;
  106. 					else aimag = 1;
  108. 					s = "";
  110. 					break;
  111. 				}
  113. 				stream << s;
  114. 				stream >> aimag;
  115. 				stream.clear();
  117. 				s = "";
  119. 				break;
  120. 			}
  122. 			s += s1[i];
  123. 		}
  125. 		if (s != "")
  126. 		{
  127. 			stream << s;
  128. 			stream >> areal;
  129. 			stream.clear();
  131. 			s = "";
  132. 		}
  134. 		s = "";
  136. 		for (i = 0; i < s2.length(); i++)
  137. 		{
  138. 			if (i == 0 && s2[0] == '-')
  139. 			{
  140. 				s += '-';
  141. 				continue;
  142. 			}
  144. 			if (s2[i] == '+' || s2[i] == '-')
  145. 			{
  146. 				stream << s;
  147. 				stream >> breal;
  148. 				stream.clear();
  150. 				s = "";
  152. 				if (s2[i] == '-')
  153. 				s += '-';
  155. 				continue;
  156. 			}
  158. 			if (s2[i] == 'i')
  159. 			{
  160. 				if(s == "-" || s == "")
  161. 				{
  162. 					if(s == "-")bimag = -1;
  163. 					else bimag = 1;
  165. 					s = "";
  167. 					break;
  168. 				}
  170. 				stream << s;
  171. 				stream >> bimag;
  172. 				stream.clear();
  174. 				s = "";
  176. 				break;
  177. 			}
  179. 			s += s2[i];
  180. 		}
  182. 		if (s != "")
  183. 		{
  184. 			stream << s;
  185. 			stream >> breal;
  186. 			stream.clear();
  188. 			s = "";
  189. 		}
  191. 		Complex A(areal, aimag), B(breal, bimag);
  192. 		Complex C = A * B;
  193. 		//A.display();
  194. 		//B.display();
  195. 		C.display();
  196. 	}
  197. 	return 0;
  198. }
  200. //i -i

PAT第二次上机题目的更多相关文章

  1. SDN 第二次上机作业

    SDN第二次上机作业 1.控制器floodlight所示可视化图形拓扑的截图,及主机拓扑连通性检测截图 拓扑 连通性 2.利用字符界面下发流表,使得'h1'和'h2' ping 不通 流表截图 连通性 ...

  2. 2019 SDN第二次上机作业

    2019 SDN第二次上机作业 1. 利用mininet创建如下拓扑,要求拓扑支持OpenFlow 1.3协议,主机名.交换机名以及端口对应正确,请给出拓扑Mininet执行结果,展示端口连接情况 创 ...

  3. 连连看游戏（dfs）【华为上机题目】

    1 连连看游戏 今天同学给我做了道编程题目,貌似是华为的,题目描述大概是这样的: 给定一个连连看棋盘,棋盘上每个点都有各种图案(用非0数字表示),输入棋盘上的任意两个左标,判断这两个坐标对应的图案是否 ...

  4. Java第二次上机随笔

    主要是一些原来不懂但是本次上机涉及到的内容... 一.空数组与数组为null的区别 1.空数组: int[] array = new int[0]; array.length == 0; 空数组是一个 ...

  5. ZOJ问题(2010浙江大学研究生复试上机题目[找规律] hdoj 3788)

    ZOJ问题 pid=3788">点击打开链接 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

  6. 算法上机题目mergesort，priority queue，Quicksort，divide and conquer

    1．Implement exercise 2.3-7. 2． Implement priority queue. 3． Implement Quicksort and answer the follo ...

  7. 题解：2018级算法第二次上机 Zexal的排座位

    题目描述: 样例: 实现解释: 一道看似复杂但实际既是斐波那契变形的题目 知识点:递推,斐波那契 通过问题的描述,可以得到以下规律:(除了座位数为一时)男生坐最后时,倒数第二个一定是女生:女生坐最后, ...

  8. C++第二次上机5-5

    建立一个复数类Complex,实数和虚数是其私有数据成员: 建立复数类的无参和参数化构造函数: 建立一个 *(乘号)的运算符重载,以便于对两个复数直接进行乘法运算: 建立输出函数void displa ...

  9. 2016级算法第二次上机-G.ModricWang's Real QuickSort

    873 思路 这是一道非常基础的题,目的是帮助大家回顾快排相关的知识.大家完成此题之后应该就对快排有比较深刻的印象了. 对于整个快排的流程,题目描述中已经给了清晰完整的伪代码.需要自己加工的部分就是, ...

随机推荐

  1. Spark性能优化(一)

    前言 在大数据计算领域,Spark已经成为了越来越流行.越来越受欢迎的计算平台之一.Spark的功能涵盖了大数据领域的离线批处理.SQL类处理.流式/实时计算.机器学习.图计算等各种不同类型的计算操作 ...

  2. [py]处理文件的3个方法

    file处理的3个方法: f和f.readlines效果一样 # f.read() 所有行 -> 字符串 # f.readline 读取一行 -> 字符串 # f.readlines 所有 ...

  3. How to enable TLS 1.2 on Windows Server 2008 R2

    Problem How to enable TLS 1.2 on Windows Server 2008 R2? Resolution QuoVadis recommends enabling and ...

  4. BCB TLable控件透明背景属性

    当我们希望一个Label适应它父窗口的背景时,设置Tranparent属性值就OK Transparent:true 透明  false 不透明

  5. [转]VS中展开和折叠代码

    VS2005代码编辑器的展开和折叠代码确实很方便和实用.以下是展开代码和折叠代码所用到的快捷键,很常用: Ctrl + M + O: 折叠所有方法 Ctrl + M + M: 折叠或者展开当前方法 C ...

  6. LinkedList详解

    一.LinkedList的介绍与特点. 1.继承实现关系. 实现了双端队列接口Deque,因此具有双端队列的功能:addFirt,addLast,offerFirt,offerLast,removeF ...

  7. 植物大战僵尸作弊器源代码（MFC版）

    控制版使用不太方便,此MFC版与控制台版内容一样.具体可以参考前面.此处只附源代码,不加以说明.......... 头文件 // jsMFCDlg.h : 头文件 // #pragma once // ...

  8. 【kafka学习之四】kafka集群性能测试

    kafka集群的性能受限于JVM参数.服务器的硬件配置以及kafka的配置,因此需要对所要部署kafka的机器进行性能测试,根据测试结果,找出符合业务需求的最佳配置. 1.kafka broker j ...

  9. python中的对象（三）

    一.python对象 python使用对象模型来存储数据.构造任何类型的值都是一个对象. 所有python对象都拥有三个特性:身份.类型.值 身份:每个对象都有一个唯一的身份标识自己,任何对象的身份可 ...

  10. java commons.lang3 ArrayUtils使用

    java commons.lang3 ArrayUtils使用import org.apache.commons.lang3.ArrayUtils; /** *数组追加数组,不重复 */ public ...