<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[AdventL的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/AdventL</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; AdventL]]></copyright><item><title><![CDATA[物联网实验一——Mixly 数码管时钟实验]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/102710034</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/102710034</guid><author>AdventL</author><pubDate>Wed, 23 Oct 2019 20:16:26 +0800</pubDate><description><![CDATA[#include &lt;SevenSegmentExtended.h&gt;
#include &lt;SevenSegmentTM1637.h&gt;

SevenSegmentExtended  display(7,3);
volatile int mm;
volatile int ss;

void setup(){
  ss = 0;
  mm = 0;
   display.be...]]></description><category></category></item><item><title><![CDATA[物联网实验二——Mixly按键控制LED灯]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/102709748</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/102709748</guid><author>AdventL</author><pubDate>Wed, 23 Oct 2019 20:02:47 +0800</pubDate><description><![CDATA[volatile boolean b1;
volatile boolean b2;
volatile boolean flag;

void setup(){
  flag = LOW;
  b1 = digitalRead(8);
  b2 = digitalRead(8);
  pinMode(8, INPUT_PULLUP);
  Serial.begin(9600);
  pinMo...]]></description><category></category></item><item><title><![CDATA[岭师OJ——1917（rabbits）]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/83753762</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/83753762</guid><author>AdventL</author><pubDate>Mon, 05 Nov 2018 17:54:58 +0800</pubDate><description><![CDATA[
1917: Rabbits

题目描述

兔子有很强的生育能力，1对成年兔子可以每月生出1对幼年兔子。并且m个月后，幼年兔子成长为成年兔子。

当m=2时，每月兔子的对数是一个Fibonacci序列。不过在m&amp;lt;&amp;gt;2时候问题就不是那么简单了。如果一开始只有1对成年兔子，你的任务是计算d个月后有多少对兔子。你可以假设这期间没有兔子死去。

输入

包含多个测试用例，每个测试用例在一行上是...]]></description><category></category></item><item><title><![CDATA[杭电acm——2553（N皇后问题）]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/83473896</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/83473896</guid><author>AdventL</author><pubDate>Sun, 28 Oct 2018 13:11:13 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;math.h&amp;gt;
#include&amp;lt;cstring&amp;gt;
int x[15],y[15],z[15],n,k;
bool isRQ(int m)
{
	int i=1;
	while(i&amp;lt;m)
	{
		if(x[i]==x[m]||abs(x[i]-x[m])=...]]></description><category></category></item><item><title><![CDATA[杭电acm——2052]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/83239253</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/83239253</guid><author>AdventL</author><pubDate>Sun, 21 Oct 2018 09:40:07 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
using namespace std;

int main()
{
	int n,m;
	while(cin&amp;gt;&amp;gt;n&amp;gt;&amp;gt;m)
	{
		cout&amp;lt;&amp;lt;&quot;+&quot;;
		for(int i=0;i&amp;lt;n;i++)
			cout&amp;lt;&amp;lt;&quot;-&quot;;
		cout&amp;lt;&amp;lt;&]]></description><category></category></item><item><title><![CDATA[杭电acm——1034]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/83178223</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/83178223</guid><author>AdventL</author><pubDate>Fri, 19 Oct 2018 10:58:52 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
using namespace std;

int isok(int candy[],int N)
{
	int i,flag=0;
	for(i=N-1;i&amp;gt;0;i--)
	{
		if(candy[i]==candy[i-1])
			flag++;
	}
	if(flag==N-1) 
		return 0;
	else 
		ret...]]></description><category></category></item><item><title><![CDATA[杭电acm——1062]]></title><link>https://blog.youkuaiyun.com/AdventL/article/details/83178145</link><guid>https://blog.youkuaiyun.com/AdventL/article/details/83178145</guid><author>AdventL</author><pubDate>Fri, 19 Oct 2018 10:56:33 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;string&amp;gt;
#include&amp;lt;cstring&amp;gt;
using namespace std;

int main()
{
	int N;
	cin&amp;gt;&amp;gt;N;
	getchar();
	while(N--)
	{
		int m=0;
		string str;
		getline(cin,str...]]></description><category></category></item></channel></rss>