<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[s136424的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/s136424</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; s136424]]></copyright><item><title><![CDATA[7-6 数制转换（2014奉化初中组） （100 分）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/82818306</link><guid>https://blog.youkuaiyun.com/s136424/article/details/82818306</guid><author>s136424</author><pubDate>Sat, 22 Sep 2018 22:27:36 +0800</pubDate><description><![CDATA[输入一个十六进制正整数s，将s转换成八进制数后输出。

输入格式:

只有一行且只有一个十六进制正整数：s

输出格式:

只有一行且只有一个转换后的八进制整数

输入样例:


3D59


输出样例:


36531


【数据规模】 30% 的数据: 1 &amp;lt;= s的长度 &amp;lt;= 10
70% 的数据: 1 &amp;lt;= s的长度 &amp;lt;= 100
100% 的数据: 1 &amp;lt;=...]]></description><category></category></item><item><title><![CDATA[蝴蝶效应]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/79261577</link><guid>https://blog.youkuaiyun.com/s136424/article/details/79261577</guid><author>s136424</author><pubDate>Thu, 08 Feb 2018 09:08:59 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[爬虫程序提取信息（统计符合条件的文件数量）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/79203717</link><guid>https://blog.youkuaiyun.com/s136424/article/details/79203717</guid><author>s136424</author><pubDate>Tue, 30 Jan 2018 11:21:28 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[动态规划基础练习题]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/79030772</link><guid>https://blog.youkuaiyun.com/s136424/article/details/79030772</guid><author>s136424</author><pubDate>Thu, 11 Jan 2018 10:55:44 +0800</pubDate><description><![CDATA[题1：输入一个数，作为楼梯的台阶数。一次只能走一级台阶或者两级台阶。输出从下往上走楼梯总共有多少种走法?
我的代码：
#include
using namespace std;
int main()
{
	int n,a[1001]={1,2},i;
	cin>>n;
	if(n==1) cout<<a[0]<<endl;
	else if(n==2) cout<<a[1]<<endl;
	e]]></description><category></category></item><item><title><![CDATA[1080. MOOC期终成绩 (25)]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/79001605</link><guid>https://blog.youkuaiyun.com/s136424/article/details/79001605</guid><author>s136424</author><pubDate>Mon, 08 Jan 2018 12:51:16 +0800</pubDate><description><![CDATA[1080. MOOC期终成绩 (25)



时间限制

100 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




对于在中国大学MOOC（http://www.icourse163.org/）学习“数据结构”课程的]]></description><category></category></item><item><title><![CDATA[双指针法的常见应用]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78950800</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78950800</guid><author>s136424</author><pubDate>Tue, 02 Jan 2018 15:54:46 +0800</pubDate><description><![CDATA[例：将一个排为升序的数组中找到两个满足条件的数，和为一个定值。如果有多对，输出一对即可。#include
#include
using namespace std;
int main()
{
	int n,num,a[101],i;
	cin>>n>>num;
	for(i=0;i>a[i];
	sort(a,a+n);
	int start=0,end=n-1;
	while(start<end]]></description><category></category></item><item><title><![CDATA[判断一个自然数是否是某个数的平方（不能使用开方运算）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78943276</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78943276</guid><author>s136424</author><pubDate>Sun, 31 Dec 2017 21:14:50 +0800</pubDate><description><![CDATA[解决方法：二分查找法（对1到x之间的数字进行判断）。
我的代码：
#include
int binarysearch(int a[],int low,int high,int x)
{
	int middle;
	while(low<=high)
	{
		middle=(low+high)/2;
		if(x==a[middle]*a[middle]) return a[middle];
	]]></description><category></category></item><item><title><![CDATA[二分查找]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78940598</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78940598</guid><author>s136424</author><pubDate>Sun, 31 Dec 2017 08:37:55 +0800</pubDate><description><![CDATA[递归：
#include
using namespace std;
void bubblesort(int a[],int n)
{
	int i,j,t;
	for(i=n-1;i>=0;i--)
	{
		int flag=0;
		for(j=0;j<i;j++)
		{
			if(a[j]>a[j+1])
			{
				t=a[j];
				a[j]=a[j+1];
				a[]]></description><category></category></item><item><title><![CDATA[自定义stack]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78915020</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78915020</guid><author>s136424</author><pubDate>Wed, 27 Dec 2017 18:08:42 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
template
class stack
{
	private:
		T *t;
		int len,top;
	public:
		stack(int n=10)
		{
			t=new T[len=n];
			top=0;
		}
		~stack(){delete []t;}
		bool empty()
		]]></description><category></category></item><item><title><![CDATA[链表的创建插入删除]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78901069</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78901069</guid><author>s136424</author><pubDate>Tue, 26 Dec 2017 13:09:47 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
struct node
{
	int data;
	node *next;
};
node* creat()
{
	node *head,*tail,*p;
	int x;
	head=tail=new node;
	while(scanf("%d",&x),x!=-1)
	{
		p=new node;
		p->da]]></description><category></category></item><item><title><![CDATA[C++面试题（自定义string类，重载运算符）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78885573</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78885573</guid><author>s136424</author><pubDate>Sun, 24 Dec 2017 16:16:29 +0800</pubDate><description><![CDATA[#include
#include
class String
{
private:
	char *str;
public:
	String(char *s="")
	{
		str=new char[strlen(s)+1];
		strcpy(str,s);
	}
	/*String(const String& s)
	{
		int len=strlen(s.str);
		str=new c]]></description><category></category></item><item><title><![CDATA[字符串的比较&&拷贝&&合并]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78882006</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78882006</guid><author>s136424</author><pubDate>Sat, 23 Dec 2017 20:30:17 +0800</pubDate><description><![CDATA[#include
int strcmp(char a[],char b[])
{
	int i=0;
	while(a[i]==b[i] && a[i]!='\0') i++;
	return a[i]-b[i];
}
char *strcpy(char a[],char b[])
{
	int i;
	for(i=0;b[i];i++) a[i]=b[i];
	a[i]='\0';
	retur]]></description><category></category></item><item><title><![CDATA[2017年冬季浙大PAT真题（附本人代码）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78778033</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78778033</guid><author>s136424</author><pubDate>Tue, 12 Dec 2017 09:51:48 +0800</pubDate><description><![CDATA[ 

1076. Wifi密码 (15)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

8000 B

判题程序

Standard

作者

CHEN, Yue

下面是微博上流传的一张照片：“各位亲爱的同学们，鉴于大家有时需要使用wifi，又怕耽误亲们的学习，现将wifi密码设置为下列数学题答案：A-1；B-2；C-3；D-4；请同学们自己作答，每两日一换。谢谢...]]></description><category></category></item><item><title><![CDATA[7-50 装箱问题（20 分）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78747131</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78747131</guid><author>s136424</author><pubDate>Thu, 07 Dec 2017 23:05:48 +0800</pubDate><description><![CDATA[假设有N项物品，大小分别为s​1​​、s​2​​、…、s​i​​、…、s​N​​，其中s​i​​为满足1的整数。要把这些物品装入到容量为100的一批箱子（序号1-N）中。装箱方法是：对每项物品,
 顺序扫描箱子，把该物品放入足以能够容下它的第一个箱子中。请写一个程序模拟这种装箱过程，并输出每个物品所在的箱子序号，以及放置全部物品所需的箱子数目。

输入格式：

输入第一行给出物品个数N（]]></description><category></category></item><item><title><![CDATA[有假币]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78741963</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78741963</guid><author>s136424</author><pubDate>Thu, 07 Dec 2017 15:30:24 +0800</pubDate><description><![CDATA[题目描述
居然有假币！ 现在猪肉涨了，但是农民的工资却不见涨啊，没钱怎么买猪肉啊。nowcoder这就去买猪肉，结果找来的零钱中有假币！！！可惜nowcoder一不小心把它混进了一堆真币里面去了。只知道假币的重量比真币的质量要轻，给你一个天平（天平两端能容纳无限个硬币），请用最快的时间把那个可恶的假币找出来。


输入描述:
1≤n≤2^30,输入0结束程序。



输出描述:]]></description><category></category></item><item><title><![CDATA[送外卖]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78741838</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78741838</guid><author>s136424</author><pubDate>Thu, 07 Dec 2017 15:23:04 +0800</pubDate><description><![CDATA[题目描述
冬天到了，小伙伴们都懒得出去吃饭了，纷纷打电话叫起了外卖。送外卖的小哥想找出一条最短的路径，小区门口进来，送完外卖又回到小区门口。

整个小区是一个由m*n个边长为1的正方形组成的矩形，各幢公寓楼分布于正方型的顶点上，小区门口位于左上角。每幢楼与相邻的八个方向的楼之间都有道路。

下图为m=2，n=3的小区地图，并且外卖小哥要经过的最短路径为6。


输入描述:
输入有多组数据]]></description><category></category></item><item><title><![CDATA[7-50 猴子选大王（20 分）]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78697000</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78697000</guid><author>s136424</author><pubDate>Sat, 02 Dec 2017 18:07:46 +0800</pubDate><description><![CDATA[一群猴子要选新猴王。新猴王的选择方法是：让N只候选猴子围成一圈，从某位置起顺序编号为1~N号。从第1号开始报数，每轮从1报到3，凡报到3的猴子即退出圈子，接着又从紧邻的下一只猴子开始同样的报数。如此不断循环，最后剩下的一只猴子就选为猴王。请问是原来第几号猴子当选猴王？

输入格式：

输入在一行中给一个正整数N（≤1000）。

输出格式：

在一行中输出当选猴王的编号。

输]]></description><category></category></item><item><title><![CDATA[L3-015. 球队“食物链”]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78682882</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78682882</guid><author>s136424</author><pubDate>Fri, 01 Dec 2017 08:37:09 +0800</pubDate><description><![CDATA[L3-015. 球队“食物链”



时间限制

1000 ms




内存限制

262144 kB




代码长度限制

8000 B




判题程序

Standard


作者

李文新（北京大学）




某国的足球联赛中有N支参赛球队，编号从1至N。联赛采用主客场双循环赛制，参赛球队两两之间在双方主场各赛一]]></description><category></category></item><item><title><![CDATA[Shopping in Mars (25)]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78679310</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78679310</guid><author>s136424</author><pubDate>Thu, 30 Nov 2017 18:31:03 +0800</pubDate><description><![CDATA[题目描述
Shopping in Mars is quite a different experience.  The Mars people pay by chained diamonds.  Each diamond has a value (in Mars dollars M$).  When making the payment, the chain can be cut at any]]></description><category></category></item><item><title><![CDATA[Find Coins (25)]]></title><link>https://blog.youkuaiyun.com/s136424/article/details/78679257</link><guid>https://blog.youkuaiyun.com/s136424/article/details/78679257</guid><author>s136424</author><pubDate>Thu, 30 Nov 2017 18:22:36 +0800</pubDate><description><![CDATA[题目描述
Eva loves to collect coins from all over the universe, including some other planets like Mars.  One day she visited a universal shopping mall which could accept all kinds of coins as payments.]]></description><category></category></item></channel></rss>