<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Pikachu_eternity的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Pikachu_eternity</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Pikachu_eternity]]></copyright><item><title><![CDATA[c++Shape为抽象类 派生出其他类，并对其他类进行创建对象及求面积]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/115049418</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/115049418</guid><author>Pikachu_eternity</author><pubDate>Sun, 21 Mar 2021 14:56:58 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
using namespace std;
#define pi 3.1415926
//抽象类Shape
class Shape {
public:
	virtual double getArea() = 0;
};
//派生类Circle
class Circle :public Shape {
protected:
	double _radius;
public:
	Circle() {};
	Circle(int radius) {
		_radius]]></description><category></category></item><item><title><![CDATA[编写程序查找数组中是否存在某个指定元素；将数组a和数组b中的素数不重不漏地合并到 一个vector容器c中，然后按照下标访问的方式手动对容器c中的数据，按从小到大顺序重新排序]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111566648</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111566648</guid><author>Pikachu_eternity</author><pubDate>Tue, 22 Dec 2020 20:50:41 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;algorithm&gt;
#include &lt;string&gt;
using namespace std;
int main() {
	int a[5] = { 19,67,24,11,17 }, b[5] = { 2,3,9,17,59 };

	//数组a为乱序数组，可以用顺序查找法查找
	for (int m = 0;m &lt; sizeof(a) / sizeof]]></description><category></category></item><item><title><![CDATA[1) 显示定义析构函数； 2) 获取分数的分子； 3) 获取分数的分母； 4) 实现分数的约分； 5) 实现对两个分数对象进行通分； 6) 使用 operator/操作符重载实现两个分数的除法运算。]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111396642</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111396642</guid><author>Pikachu_eternity</author><pubDate>Fri, 18 Dec 2020 21:18:49 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
