<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[yuxuanmochen的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/yuxuanmochen</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; yuxuanmochen]]></copyright><item><title><![CDATA[杭电--2069--Coin_Change(简单枚举题)]]></title><link>https://blog.youkuaiyun.com/yuxuanmochen/article/details/69815577</link><guid>https://blog.youkuaiyun.com/yuxuanmochen/article/details/69815577</guid><author>yuxuanmochen</author><pubDate>Sun, 09 Apr 2017 14:39:49 +0800</pubDate><description><![CDATA[原题链接！#include <stdio.h>  
int main()  
{  
    int n;  
    while(~scanf("%d", &n))   
    {  
        int ans = 0;  
        for(int a=0; a<=5; a++)               // 50
          for(int b=0; b<=10-2*]]></description><category></category></item><item><title><![CDATA[#杭电--2566--统计硬币(简单枚举)]]></title><link>https://blog.youkuaiyun.com/yuxuanmochen/article/details/69810764</link><guid>https://blog.youkuaiyun.com/yuxuanmochen/article/details/69810764</guid><author>yuxuanmochen</author><pubDate>Sun, 09 Apr 2017 14:16:56 +0800</pubDate><description><![CDATA[[](http://acm.hdu.edu.cn/showproblem.php?pid=2566%20%20%20%20%20%20here!) 
”’include “stdio.h”int main() 
{ 
    int T; 
    scanf(“%d”, &T); 
    while(T–) 
    { 
        int ans = 0; 
        int n,]]></description><category></category></item><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/yuxuanmochen/article/details/69809663</link><guid>https://blog.youkuaiyun.com/yuxuanmochen/article/details/69809663</guid><author>yuxuanmochen</author><pubDate>Sun, 09 Apr 2017 14:14:42 +0800</pubDate><description><![CDATA[欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来，用它写博客，将会带来全新的体验哦：
Markdown和扩展Markdown简洁的语法
代码块高亮
图片链接和图片上传
LaTex数学公式
UML序列图和流程图
离线写博客
导入导出Markdown文件
丰富的快捷键
快捷键
加粗    Ctrl + B 
斜体    Ctrl + I 
引用    Ctrl]]></description><category></category></item><item><title><![CDATA[HDU 2012 素数判定]]></title><link>https://blog.youkuaiyun.com/yuxuanmochen/article/details/61424905</link><guid>https://blog.youkuaiyun.com/yuxuanmochen/article/details/61424905</guid><author>yuxuanmochen</author><pubDate>Sat, 11 Mar 2017 19:34:59 +0800</pubDate><description><![CDATA[#include
#include

const int maxn = 10000+10;
int a[maxn];

int main()
{
	int x, y;
	while(scanf("%d%d", &x, &y) != EOF && (x !=0 || y != 0))
	{
		memset(a,-1,sizeof(a));                //-]]></description><category></category></item></channel></rss>