<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ang_Eric_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Ang_Eric_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ang_Eric_]]></copyright><item><title><![CDATA[洛谷 P1784 数独]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237871</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237871</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:45:55 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define inf 100000
using namespace std;
int t[15][15];
bool area[15][15],hang[15][15],lie[15]]></description><category></category></item><item><title><![CDATA[关于noip错误总结]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237607</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237607</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:19:16 +0800</pubDate><description><![CDATA[一、输出文件注释一定记得删去。

二、文件保存路径确保没问题。

三、注意某一句话是放在  if{}里面还是外面。

四、审题要认真，注意数据范围。

五、数组开多大不能超过内存限制。

六、代码结尾  return 0；。

七、倒序循环别忘了i--。

八、除法不能取模。

九、强制转化long long或取模 不能+=或-=。

十、long long 输]]></description><category></category></item><item><title><![CDATA[NOIP 2014 Day2 T2 寻找道路]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237605</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237605</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:18:41 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
vector  f[10005],g[10005];
queue  q;
int n,m,a,b,s,t,maxn;
int dis[1000]]></description><category></category></item><item><title><![CDATA[Codevs 1082]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237603</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237603</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:18:15 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define LL long long
using namespace std;
struct data
{
    int left,right;
    long long su]]></description><category></category></item><item><title><![CDATA[NOIP 2014 Day2 T1 无线网络发射器选址]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237596</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237596</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:17:43 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
int d,n,x,y,k,maxn,p;
int t[250][250];
int main()
{
    freopen ("wirel]]></description><category></category></item><item><title><![CDATA[NOIP 2012 Day1 T3 开车旅行]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237591</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237591</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:17:20 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const long long w=1000000000;
struct data{
    int no;
    long long sa,sb;
};
 ]]></description><category></category></item><item><title><![CDATA[NOIP 2011 Day1 T2 选择客栈]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237580</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237580</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:16:48 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct data{
    int sd,xf;
};
    data co[200005];
int n,k,p,ans,cnt,minn=21000]]></description><category></category></item><item><title><![CDATA[NOIP 2013 Day1 T3 货车运输]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237573</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237573</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:16:12 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct data
{
    int x,y,z;
};
    data tr[50005];
struct node
{
    int l,w;
}]]></description><category></category></item><item><title><![CDATA[NOIP 2012 Day2 T3 疫情控制]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237565</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237565</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:15:13 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct data
{
    int l;
    long long w;
};
    data k,need[50005];
vector  cit]]></description><category></category></item><item><title><![CDATA[NOIP 2011 Day2 T1 计算系数]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237562</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237562</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:14:34 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define LL long long
using namespace std;
const int mod=10007;
int a,b,k,n,m,ans,cnt;
int f[1005][100]]></description><category></category></item><item><title><![CDATA[NOIP 2008 T1 笨小猴]]></title><link>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237550</link><guid>https://blog.youkuaiyun.com/Ang_Eric_/article/details/52237550</guid><author>Ang_Eric_</author><pubDate>Thu, 18 Aug 2016 09:13:39 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
int cnt,minn=1000,maxn,k;
int su[105],ttt6[30];
bool vis[105];
char word1[105];
]]></description><category></category></item></channel></rss>