<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[rain699的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/rain699</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; rain699]]></copyright><item><title><![CDATA[软件调试栈回溯实验]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/107812027</link><guid>https://blog.youkuaiyun.com/rain699/article/details/107812027</guid><author>rain699</author><pubDate>Wed, 05 Aug 2020 12:21:04 +0800</pubDate><description><![CDATA[软件调试栈回溯实验实验要求要求1要求2实验原理实验过程编写程序调试运行利用当前的栈基址和调试信息得到函数的调用关系，实现类似bt的显示结果。实现frame切换后利用print显示变量的效果附录
实验要求
编写一个C/C++程序例子，至少有三层的函数调用存在。通过GDB对编写的软件进行调试，需在第三层函数内设置断点使得程序暂停，然后进行如下的分析:
要求1
如何利用当前的栈基址和调试信息得到函数的调用关系，实现类似bt的显示结果，需进行解释说明；
要求2
在栈帧进行切换后，例如切换到第二层的函数上，分析如何根]]></description><category></category></item><item><title><![CDATA[计算智能导论课程报告]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/103557012</link><guid>https://blog.youkuaiyun.com/rain699/article/details/103557012</guid><author>rain699</author><pubDate>Mon, 16 Dec 2019 09:38:31 +0800</pubDate><description><![CDATA[一、问题描述（给出所解决问题的简要描述）

用遗传算法求解如下函数优化问题：

max f(x1,x2)=21.5+x1*sin(4*pi*x1)+x2*sin(20*pi*x2),

-3.0&lt;=x1&lt;=12.1，4.1&lt;=x2&lt;=5.8

二、方法设计（给出方法的详细设计步骤）



图1 遗传算法流程图



1.个体的编码：问题的可能解为实数对(x1，x2)的形式...]]></description><category></category></item><item><title><![CDATA[习题5-2 UVA1594 Ducci序列（vector,set)       习题5-3 UVA 10935 卡片游戏(queue)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100609292</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100609292</guid><author>rain699</author><pubDate>Sat, 07 Sep 2019 22:09:53 +0800</pubDate><description><![CDATA[习题5-2


//使用vector和set
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;vector&gt;
#include&lt;set&gt;
#include&lt;cmath&gt;
using namespace std;
int T,n;
int ele;
i...]]></description><category></category></item><item><title><![CDATA[习题5-1 UVA1593 代码对齐（vector)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100608183</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100608183</guid><author>rain699</author><pubDate>Sat, 07 Sep 2019 21:29:13 +0800</pubDate><description><![CDATA[//记录每一行中各个单词的长度
//利用最长的单词长度来确定每一行输出单词的位置
#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;string&gt;
#include&lt;sstream&gt;
#include&lt;vector&gt;
#include&lt;algorithm&gt;
#include&lt;c...]]></description><category></category></item><item><title><![CDATA[例题5-12 UVA221 城市正视图 （离散化）（综合应用）]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100565640</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100565640</guid><author>rain699</author><pubDate>Thu, 05 Sep 2019 19:45:03 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;set&gt;
#include&lt;vector&gt;
#include&lt;algorithm&gt;
using namespace std;
int n;
struct building
{
    int id;
    int x;
    int y;
  ...]]></description><category></category></item><item><title><![CDATA[例题5-11 UVA814 邮件传输代理的交互（综合）]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100560730</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100560730</guid><author>rain699</author><pubDate>Thu, 05 Sep 2019 16:25:00 +0800</pubDate><description><![CDATA[WA了一次，

通过在uDebug上提供的第二个测试用例发现“一个发件人可能给同一个收件人发送多次消息”，

所以增加了一个set&lt;string&gt; 进行判重就过了。

AC代码：


#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;map&gt;
#include&lt...]]></description><category></category></item><item><title><![CDATA[例题5-9 UVA1592 数据库 （综合）]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188958</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188958</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:23:27 +0800</pubDate><description><![CDATA[//题目意思：给定一个数据库，查找是否存在不同的两行中对应的两列字符串相同，输出结果按照列枚举
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstdlib&gt;
#include&lt;cstring&gt;
#include&lt;string&gt;
#include&lt;map&gt;
#include&lt;...]]></description><category></category></item><item><title><![CDATA[例题5-5 UVA12096 集合栈计算机 （综合）]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188937</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188937</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:22:40 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#include&lt;cstdio&gt;
#include&lt;vector&gt;
#include&lt;map&gt;
#include&lt;set&gt;
#include&lt;stack&gt;
using namespace std;

typedef set&lt;int...]]></description><category></category></item><item><title><![CDATA[例题5-8 UVA400 Unixls命令]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188920</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188920</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:21:30 +0800</pubDate><description><![CDATA[//F 是 将要地政进行排序的文件名个数
//C 是列数
//L是最长的文件名字的长度
//文件名字是左对齐  长度范围是1-60
//最右边的一列将是最长的文件名长度
//其他的列的长度则是最长的文件名的长度加2
//每一行最长为60
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&...]]></description><category></category></item><item><title><![CDATA[例题5-7 UVA136 丑数 (优先队列的使用)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188902</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188902</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:20:29 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;vector&gt;
#include&lt;queue&gt;
#include&lt;set&gt;
using namespace std;
typedef long long LL;
int a[3]={2,3,5};
int main()
{
    priority...]]></description><category></category></item><item><title><![CDATA[例题5-6 UVA540 团体队列 (queue的使用)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188884</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188884</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:19:04 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;map&gt;
#include&lt;queue&gt;
using namespace std;
int t,n,x,a;
int num=1;
string s;
int main()
{
    while((cin&gt;...]]></description><category></category></item><item><title><![CDATA[例题5-4 UVA156 反片语 (map的使用)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188870</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188870</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:17:53 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;algorithm&gt;
#include&lt;vector&gt;
#include&lt;map&gt;
using namespace std;
map&lt;string,int&gt;mp;
vector&lt;str...]]></description><category></category></item><item><title><![CDATA[例题5-3 UVA10815 (set的使用)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188845</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188845</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:16:37 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;string&gt;
#include&lt;set&gt;
#include&lt;sstream&gt;
using namespace std;
set&lt;string&gt;dict;
string s,buf;
int main()
{
    while(cin&gt;&gt;s)
    {
      ...]]></description><category></category></item><item><title><![CDATA[例题5-2 UVA101 木块问题 (vector的使用)]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188834</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188834</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:15:06 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;vector&gt;
using namespace std;
vector&lt;int&gt;box[30];
string s1,s2;   int a,b,n,ha,hb,pa,pb;

void find_box(int ...]]></description><category></category></item><item><title><![CDATA[例题5-1 UVA 10474 STL 排序]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100188810</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100188810</guid><author>rain699</author><pubDate>Sun, 01 Sep 2019 22:13:44 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
using namespace std;
int N,Q,x,pos;
int number=0;
int a[100005];
int main()
{
    while(cin&gt;&gt;N&...]]></description><category></category></item><item><title><![CDATA[习题4-4 UVA253 骰子涂色]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100122194</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100122194</guid><author>rain699</author><pubDate>Wed, 28 Aug 2019 16:39:24 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;algorithm&gt;
#include&lt;cstdlib&gt;
#include&lt;string&gt;
using namespace std;
int flag;
string a[24]=
{
"012345","024135","043215","031...]]></description><category></category></item><item><title><![CDATA[习题4-3 UVA220黑白棋（WA）]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/100068152</link><guid>https://blog.youkuaiyun.com/rain699/article/details/100068152</guid><author>rain699</author><pubDate>Sun, 25 Aug 2019 21:36:28 +0800</pubDate><description><![CDATA[2019-8-25

这道题一直在WA，没有通过，先占个坑，日后再改。

附WA代码：


#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
using namespace std;
char a[10][10];
int black[65];
int ...]]></description><category></category></item><item><title><![CDATA[习题4-2 UVA201正方形]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/99696109</link><guid>https://blog.youkuaiyun.com/rain699/article/details/99696109</guid><author>rain699</author><pubDate>Sat, 17 Aug 2019 17:53:15 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
using namespace std;
int n,m,sum,flag;
int doti,dotj;
int tim=1;
char c;
struct node
{
    int heng;
    int zong;
}a[10][10];
...]]></description><category></category></item><item><title><![CDATA[例题4-5 UVA512追踪电子表格中的单元格]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/99690913</link><guid>https://blog.youkuaiyun.com/rain699/article/details/99690913</guid><author>rain699</author><pubDate>Sat, 17 Aug 2019 11:32:45 +0800</pubDate><description><![CDATA[思路一：首先进行模拟操作，算出最后的整个电子表格，然后每次查询时直接在电子表格中找到所求的单元格。

d[i][j]表示变化后的电子表格中坐标为i,j的单元格所存储的原来表格中的单元格坐标信息。

ans[i][j]表示原来坐标为i,j的单元格现在的位置。

代码：


#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstr...]]></description><category></category></item><item><title><![CDATA[例题4-1至例题4-4]]></title><link>https://blog.youkuaiyun.com/rain699/article/details/99683858</link><guid>https://blog.youkuaiyun.com/rain699/article/details/99683858</guid><author>rain699</author><pubDate>Fri, 16 Aug 2019 19:00:45 +0800</pubDate><description><![CDATA[例题4-1 UVA1339


#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
using namespace std;
char a[105];
char b[105];
int num1[26];
int num2[26];
int i,j,len...]]></description><category></category></item></channel></rss>