技术标签: c++ primer plus c++ c++ primer plus编程答案 源代码 编程 答案
//TVector.h
#include <iostream>
namespace n_vector
{
using std::ostream;
class TVector
{
public:
enum Mode {RECT, POL}; // 坐标类型,依次为直角坐标、极坐标
public:
explicit TVector (double a = 0, double b = 0, Mode mode = RECT); // (x, y) OR (length, angle)
void reset (double a = 0, double b = 0, Mode mode = RECT);
void setMode (Mode mode);
Mode getMode (void) const;
double getX (void) const;
double getY (void) const;
double getLength (void) const;
double getAngle (void) const;
TVector operator+ (const TVector& rvalue) const;
TVector& operator+= (const TVector& rvalue);
TVector operator- (void) const;
private:
void m_setPolar (void);
void m_setRect (void);
private:
double m_x; // 直角坐标的X坐标
double m_y; // 直角坐标的Y坐标
double m_length; // 极坐标的长度
double m_angle; // 极坐标的角度
Mode m_mode;
};
ostream& operator<< (ostream& os, const TVector& vec);
}
//TVector.cc
#include <iostream>
#include <cmath>
#include "TVector.h"
namespace n_vector
{
static const double k_rad_to_deg = 57.2958;
static double convertRadToDeg (double rad)
{
return (rad * k_rad_to_deg);
}
static double convertDegToRad (double deg)
{
return (deg / k_rad_to_deg);
}
TVector::TVector (double a, double b, Mode mode) : m_mode(mode)
{
if (RECT == mode) {
m_x = a;
m_y = b;
m_setPolar();
} else if (POL == mode) {
m_length = a;
m_angle = convertDegToRad(b);
m_setRect();
} else { ;}
}
void TVector::reset (double a, double b, Mode mode)
{
*this = TVector(a, b, mode);
}
void TVector::setMode (Mode mode)
{
m_mode = mode;
}
TVector::Mode TVector::getMode (void) const
{
return (m_mode);
}
double TVector::getX (void) const
{
return (m_x);
}
double TVector::getY (void) const
{
return (m_y);
}
double TVector::getAngle (void) const
{
return (convertRadToDeg(m_angle));
}
double TVector::getLength (void) const
{
return (m_length);
}
TVector TVector::operator+ (const TVector& rvalue) const
{
TVector tmp(m_x + rvalue.m_x, m_y + rvalue.m_y);
tmp.m_mode = this->m_mode;
return (tmp);
}
TVector& TVector::operator+= (const TVector& rvalue)
{
*this = *this + rvalue;
return (*this);
}
TVector TVector::operator- (void) const
{
TVector tmp(-m_x, -m_y);
tmp.m_mode = this->m_mode;
return (tmp);
}
void TVector::m_setPolar (void)
{
m_length = sqrt(m_x * m_x + m_y * m_y);
m_angle = (0 == m_x && 0 == m_y) ? 0 : atan2(m_y, m_x);
}
void TVector::m_setRect (void)
{
m_x = m_length * cos(m_angle);
m_y = m_length * sin(m_angle);
}
ostream& operator<< (ostream& os, const TVector& vec)
{
if (TVector::RECT == vec.getMode())
os << '(' << vec.getX() << ',' << vec.getY() << ')';
else
os << '(' << vec.getLength() << ',' << vec.getAngle() << "°)";
return (os);
}
}
//mian.cc
#include <iostream>
#include <fstream>
#include <limits>
#include "TVector.h"
using namespace std;
using namespace n_vector;
int main ()
{
ofstream of;
of.open("output.txt");
while (true) {
double setp;
double distance;
unsigned cnt_steps = 0;
cout << "输入步长:";
cin >> setp;
if (!cin || setp <= 0)
break;
cin.clear(); // 清空输入缓冲区错误标志位
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n'); // 清空输入缓冲区内容
cout << "输入距离:";
cin >> distance;
if (!cin || distance <= 0)
break;
cin.clear(); // 清空输入缓冲区错误标志位
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n'); // 清空输入缓冲区内容
of << "开始>>>>>>>>>>" << endl;
TVector vec(0, 0, TVector::POL);
srand((unsigned)time(nullptr));
while (vec.getLength() < distance) {
vec += TVector(setp, rand()%361, TVector::POL);
of << cnt_steps++ << ":" << vec << endl;
}
of << "结束<<<<<<<<<<" << endl;
of << "距离" << distance << ",步长" << setp << ",历经" << cnt_steps << "步走完,终点坐标" << vec << endl;
of << "==========\n" << endl;
}
of.close();
}
http://blog.csdn.net/qq844352155/article/details/24111645
http://blog.csdn.net/qq844352155/article/details/24112981
http://blog.csdn.net/qq844352155/article/details/24125767
http://blog.csdn.net/qq844352155/article/details/24128929
http://blog.csdn.net/qq844352155/article/details/24130805
//11.7编写一个复数类,对复数进行运算,复数表示方法为(a,b)
#include <iostream>
using namespace std;
class Complex{
double a;
double b;
public:
Complex (const double x=0,const double y=0) : a(x),b(y) {}
friend ostream & operator << (ostream & os , const Complex & complex)
{
os << "(" << complex.a << " , " << complex.b << ")" ;
return (os);
}
friend istream & operator >> (istream & is , Complex & complex)
{
char ch;
is >> complex.a >> ch >> complex.b ;
return (is);
}
Complex operator +(const Complex & complex)
{
return Complex(a+complex.a,b+complex.b);
}
Complex operator -(const Complex & complex)
{
return Complex(a-complex.a,b-complex.b);
}
Complex operator *(const Complex & complex)
{
return Complex((a*complex.a - b*complex.b),(a*complex.b + b*complex.a));
}
friend Complex operator *(int x,const Complex & complex)
{
return Complex(x * complex.a , x * complex.b);
}
friend Complex operator ~(const Complex & complex)
{
return Complex(complex.a,-complex.b);
}
};
int main()
{
Complex a(3.0, 4.0); // initialize to (3,4i) Programming Exercises
Complex c;
cout << "Enter a complex number (eg:a,b)(q to quit):\n";
while (cin >> c)
{
cout << "c is " << c << endl;
cout << "complex conjugate is " << ~c << '\n';
cout << "a is " << a << endl;
cout << "a + c is " << a + c << endl;
cout << "a - c is " << a - c << endl;
cout << "a * c is " << a * c << endl;
cout << "2 * c is " << 2 * c << endl;
cout << "Enter a complex number (eg:a,b)(q to quit):\n";
}
cout << "Done!" << endl;
}
文章浏览阅读241次。目录[隐藏]1Loadavg分析1.1Loadavg浅述1.2Loadavg读取1.3Loadavg和进程之间的关系1.4Loadavg采样218内核计算loadavg存在的问题2.1xtime_lock解析2.2全局load读写分离解xtime_lock问题2.3几个关键点:2..._$load_avg_per_cpu.max.warn
文章浏览阅读1.2k次,点赞53次,收藏39次。快速排序整体的综合性能和使用场景都是比较好的,所以才敢叫快速排序时间复杂度:O(N*logN)空间复杂度:O(logN)稳定性:不稳定。
文章浏览阅读1.3k次。step1 :下载百度云链接https://pan.baidu.com/s/1luAFF8gGddWFqgbq-_X0cg提取码: 5xdj包含 git github forwindows githubforMac 以及notepad++step2:安装这个安装程序,是强制安装路径的,所以不要乱搞 下载之后直接点击就行。@基本情况就是这样..._下载了githubdesktop
文章浏览阅读4.7k次。要想让一个程序功能变得灵活起来,那么配置绝对是不可或缺的,通过合理的设计,将所有动态变量都配置化,可以最大程度上让程序变得灵活。可是在某些复杂的业务场景中,仅仅只是变量的配置化,往往还并不能满足需求,尤其是互联网这种业务需要快速更迭的行业。于是,做一个这样的功能:仅仅依靠配置,就能让程序的逻辑cover住所有的业务逻辑变化,就成为了程序员的终极梦想。然而,现实是残酷的,"write once run forevre",这几乎是不可能实现的梦想(如果真的出现了这样的技术,那可能会是我们职业生涯将要面对的最_nashorn
文章浏览阅读1.5w次,点赞4次,收藏28次。一道关于ctf的题,用python将rgb值转化为图片_ctf 三个坐标值转换图像
文章浏览阅读1.4k次。前言: 安防领域最近几年可谓暗流涌动,作为安防业的双寡头,大华股份与海康威视凭借行业的东风,两家公司的成长速度异常强劲,在国际市场上已经和应用厂家进行厮杀。 2015年两家公司双双晋升“全球安放50强”,海康排名第二,大华排名第五。以华为海思为代表国产芯片解决方案不断走强,在国际竞争中优势凸显,在后端NVR高端产品线先后推出了海思3531、海思3535、海思3536,同时针对低端的产品线也不..._海思hi35xx平台软件开发快速入门之背景知识
文章浏览阅读285次。一些基本公式和定义(1,c,p1,p2)(1,c,p1,p2)(1,c,p_1,p_2)敏感含义‖,‖≤r,Pr[]≥p1‖,‖≤r,Pr[]≥p1\|,\| \leq r, Pr[] \geq p_1, ‖,‖>cr,Pr[]≤p2‖,‖>cr,Pr[]≤p2\|,\| > cr, Pr[] \leq p_2基本LSH函数h(o)=⌊a⋅o+bw⌋h(o)=⌊a..._lsb tree
文章浏览阅读2k次。mathtype插入在WPS中出现The MathType DLL cannot be found问题_mathtype不能被发现
文章浏览阅读1.8k次,点赞2次,收藏3次。对于⽤vs作为开发⼯具的同学来说,可能常常会碰到“Lc.exe已退出代码为-1”的问题,造成这个结果的⼀般是因为加⼊了第三⽅的插件程序造成的,今天记录下如何解决。查看加载的程序项⽬,找到Properties⽂件夹licenses.licx⽂件,然后右键选择删除就可以了,调试运⾏正常了。可以使⽤⽂本编辑器打开上述⽂件,也可以使⽤其它的编辑器,在⽂件中查找licenses.licx字样,删除对应节点。找到你系统的*.csproj⽂件,这个⽂件是加载项⽬⽂件。c.exe已退出代码为-1问题解决⽅法。_lc.exe已退出 代码为-1
文章浏览阅读6.4k次,点赞7次,收藏29次。【代码】linux系统忘记登录密码怎么办。_linux忘记密码
文章浏览阅读1.4w次,点赞5次,收藏12次。Allegro软件经典报错解决方案Allegro经典报错解决方案初学者在用cadence画pcb的时候,偶尔会遇到像这样的问题。“Program has encountered a problem and must exit The design will besaved as a SAV file that can be recovered using dbdoctor (íf applic..._program has encountered a
文章浏览阅读1.7w次,点赞11次,收藏102次。Tomcat11、Tomcat10安装(详细)一、检查Java在Windows上的存在。二、查看tomcat版本规范,确定适合自己机器的tomcat版本。三、tomcat下载。下载目录里的文件分类类型说明。四、tomcat10安装。五、tomcat10安装不成功时解决方案。六、启动tomcat时运行界面乱码的解决方法。七、tomcat 相关配置文章............_tomcat10