<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kyoma的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/kyoma</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; kyoma]]></copyright><item><title><![CDATA[北京邮电大学 2018 北邮 互联网应用课程设计 大作业 DNS域名解析]]></title><link>https://blog.csdn.net/kyoma/article/details/99818657</link><guid>https://blog.csdn.net/kyoma/article/details/99818657</guid><author>kyoma</author><pubDate>Tue, 20 Aug 2019 09:41:38 +0800</pubDate><description><![CDATA[每年一定要经历的大作业....肝了两天写出来. 先看看18年的作业要求吧, 每年都不一样



	实现中文域名的解析，例如:主页.北邮.教育.中国(与 www.bupt.edu.cn 对应);
	
	
	至少支持 4 个顶级域，至少实现三级域名的解析。程序需要实现的实体有:client、 至少 6 个 DNS server。
	
	
	支持的 Resource Record 类型:A、MX、CNA...]]></description><category></category></item><item><title><![CDATA[[kuangbin带你飞]专题二 搜索进阶 题解（康托展开、映射、迭代加深）]]></title><link>https://blog.csdn.net/kyoma/article/details/78595768</link><guid>https://blog.csdn.net/kyoma/article/details/78595768</guid><author>kyoma</author><pubDate>Fri, 01 Dec 2017 15:22:49 +0800</pubDate><description><![CDATA[专题链接



A:Eight

经典的八数码问题，这题直接bfs是不行的，时限不够，主要是在每个状态判重的时候使用map，在这里的复杂度可以通过康托展开来达到查重O（1），那么！什么是康托展开呢？！ 
我觉得这个博客写的很好，总之康托展开用来看当前状态中在全排列中是第几个，可以把问题的全部状态不用map来表示 
这题hdu是多组样例输入，poj则单组。 
本来网上写做这题要有八境界，把代码写八遍]]></description><category></category></item><item><title><![CDATA[2015 ICPC 北京场E、F、G （计算几何）]]></title><link>https://blog.csdn.net/kyoma/article/details/78664069</link><guid>https://blog.csdn.net/kyoma/article/details/78664069</guid><author>kyoma</author><pubDate>Wed, 29 Nov 2017 12:55:55 +0800</pubDate><description><![CDATA[E - Cats and Fish#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 105;
int c[N];
int tmp[N];
int main()
{
    int m, n, x;
    while(~scanf("%d %d %d", &m,]]></description><category></category></item><item><title><![CDATA[[待补完]CODE FESTIVAL 2017 Final (Parallel) A,B,C(搜索)]]></title><link>https://blog.csdn.net/kyoma/article/details/78635343</link><guid>https://blog.csdn.net/kyoma/article/details/78635343</guid><author>kyoma</author><pubDate>Sun, 26 Nov 2017 00:51:05 +0800</pubDate><description><![CDATA[比赛地址A - AKIBAxjb写#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
using namespace std;
char in[100];
int]]></description><category></category></item><item><title><![CDATA[Codeforces Round #444 (Div. 2) A、B、C]]></title><link>https://blog.csdn.net/kyoma/article/details/78538734</link><guid>https://blog.csdn.net/kyoma/article/details/78538734</guid><author>kyoma</author><pubDate>Wed, 15 Nov 2017 11:09:19 +0800</pubDate><description><![CDATA[题目链接A:#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const int maxn = 110;
char str[maxn];
int main]]></description><category></category></item><item><title><![CDATA[2016China Final 二分 UVALive7900(D)]]></title><link>https://blog.csdn.net/kyoma/article/details/78531617</link><guid>https://blog.csdn.net/kyoma/article/details/78531617</guid><author>kyoma</author><pubDate>Tue, 14 Nov 2017 16:08:20 +0800</pubDate><description><![CDATA[题目链接 
很简单的二分答案，为什么去年会做不出来呢。。。。哎。。#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const int maxn = 3e]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 31(ABCD):有向图求环长度／数据结构贪心]]></title><link>https://blog.csdn.net/kyoma/article/details/78428532</link><guid>https://blog.csdn.net/kyoma/article/details/78428532</guid><author>kyoma</author><pubDate>Thu, 02 Nov 2017 19:49:20 +0800</pubDate><description><![CDATA[比赛地址


  A. Book Reading 
  time limit per test2 seconds 
  memory limit per test256 megabytes 
  inputstandard input 
  outputstandard output 
  Recently Luba bought a very interesting book. She know]]></description><category></category></item><item><title><![CDATA[2017-2018 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2017) 部分题／平衡树／最小环／思路bfs]]></title><link>https://blog.csdn.net/kyoma/article/details/78397661</link><guid>https://blog.csdn.net/kyoma/article/details/78397661</guid><author>kyoma</author><pubDate>Mon, 30 Oct 2017 21:34:17 +0800</pubDate><description><![CDATA[交题地址

