<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_43413621的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_43413621</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_43413621]]></copyright><item><title><![CDATA[Uva 12171 离散化加BFS]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88926078</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88926078</guid><author>weixin_43413621</author><pubDate>Sun, 31 Mar 2019 11:30:09 +0800</pubDate><description><![CDATA[对每一个长方体的坐标离散化处理 假想空气对空气bfs求联通
#include&lt;bits/stdc++.h&gt;
using namespace std;
const int maxn = 50 + 5;
const int maxc = 1000 + 1;
int n;
int x0[maxn], y0[maxn], z0[maxn], x1[maxn], y1[maxn], z1[max...]]></description><category></category></item><item><title><![CDATA[Uva221 离散化]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88912802</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88912802</guid><author>weixin_43413621</author><pubDate>Sat, 30 Mar 2019 15:04:54 +0800</pubDate><description><![CDATA[对于x而言无法对每个x枚举是否能看到建筑物 但是可以对每个相邻的x区间中枚举来判断是否能看到建筑物
#include &lt;bits/stdc++.h&gt;
using namespace std;
const int maxn = 100;
struct Building{
    int id;
    double x,y,w,d,h; // 左下角坐标、x方向宽、y方向宽、高度
   ...]]></description><category></category></item><item><title><![CDATA[数论概论第五章]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88746903</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88746903</guid><author>weixin_43413621</author><pubDate>Fri, 22 Mar 2019 17:44:45 +0800</pubDate><description><![CDATA[1，lcm(m,n)gcd(m,n) = mn
2, 3n+1算法总能回到1

]]></description><category></category></item><item><title><![CDATA[hdu1010(dfs+路径差奇偶剪枝]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88541681</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88541681</guid><author>weixin_43413621</author><pubDate>Wed, 13 Mar 2019 21:16:12 +0800</pubDate><description><![CDATA[Problem Description
The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea...]]></description><category></category></item><item><title><![CDATA[Uva10562(dfs递归看图写树]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88425818</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88425818</guid><author>weixin_43413621</author><pubDate>Tue, 12 Mar 2019 17:59:29 +0800</pubDate><description><![CDATA[#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
const int maxn = 200+10;
int n;
char buf[maxn][maxn];
void dfs(int r,int c)
{
    printf(&quot;%c(&quot;,buf[r][c]);
    if(r+1&amp;lt;n&amp;amp;&amp;amp;buf[r+1][c]=='|')...]]></description><category></category></item><item><title><![CDATA[HDU1116(有向图欧拉路判断]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88418824</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88418824</guid><author>weixin_43413621</author><pubDate>Tue, 12 Mar 2019 13:19:47 +0800</pubDate><description><![CDATA[#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
int edege[26][26],out[26],in[26],tag[26];
void dfs(int u)
{
    tag[u] = 1;
    for(int i =0;i&amp;lt;26;i++)
    {
        if(edege[u][i]&amp;amp;&amp;amp;tag[i...]]></description><category></category></item><item><title><![CDATA[Uva10305(有向图拓扑排序dfs]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88383753</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88383753</guid><author>weixin_43413621</author><pubDate>Sun, 10 Mar 2019 20:57:53 +0800</pubDate><description><![CDATA[#include&amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
const int maxn = 1000 + 5;
int a[maxn][maxn];//保存两边之间的关系
int c[maxn];
int topo[maxn];
int n, m, t;
bool dfs(int u){
    c[u] = -1;
    for(int v=1; v...]]></description><category></category></item><item><title><![CDATA[Uva 816(bfs求最短路)]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/88373166</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/88373166</guid><author>weixin_43413621</author><pubDate>Sat, 09 Mar 2019 23:21:09 +0800</pubDate><description><![CDATA[#include &amp;lt;bits/stdc++.h&amp;gt;
using namespace std;
struct Node{
    int r,c,dir;
    Node(int r=0, int c=0, int dir=0):r(r),c(c),dir(dir) {}
};
int have_edge[10][10][4][3];//当前状态 最后一维为是否可以沿着转弯的方向行走
i...]]></description><category></category></item><item><title><![CDATA[Uva 122 二叉树BFS]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/87971568</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/87971568</guid><author>weixin_43413621</author><pubDate>Wed, 27 Feb 2019 14:02:54 +0800</pubDate><description><![CDATA[ Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental t...]]></description><category></category></item><item><title><![CDATA[Uva679 (完全二叉树]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/87887832</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/87887832</guid><author>weixin_43413621</author><pubDate>Sat, 23 Feb 2019 00:40:16 +0800</pubDate><description><![CDATA[对于一个完全二叉树，节点k的左节点为2k,右节点为2k+1
对于第一个节点而言，编号I走过节点时，若I为奇数，则是向左走的第(I+1)/2个小球，当I为偶数时，是向右走的I/2个小球
对第二个节点也是如此
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
int main()
{
	int D,I;
	while(scanf(&quot;%d%d&quot;,&amp;amp;D,...]]></description><category></category></item><item><title><![CDATA[Uva 12657 （双向链表]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/87882661</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/87882661</guid><author>weixin_43413621</author><pubDate>Fri, 22 Feb 2019 17:26:13 +0800</pubDate><description><![CDATA[最后要求输出奇数位数的和，记录操作4的次数和n的奇偶即可表示出答案
用双向链表来表示关系
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
typedef long long ll;
int righta[100005],lefta[100005];
void link(int L,int R)   ...]]></description><category></category></item><item><title><![CDATA[处女座的签到题（求第k大个数]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/87866538</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/87866538</guid><author>weixin_43413621</author><pubDate>Thu, 21 Feb 2019 18:48:02 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/problem/21902
来源：牛客网
题目描述
平面上有n个点，问：平面上所有三角形面积第k大的三角形的面积是多少?
输入描述:
第一行T，表示样例的个数。
对于每一组样例，第一行两个整数n和k，
接下来n行，每行两个整数x,y表示点的坐标
T&amp;lt;=80
3&amp;lt;=n&amp;lt;=100
-109&amp;lt;=x,y&amp;lt;=109
...]]></description><category></category></item><item><title><![CDATA[cf Coffee and Coursework (Hard Version) 二分题]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/87798969</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/87798969</guid><author>weixin_43413621</author><pubDate>Wed, 20 Feb 2019 15:15:16 +0800</pubDate><description><![CDATA[D2. Coffee and Coursework (Hard Version)
time limit per test
2.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
The only difference between easy and hard versi...]]></description><category></category></item><item><title><![CDATA[uva 11988(链表题]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/87706380</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/87706380</guid><author>weixin_43413621</author><pubDate>Tue, 19 Feb 2019 14:08:09 +0800</pubDate><description><![CDATA[You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with the keyboard is that sometimes the “home” key or the “end” key gets automatically pressed (intern...]]></description><category></category></item><item><title><![CDATA[数论概论 第四章 高次幂之和和费马大定理]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/86766029</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/86766029</guid><author>weixin_43413621</author><pubDate>Tue, 05 Feb 2019 17:53:43 +0800</pubDate><description><![CDATA[费马大定理：对于方程an +bn =cn (n≥3时没有整数解)

]]></description><category></category></item><item><title><![CDATA[数论概率 第三章 勾股数组与单位圆]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/86765992</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/86765992</guid><author>weixin_43413621</author><pubDate>Tue, 05 Feb 2019 17:37:35 +0800</pubDate><description><![CDATA[1、单位圆上任意一个有理数点均可以表示为（1-m2 /1+m2 ,2m/1+m2）（除了（-1，0）其中m为任意有理数）
2、PPT（u2 -v2,2uv,u2 +v2）(gcd(u,v)=1,u和v一奇一偶，u＞v)
3、每一个平方三角数均可以用x2-2y2 = 1的正整数解来表示

...]]></description><category></category></item><item><title><![CDATA[数论概论 第二章 勾股数组]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/86765719</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/86765719</guid><author>weixin_43413621</author><pubDate>Tue, 05 Feb 2019 15:58:38 +0800</pubDate><description><![CDATA[本原勾股数组（PPT）：
a2 +b2 =c2  (其中gcd(a,b,c)=1)
1、 a,b一奇一偶 c为偶数
2、 a,b,c可以表示为a=st b=(s2 -t2 )/2 c=(s2+t2)/2 其中s、t为奇数且gcd(s,t)=1
3、a,b中必有一个被3整除
4、a,b,c中必有一个被5整除
5、a为任意奇数 b为任意被4整出的偶数 c为被4除余1的素数
6、若c可以写为c=p1p2...]]></description><category></category></item><item><title><![CDATA[数论概论 第一章 什么是数论]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/86760865</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/86760865</guid><author>weixin_43413621</author><pubDate>Sun, 03 Feb 2019 20:02:41 +0800</pubDate><description><![CDATA[经典的数论问题：
1、勾股数组
2、an +bn =cn (n为正整数）
3、素数无穷
4、对于一个素数p≡1（mod4）则p可以表示为两个平方之和的形式
5、平方数n2         三角数n*(n+1)/2
6、孪生素数：相邻奇数均为素数

...]]></description><category></category></item><item><title><![CDATA[hdu2546 经典01背包问题]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/86645464</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/86645464</guid><author>weixin_43413621</author><pubDate>Fri, 25 Jan 2019 14:21:49 +0800</pubDate><description><![CDATA[Problem Description
电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。
某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。
Input
多组数据。对...]]></description><category></category></item><item><title><![CDATA[cf杂题777c(单调数阵预处理]]></title><link>https://blog.youkuaiyun.com/weixin_43413621/article/details/86560241</link><guid>https://blog.youkuaiyun.com/weixin_43413621/article/details/86560241</guid><author>weixin_43413621</author><pubDate>Sun, 20 Jan 2019 11:11:31 +0800</pubDate><description><![CDATA[题意：给你一个n*m的数阵 对于一行到另一行，若存在一列从上到下递减，则称之符合题意
The first line of the input contains two positive integers n and m (1 ≤ n·m ≤ 100 000) — the number of rows and the number of columns in the table respective...]]></description><category></category></item></channel></rss>