using namespace std;
class Fraction {
	//数据成员，访问控制属性默认是私有
	int m_numerator = 0; // 分子默认为0； C++11
	int m_denominator = 1; //分母默认为1；
	
public://公有成员函数
	Fraction(int above = 0, int below = 1) :
		m_numerator(above), m_denominator(belo]]></description><category></category></item><item><title><![CDATA[c++辗转相除递归求最大公约数]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111187905</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111187905</guid><author>Pikachu_eternity</author><pubDate>Mon, 14 Dec 2020 22:56:38 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
int main() {
	int GCD(int c, int d);
	int c, d;
	cout &lt;&lt; "请输入两个数字" &lt;&lt; endl;
	cin &gt;&gt; c &gt;&gt; d;
	cout &lt;&lt; c &lt;&lt; "和" &lt;&lt; d &lt;&lt; "的最大公约数为" &lt;&lt; GCD(c, d) &lt;&lt; endl;]]></description><category></category></item><item><title><![CDATA[约瑟夫]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111053828</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111053828</guid><author>Pikachu_eternity</author><pubDate>Fri, 11 Dec 2020 21:37:56 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;vector&gt;
using namespace std;
int main()
{
	int m,n,k,p,number=0,i;
	cout &lt;&lt; "请输入总人数m以及循环号码n：";
	cin &gt;&gt; m &gt;&gt; n;
	k = m;
	vector&lt;bool&gt; left(m, 1);
	while (k &gt; 1)
	{
		i = number;				//i记录循环开始]]></description><category></category></item><item><title><![CDATA[c++广义回文判断]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111032584</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/111032584</guid><author>Pikachu_eternity</author><pubDate>Fri, 11 Dec 2020 11:54:20 +0800</pubDate><description><![CDATA[回文为：滤去所有非字母字符（包括空格）后，不考虑字母的大小写，从左向右和从右向左读都相同的词或短语。

本代码可实现广义回文的判断功能
#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;vector&gt;
using namespace std;
int main() {
	string sentence;
	vector &lt;char&gt; n_s;
	int a,i,n,m;
	int is_palindrome = .]]></description><category></category></item><item><title><![CDATA[c++回文数判断]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/110721153</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/110721153</guid><author>Pikachu_eternity</author><pubDate>Sat, 05 Dec 2020 20:18:40 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
const int SZ = 100;
int main()
{
char carray[SZ];
int is_palindrome = 1;
cout &lt;&lt; "Please input a string .." &lt;&lt; endl;
cin.get(carray, SZ);
int len = strlen(carray);
for (int i = 0; i &lt; len/2; i++]]></description><category></category></item><item><title><![CDATA[c++已知一个方阵，存储在一个二维数组中。用指针访问数组元素的方法， 计算方阵中上三角所有元素的和、下三角所有元素的和，以及主对角线上的所有 元素和。]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/110720349</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/110720349</guid><author>Pikachu_eternity</author><pubDate>Sat, 05 Dec 2020 20:14:03 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
int main() {
	int arr[3][3] = { {1,2,3,},{2,3,4,},{3,4,5,}};
	int(*p) = *arr;
	int up_sum = 0, down_sum = 0, djx = 0;
	int a = 0, b=2;
	for (;a &lt; 3;++a,b=2) {
		for (;a==0&amp;&amp;b &gt;-1;--b) 
			up_sum ]]></description><category></category></item><item><title><![CDATA[c++已知一个矩阵，存储在一个二维数组中。将矩阵中和值为最大的那一行 元素与首行对换。]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/110714483</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/110714483</guid><author>Pikachu_eternity</author><pubDate>Sat, 05 Dec 2020 19:37:20 +0800</pubDate><description><![CDATA[定义函数方法，便于后期维护
#include &lt;iostream&gt;
using namespace std;
int max_2(int p, int q);
int max_4(int p, int q, int s, int t);
int first_line();
int second_line();
int third_line();
int fourth_line();
int main() {
	cout &lt;&lt; "原矩阵" &lt;&lt; endl;
	int arr]]></description><category></category></item><item><title><![CDATA[c++同构数判断]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109895280</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109895280</guid><author>Pikachu_eternity</author><pubDate>Sat, 21 Nov 2020 13:06:06 +0800</pubDate><description><![CDATA[同构数，即这个数出现在他平方的右侧，比如5*5=25，5出现在25的右侧，则5为同构数
本代码可以用来判断用户输入的数是否为同构数
#include&lt;iostream&gt;
using namespace std;
int main() {
	int a, b,c;
	while (1) {
		cout &lt;&lt; "请输入一个整数" &lt;&lt; endl;
		cin &gt;&gt; a;
		b = a * a;
		if (a == b % 10)*//除10取余，判断个位数字]]></description><category></category></item><item><title><![CDATA[迭代法求圆周率]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109756453</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109756453</guid><author>Pikachu_eternity</author><pubDate>Tue, 17 Nov 2020 22:30:34 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;&lt;cmath&gt;
using namespace std;

int main() {
	float  a = 1, b = 1, c = 1;
	float sum = 0;
	
	//引用绝对值函数减少代码量
	while ( fabs (c) &gt;= 1.0E-12//精确度10^-12) {
		c = a / b;
		sum += c;
		a = -a;
		b += 2;
	}
	cout &lt;&lt; sum * 4 &l]]></description><category></category></item><item><title><![CDATA[c++循环打印菱形]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672361</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672361</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:16:15 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cmath&gt;

	using namespace std;

	int main()
	{
		int n, t, b, k, j;
		
		while (1) {
			cout &lt;&lt; "请输入行数" &lt;&lt; endl;
			cin &gt;&gt; n;
			t = (n + 1) / 2;                     
			for (k = 1;k &lt;= n;k++) {
.]]></description><category></category></item><item><title><![CDATA[c++200内素数矩阵输出]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672354</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672354</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:15:21 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;&lt;cmath&gt;
using namespace std;
int main() {
	int n=100,j,b,c=0,d=1;
	for (; n &lt; 201; n++) {
		
		for (j=2; j &lt;= n; j++) {
			b = n % j;
			if (b != 0)
				continue;
			if (j == n) {
					cout &lt;&lt; j &lt;&lt; "\t";
			]]></description><category></category></item><item><title><![CDATA[c++素数判断]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672342</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672342</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:14:22 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cmath&gt;
using namespace std;
int main() {
	int a, b, n = 2;
	cout &lt;&lt; "请输入一个数" &lt;&lt; endl;
	cin &gt;&gt; a;
	for (;n &lt; a;n++) {
		b = a % n;
			if (b == 0)
				cout &lt;&lt; a &lt;&lt; "不是素数" &lt;&lt; end]]></description><category></category></item><item><title><![CDATA[c++圆面积计算]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672333</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672333</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:13:02 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cmath&gt;
using namespace std;
int main() {
	double radius=1, area,pi=3.14;
	for (;radius &lt; 11;radius++) {
		area = pi * radius*radius;
		if (area &lt; 100)
			cout &lt;&lt; area &lt;&lt; endl;
	}
		
	return  0;
}
]]></description><category></category></item><item><title><![CDATA[c++10数字平均数&正数个数]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672328</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672328</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:12:05 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
int main() {
	double a, sum = 0, n,average=0;
	for (n = 1 ;n &lt;= 10; n++) {
		cout &lt;&lt; "请输入第" &lt;&lt; n &lt;&lt; "个数" &lt;&lt; endl;
		cin &gt;&gt; a;
		average += a;
		if (a &gt; 0)
			sum += 1;
		els]]></description><category></category></item><item><title><![CDATA[c++4*5矩阵]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672321</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672321</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:10:59 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
using namespace std;
int main()
{
	int i, j, a;
	for (i = 1;i &lt;5;i++)
	{
		for (j = 1;j &lt;6;j++)
		{
			a = i * j;
			cout &lt;&lt; a &lt;&lt; "\t";
		}
		cout &lt;&lt; endl;
	}
	return 0;
}



]]></description><category></category></item><item><title><![CDATA[c++n项求和]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672315</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672315</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:09:41 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
int main() {
	
	do {
		int a, n,b ;
		cout &lt;&lt; "请输入一个数" &lt;&lt; endl;
		cin &gt;&gt; a;
		if (a &gt; 0) {
			n = (1 + a) * a / 2;
			cout &lt;&lt; n &lt;&lt; endl;
		}
		else break;
		cout &lt;&lt; "要继续嘛]]></description><category></category></item><item><title><![CDATA[c++海伦公式]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672306</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672306</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:08:22 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cmath&gt;
using namespace std;
int main() {
	double a, b, c,p,s;
	cout &lt;&lt; "请输入三角形三条边长" &lt;&lt; endl;
	cin &gt;&gt; a &gt;&gt; b &gt;&gt; c;
	p = (a + b + c) / 2;
	s = p * (p - a) * (p - b) * (p - c);
	s = sqrt(]]></description><category></category></item><item><title><![CDATA[c++如何实现排列三个数据]]></title><link>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672288</link><guid>https://blog.youkuaiyun.com/Pikachu_eternity/article/details/109672288</guid><author>Pikachu_eternity</author><pubDate>Fri, 13 Nov 2020 12:06:57 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
int main() {
	int a, b, c, d;
	cout &lt;&lt;"请输入三个变量" &lt;&lt; endl;
	cin &gt;&gt; a &gt;&gt; b &gt;&gt; c;
	if (a &lt; b)
		d = a;a = b;b = d;
	if (a &lt; c)
		d = a;a = c;c = d;
	if (b &lt; c)
		d = b;b = c;]]></description><category></category></item></channel></rss>