<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[touch_er的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/touch_er</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; touch_er]]></copyright><item><title><![CDATA[Code HDU - 5212 容斥]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/78152308</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/78152308</guid><author>touch_er</author><pubDate>Mon, 02 Oct 2017 20:15:41 +0800</pubDate><description><![CDATA[HDU - 5212 
http://acm.hdu.edu.cn/showproblem.php?pid=5212

容斥思想]]></description><category></category></item><item><title><![CDATA[Remember The Feeling 2017-09-27 21:15]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/78117371</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/78117371</guid><author>touch_er</author><pubDate>Wed, 27 Sep 2017 21:18:23 +0800</pubDate><description><![CDATA[反应过来莫比乌斯反演是啥意思


HDU
 6053 - TrickGCD [ 莫比乌斯函数,筛法分块 ]  | 2017 Multi-University Training Contest 2

题意：

    给出数列
 A[N]，问满足：

        1
 

        对任意(l,
 r) (1= 2 ;

    的
 B[N] 数列的个]]></description><category></category></item><item><title><![CDATA[1011 Regular polygon 6055之神奇的count与[]]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/76228634</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/76228634</guid><author>touch_er</author><pubDate>Fri, 28 Jul 2017 10:09:56 +0800</pubDate><description><![CDATA[map 重载[] 与 count 的速度比较 （ps 辣鸡[]）]]></description><category></category></item><item><title><![CDATA[HDU - 3912 Turn Right]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/65434851</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/65434851</guid><author>touch_er</author><pubDate>Thu, 23 Mar 2017 09:10:03 +0800</pubDate><description><![CDATA[Turn RightTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 1352    Accepted Submission(s): 462Problem Description 
This summer, ELT and his clas]]></description><category></category></item><item><title><![CDATA[HDU 5950 Recursive sequence]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52974168</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52974168</guid><author>touch_er</author><pubDate>Sun, 30 Oct 2016 20:56:59 +0800</pubDate><description><![CDATA[Recursive sequence
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 58    Accepted Submission(s): 39



Problem Description

Farmer John]]></description><category></category></item><item><title><![CDATA[UVa 11374 - Airport Express]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52770286</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52770286</guid><author>touch_er</author><pubDate>Sun, 09 Oct 2016 20:48:06 +0800</pubDate><description><![CDATA[https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=25&problem=2369&mosmsg=Submission+received+with+ID+18149228


迪杰斯特拉题 不算模板但是很可以练出来模板的使用技巧
问题是求有一条捷径可]]></description><category></category></item><item><title><![CDATA[poj 2155 Matrix]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52173866</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52173866</guid><author>touch_er</author><pubDate>Wed, 10 Aug 2016 16:45:28 +0800</pubDate><description><![CDATA[poj 2155 Matrix

Matrix
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 24715 Accepted: 9156
Description


Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the]]></description><category></category></item><item><title><![CDATA[spij MATSUM - Matrix Summation]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52144685</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52144685</guid><author>touch_er</author><pubDate>Sun, 07 Aug 2016 20:41:00 +0800</pubDate><description><![CDATA[MATSUM - Matrix Summation


no tags 



A N × N matrix is filled with numbers. BuggyD is analyzing the matrix, and he wants the sum of certain submatrices every now and then, so he wants a syst]]></description><category></category></item><item><title><![CDATA[树状数组，模板 注意事项]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52137213</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52137213</guid><author>touch_er</author><pubDate>Sat, 06 Aug 2016 16:57:58 +0800</pubDate><description><![CDATA[///////////////////记得按 for(int i = 1;i <= 10;i++)
///////////////////不要按 for(int i = 0;i 不能有下标为0的。。。下标 会TLE
//是加val的值 不是更新成val的值！！！



#include
#include
#include
#include
#include
#include
using]]></description><category></category></item><item><title><![CDATA[An Easy Problem?! poj 2826 一道全是坑点的题！！！]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52047631</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52047631</guid><author>touch_er</author><pubDate>Wed, 27 Jul 2016 17:27:32 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=2826



An Easy Problem?!




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 12059
 
Accepted: 1836





Description

It's raining out]]></description><category></category></item><item><title><![CDATA[HDU5120 Intersection 相交环总面积 (2014北京现场赛) 两圆香蕉模板]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52016068</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52016068</guid><author>touch_er</author><pubDate>Sun, 24 Jul 2016 20:39:33 +0800</pubDate><description><![CDATA[HDU5120 Intersection 相交环总面积 (2014北京现场赛)





Description

Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples]]></description><category></category></item><item><title><![CDATA[Rotating Scoreboard]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/52012963</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/52012963</guid><author>touch_er</author><pubDate>Sun, 24 Jul 2016 10:59:32 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=3335



Rotating Scoreboard




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 6555
 
Accepted: 2612





Description

This year, ACM/]]></description><category></category></item><item><title><![CDATA[线段香蕉]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51999542</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51999542</guid><author>touch_er</author><pubDate>Fri, 22 Jul 2016 21:24:37 +0800</pubDate><description><![CDATA[判断两线段是否banana
包括 平面坐标计算








//http://blog.sina.com.cn/s/blog_71dbfe2e0101f7zb.html
//http://dev.gameres.com/Program/Abstract/Geometry.htm#矢量的概念


#include
#include
#include
#include
#inc]]></description><category></category></item><item><title><![CDATA[自带bfs输出最短步数的迷宫]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51995403</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51995403</guid><author>touch_er</author><pubDate>Fri, 22 Jul 2016 15:30:52 +0800</pubDate><description><![CDATA[exe下载


链接: http://pan.baidu.com/s/1c2mKwsK 密码: xhmp


#include
#include
#include
#include 
#include
#include
#include
#include
#include
#include
#include
using namespace std;



struct no
{
	in]]></description><category></category></item><item><title><![CDATA[2016 Multi-University Training Contest 2 Acperience]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51993378</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51993378</guid><author>touch_er</author><pubDate>Fri, 22 Jul 2016 11:47:48 +0800</pubDate><description><![CDATA[Acperience
http://acm.hdu.edu.cn/showproblem.php?pid=5734

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 513    Accepted Submission(s): 2]]></description><category></category></item><item><title><![CDATA[2016 Multi-University Training Contest 1 1011 tetrahedron 四面体内切圆]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51968316</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51968316</guid><author>touch_er</author><pubDate>Wed, 20 Jul 2016 14:56:14 +0800</pubDate><description><![CDATA[tetrahedron
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 408    Accepted Submission(s): 157



Problem Description

Given four point]]></description><category></category></item><item><title><![CDATA[猪数]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51921376</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51921376</guid><author>touch_er</author><pubDate>Fri, 15 Jul 2016 22:12:00 +0800</pubDate><description><![CDATA[A - 猪数
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d
 & %I64u
Submit Status Practice FZU
 1548




Description

在猪的世界里有一种数叫猪数，猪是这么定义猪数的：给定一个进制B(2
例如：B=10时，121就是一个猪数，]]></description><category></category></item><item><title><![CDATA[解救小Q]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51906204</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51906204</guid><author>touch_er</author><pubDate>Thu, 14 Jul 2016 09:24:26 +0800</pubDate><description><![CDATA[解救小Q
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=121832#problem/C

OR
http://acm.uestc.edu.cn/#/problem/show/149










小Q被邪恶的大魔王困在了迷宫里，love8909决定去解救她。
迷宫里面有一些陷阱，一旦走到陷阱里，就]]></description><category></category></item><item><title><![CDATA[L3-003. 社交集群]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51882753</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51882753</guid><author>touch_er</author><pubDate>Mon, 11 Jul 2016 17:43:44 +0800</pubDate><description><![CDATA[L3-003. 社交集群




时间限制

1000 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

陈越




在社交网络平台注册时，用户通常会输入自己的兴趣爱好，以便找到和自己兴趣相投的朋友。有部分兴趣相同的人们就形成了“社交集群”]]></description><category></category></item><item><title><![CDATA[L3-008. 喊山]]></title><link>https://blog.youkuaiyun.com/touch_er/article/details/51882733</link><guid>https://blog.youkuaiyun.com/touch_er/article/details/51882733</guid><author>touch_er</author><pubDate>Mon, 11 Jul 2016 17:41:00 +0800</pubDate><description><![CDATA[L3-008. 喊山



时间限制

150 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

陈越




喊山，是人双手围在嘴边成喇叭状，对着远方高山发出“喂—喂喂—喂喂喂……”的呼唤。呼唤声通过空气的传递，回荡于深谷之间，传送到人们耳中]]></description><category></category></item></channel></rss>