// DrawFrogView.cpp : implementation of the CDrawFrogView class//#include"stdafx.h"#include"DrawFrog.h"#include"DrawFrogDoc.h"#include"DrawFrogView.h"#include"math.h"#definePI3.14#ifdef_DEBUG#definenewDEBUG_NEW#undefTHIS_FILEstaticchar THIS_FILE[]=__FILE__;#endif/// CDrawFrogViewIMPLEMENT_DYNCREATE(CDrawFrogView, CView)BEGIN_MESSAGE_MAP(CDrawFrogView, CView)//{
{AFX_MSG_MAP(CDrawFrogView)// NOTE - the ClassWizard will add and remove mapping macros here.// DO NOT EDIT what you see in these blocks of generated code!//}}AFX_MSG_MAP// Standard printing commandsON_COMMAND(ID_FILE_PRINT, CView::OnFilePrint)ON_COMMAND(ID_FILE_PRINT_DIRECT, CView::OnFilePrint)ON_COMMAND(ID_FILE_PRINT_PREVIEW, CView::OnFilePrintPreview)END_MESSAGE_MAP()/// CDrawFrogView construction/destructionCDrawFrogView::CDrawFrogView(){
// TODO: add construction code here
1、搭建网络
搭建网络拓扑、分配IP地址、划分网段、连接端口 2、配置路由器
路由器基础配置
//进入全局配置模式
Router#enable
Router#conf t
Enter configuration commands, one per line. End with CNTL/Z.//配置高速同步串口serial2/0
Router(config)#int ser2/0
Route…
题目列表
3184. 构成整天的下标对数目 I
3185. 构成整天的下标对数目 II
3186. 施咒的最大总伤害
3187. 数组中的峰值
一、构成整天的下标对数目 I & II 可以直接二重for循环暴力遍历出所有的下标对,然后统计符合条件的下标对数目返回。代码如下
class So…