难度按照顺序递增

J - Judging Moose 
队友敲的



#include 
#include 
using namespace std;

int main()
{
   int l, r;
   while(~scanf("%d %d", &l, &r)){
    if(l == r && l != 0){
        printf("Even ");]]></description><category></category></item><item><title><![CDATA[Codeforces Round #443 (Div. 2) A、B、C 位运算]]></title><link>https://blog.csdn.net/kyoma/article/details/78365076</link><guid>https://blog.csdn.net/kyoma/article/details/78365076</guid><author>kyoma</author><pubDate>Fri, 27 Oct 2017 15:04:57 +0800</pubDate><description><![CDATA[A

题目链接


  A. Borya’s Diagnosis 
  time limit per test2 seconds 
  memory limit per test256 megabytes 
  inputstandard input 
  outputstandard output 
  It seems that Borya is seriously sick. He is g]]></description><category></category></item><item><title><![CDATA[noip 2010 关押罪犯 二分图]]></title><link>https://blog.csdn.net/kyoma/article/details/78336339</link><guid>https://blog.csdn.net/kyoma/article/details/78336339</guid><author>kyoma</author><pubDate>Tue, 24 Oct 2017 23:55:19 +0800</pubDate><description><![CDATA[题目链接
  题目描述
  
  S 城现有两座监狱，一共关押着N 名罪犯，编号分别为1~N。他们之间的关系自然也极不和谐。很多罪犯之间甚至积怨已久，如果客观条件具备则随时可能爆发冲突。我们用“怨气值”（一个正整数值）来表示某两名罪犯之间的仇恨程度，怨气值越大，则这两名罪犯之间的积怨越多。如果两名怨气值为c 的罪犯被关押在同一监狱，他们俩之间会发生摩擦，并造成影响力为c 的冲突事件。
  
  每年]]></description><category></category></item><item><title><![CDATA[CODE FESTIVAL 2017 qual B:C - 3 Steps 并查集判二分图、二分图性质]]></title><link>https://blog.csdn.net/kyoma/article/details/78336304</link><guid>https://blog.csdn.net/kyoma/article/details/78336304</guid><author>kyoma</author><pubDate>Tue, 24 Oct 2017 23:48:19 +0800</pubDate><description><![CDATA[题目链接 
题意：给一个连通的无向图，让我们往距离为三的两个不同的点添加一条边，问最终能够添加多少条边 
比赛时做的没想法，官方题解讲得很清楚假设在ss和t之间存在一条长度为奇数的路径，也就是说对于某个奇数t之间存在一条长度为奇数的路径，也就是说对于某个奇数k，存在一个点的序列，存在一个点的序列s=v0,v1,...,vk=t=v_0,v_1,...,v_k=t（viv_i和vi+1v_{i+1}相]]></description><category></category></item><item><title><![CDATA[2017ACM-ICPC沈阳站流水账]]></title><link>https://blog.csdn.net/kyoma/article/details/78333752</link><guid>https://blog.csdn.net/kyoma/article/details/78333752</guid><author>kyoma</author><pubDate>Tue, 24 Oct 2017 20:01:56 +0800</pubDate><description><![CDATA[打铁打铁打铁打铁打铁了！
这次去程坐飞机，zhangjiatao1因为要选举副主席所以没有同我、阿姨一起出发。周五蹭了一节微机课（孤单地）后就拉上行李箱出发，坐s1线的时候感觉要回家了。。阿姨是第一次坐飞机，超级紧张吧大概，因为zhangjitao1没来，所以没有特别表现出来，我也不知道她心里到底多紧张。在平民机场大巴上遇见了背着google包、全身上下散发着“我是Acmer”的大佬，大概是南大]]></description><category></category></item><item><title><![CDATA[某同学的期末大作业 UNO的简单实现]]></title><link>https://blog.csdn.net/kyoma/article/details/78220087</link><guid>https://blog.csdn.net/kyoma/article/details/78220087</guid><author>kyoma</author><pubDate>Thu, 12 Oct 2017 21:28:28 +0800</pubDate><description><![CDATA[这破玩意儿写了好久，代码又长又丑。
实在是拿不出手的东西。。。。而且估计还是有很多bug，从老哥结婚准备那天开始零零散散地写到现在，果然写代码战线拖太长不行啊。。。。
姑且写了很长， 在这里放出来
首先这是他们老师放出来的.h，代码之所以很乱也有原因是要实现他们老师要求的function！！！（其实是自己菜吧）]]></description><category></category></item><item><title><![CDATA[Hdu4819 Mosaic 二维线段树维护区间最值+单点更新]]></title><link>https://blog.csdn.net/kyoma/article/details/78152024</link><guid>https://blog.csdn.net/kyoma/article/details/78152024</guid><author>kyoma</author><pubDate>Mon, 02 Oct 2017 18:49:30 +0800</pubDate><description><![CDATA[Mosaic
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)
Total Submission(s): 2077    Accepted Submission(s): 927



