<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_36039136的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_36039136</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_36039136]]></copyright><item><title><![CDATA[火 车 票 管 理 系 统]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/82262370</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/82262370</guid><author>qq_36039136</author><pubDate>Fri, 31 Aug 2018 21:39:18 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;fstream&amp;gt;
#include &amp;lt;string&amp;gt;
#include&amp;lt;time.h&amp;gt;
using namespace std;
void welcome();                          //欢迎
void choose();                    ...]]></description><category></category></item><item><title><![CDATA[图书管理系统]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/80381442</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/80381442</guid><author>qq_36039136</author><pubDate>Sun, 20 May 2018 12:48:53 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
#include &amp;lt;time.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include&amp;lt;conio.h&amp;gt;
typedef int BOOL;
typedef struct bookinfo
{
	char number[15];/*产品编号*/
	char...]]></description><category></category></item><item><title><![CDATA[C++ 链表栈及常用函数实现]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/79671865</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/79671865</guid><author>qq_36039136</author><pubDate>Fri, 23 Mar 2018 19:44:34 +0800</pubDate><description><![CDATA[#include&amp;lt;iostream&amp;gt;
using namespace std;
typedef struct Node
{
	int data;
	struct Node* next;
}Node;
typedef struct Stack
{
	Node* top;
	Node* head;
}Stack;
void init(Stack &amp;amp;S);
void push(Sta...]]></description><category></category></item><item><title><![CDATA[打字小游戏（天降字母）Visual Studio+EasyX]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/78916150</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/78916150</guid><author>qq_36039136</author><pubDate>Wed, 27 Dec 2017 20:37:16 +0800</pubDate><description><![CDATA[
 


#include &amp;lt;graphics.h&amp;gt;
#include &amp;lt;conio.h&amp;gt;
#include &amp;lt;time.h&amp;gt;
#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;windows.h&amp;gt;
#pragma  comment(l]]></description><category></category></item><item><title><![CDATA[[C语言入门题] 八皇后问题]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/78796451</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/78796451</guid><author>qq_36039136</author><pubDate>Wed, 13 Dec 2017 20:33:01 +0800</pubDate><description><![CDATA[#include  
int ok(int k); 
void p(int i);
int x[8]; 
int a; int sum;
int main()
{
    //int a;
    while (scanf("%d", &a) != EOF)
    {
        sum = 0;
        p(0);
         
    }
}]]></description><category></category></item><item><title><![CDATA[[C语言入门题]1~n全排列]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/78762804</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/78762804</guid><author>qq_36039136</author><pubDate>Sun, 10 Dec 2017 00:44:00 +0800</pubDate><description><![CDATA[题目描述


大家高中都学过全排列。例如，1,2,3三个数进行全排列，其结果为(1,2,3)(1,3,2)(2,1,3)(2,3,1)(3,1,2)(3,2,1)。现在，给你数字n，请你列出数1,2,3...,n的全排列。输出顺序应该按照字典序输出。即对于两个排列，先比较第一位，第一位小的排前面，如果相等，再比较第二位，以此类推。例：(1,2,3)排在(1,3,2)前面。




]]></description><category></category></item><item><title><![CDATA[[C语言入门题]小孟逆序作文]]></title><link>https://blog.youkuaiyun.com/qq_36039136/article/details/78602313</link><guid>https://blog.youkuaiyun.com/qq_36039136/article/details/78602313</guid><author>qq_36039136</author><pubDate>Wed, 22 Nov 2017 12:46:55 +0800</pubDate><description><![CDATA[题目描述


小孟写作文很奇怪，每个单词都是逆序的。请你帮他翻译。




输入


以#表示小孟作文开始，随后是其作文，随后#表示作文结束。




输出


翻译之后的作文。



样例输入
#
!dlrow olleh
#
#
gnem
oaix
#

样例输出
world! hello
meng
xiao

提示




]]></description><category></category></item></channel></rss>