Problem Description

The God of sheep ]]></description><category></category></item><item><title><![CDATA[hdu5091 线段树扫描线]]></title><link>https://blog.csdn.net/kyoma/article/details/78149651</link><guid>https://blog.csdn.net/kyoma/article/details/78149651</guid><author>kyoma</author><pubDate>Mon, 02 Oct 2017 01:31:33 +0800</pubDate><description><![CDATA[Recently, the γ galaxies broke out Star Wars. Each planet is warring for resources. In the Star Wars, Planet X is under attack by other planets. Now, a large wave of enemy spaceships is approaching. T]]></description><category></category></item><item><title><![CDATA[时隔一年的再开 紫书Uva1589 象棋 模拟]]></title><link>https://blog.csdn.net/kyoma/article/details/78136559</link><guid>https://blog.csdn.net/kyoma/article/details/78136559</guid><author>kyoma</author><pubDate>Fri, 29 Sep 2017 18:57:12 +0800</pubDate><description><![CDATA[Xiangqi




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 1668
 
Accepted: 421





Description

Xiangqi is one of the most popular two-player board games in China]]></description><category></category></item><item><title><![CDATA[UVA548 中序后序构造二叉树]]></title><link>https://blog.csdn.net/kyoma/article/details/70302624</link><guid>https://blog.csdn.net/kyoma/article/details/70302624</guid><author>kyoma</author><pubDate>Thu, 20 Apr 2017 20:08:41 +0800</pubDate><description><![CDATA[详见字书p157
代码：
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn = 10010;
const int inf = 0x3f3f3f3f;
int n;
int inOrder[maxn],postOrder[maxn];]]></description><category></category></item><item><title><![CDATA[用自己mac装tomcat/mySQL遇到的各种问题]]></title><link>https://blog.csdn.net/kyoma/article/details/66970939</link><guid>https://blog.csdn.net/kyoma/article/details/66970939</guid><author>kyoma</author><pubDate>Mon, 27 Mar 2017 13:58:33 +0800</pubDate><description><![CDATA[写第一个简答的jsp页面就报错了。。。各种语法问题。。。这玩意儿有没有啥集成开发环境啊。。。
做虚拟目录的时候也有问题。。。以后如果想新加什么东西的话，绝对路径要这么写：/Users/user/Documents才访问得到]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 056 题解挖坑]]></title><link>https://blog.csdn.net/kyoma/article/details/65660937</link><guid>https://blog.csdn.net/kyoma/article/details/65660937</guid><author>kyoma</author><pubDate>Fri, 24 Mar 2017 22:19:28 +0800</pubDate><description><![CDATA[待补完]]></description><category></category></item><item><title><![CDATA[HHU2017杂题训练（一）]]></title><link>https://blog.csdn.net/kyoma/article/details/65660134</link><guid>https://blog.csdn.net/kyoma/article/details/65660134</guid><author>kyoma</author><pubDate>Fri, 24 Mar 2017 22:15:23 +0800</pubDate><description><![CDATA[来自zyyyyy的留言：久远的浙大机试题...


A - 找出直系亲属
 



如果A，B是C的父母亲，则A，B是C的parent，C是A，B的child，如果A，B是C的（外）祖父，祖母，则A，B是C的grandparent，C是A，B的grandchild，如果A，B是C的（外）曾祖父，曾祖母，则A，B是C的great-grandparent，C是A，B的great-gra]]></description><category></category></item></channel></rss>