<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Missan的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Missan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Missan]]></copyright><item><title><![CDATA[1091. Acute Stroke (30)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42680589</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42680589</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 19:12:33 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

#define NONE 0xffffffff

unsigned int slice[60][1286][128] = {{{}}};
unsigned int m, n, l, t;

inline unsigned int root(unsigned int i, un]]></description><category></category></item><item><title><![CDATA[1090. Highest Price in Supply Chain (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42679989</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42679989</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 18:26:37 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int dist(int n, int rid[], int dc[]) {
	if(rid[n] != -1 && !dc[n]) {
		dc[n] = dist(rid[n], rid, dc) + 1;
	}
	return dc[n];
}

#define N 100000

int]]></description><category></category></item><item><title><![CDATA[1089. Insert or Merge (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42679875</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42679875</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 18:15:34 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100

int main(int argc, char **argv) {
	int n;
	cin >> n;

	int a[2][N] = {{}};
	for(int i = 0; i < 2; i ++)]]></description><category></category></item><item><title><![CDATA[1088. Rational Arithmetic (20)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42678347</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42678347</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 16:29:39 +0800</pubDate><description><![CDATA[import java.math.BigInteger;
import java.util.Scanner;
import java.util.regex.MatchResult;

class Rational {
	BigInteger n, d;
}

public class Main {
	
	public static Rational add(Rational r1, Rationa]]></description><category></category></item><item><title><![CDATA[1087. All Roads Lead to Rome (30)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42677551</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42677551</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 15:42:43 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

inline int id(char str[]) {
	int n = 0;
	for(int i = 0; i < 3; i ++) {
		n *= 26;
		n += (str[i] - 'A');
	}
	return n;]]></description><category></category></item><item><title><![CDATA[1086. Tree Traversals Again (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42674705</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42674705</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 11:56:11 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

struct node {
	int key;
	node *left, *right;
};

struct command {
	int type;
	int key;
};

node * create(command cmd[], int &index, int n)]]></description><category></category></item><item><title><![CDATA[1085. Perfect Sequence (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42673977</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42673977</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 11:11:27 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

#define N 100000

int main(int argc, char **argv) {
	int n, p;
	cin >> n >> p;

	long long seq[N] = {};
	for(int i = 0; i < n; i ++) {
		s]]></description><category></category></item><item><title><![CDATA[1084. Broken Keyboard (20)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42673501</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42673501</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 10:49:22 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int main(int argc, char **argv) {
	char line1[100], line2[100];
	gets(line1);
	gets(line2);

	bool out[128] = {}, miss[128] = {};
	for(char *p = lin]]></description><category></category></item><item><title><![CDATA[1083. List Grades (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42673337</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42673337</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 10:40:16 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;

struct record {
	char name[11];
	char id[11];
	int grade;
	bool operator<(const record &b) const {
		return grade > b.grade;
	}
]]></description><category></category></item><item><title><![CDATA[1082. Read Number in Chinese (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42673003</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42673003</guid><author>Missan</author><pubDate>Tue, 13 Jan 2015 10:20:31 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

char *pron[] = { "ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu" };

inline const char * unit(int i) {
	if(i == 1000)
		return " Qia]]></description><category></category></item><item><title><![CDATA[1081. Rational Sum (20)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42651625</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42651625</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 22:06:18 +0800</pubDate><description><![CDATA[import java.math.BigInteger;
import java.util.Scanner;
import java.util.regex.MatchResult;

class Rational {
	BigInteger n, d;
}

public class Main {
	
	public static Rational add(Rational r1, Rationa]]></description><category></category></item><item><title><![CDATA[1080. Graduate Admission (30)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42647081</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42647081</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 19:57:57 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

#define N 40000
#define M 100
#define K 5

struct student {
	int id;
	int ge;
	int gi;
	bool operator<(const student &b) const {
		int t1 ]]></description><category></category></item><item><title><![CDATA[1079. Total Sales of Supply Chain (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42646633</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42646633</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 19:25:21 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

#define N 100000

inline double rate(int i, double rr[], double r) {
	if(!rr[i]) {
		int j = i;
		for(; !rr[j]; j --) ;
		for(j ++; j <= i; j ++) {
]]></description><category></category></item><item><title><![CDATA[1078. Hashing (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42646147</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42646147</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 18:44:51 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

int nextprime(int n) {
	if(n > 1) {
		for(;; n++) {
			bool prime = true;
			for(int i = 2; i*i <= n; i ++) {
				if(n%i == 0) {
					prim]]></description><category></category></item><item><title><![CDATA[1077. Kuchiguse (20)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42645527</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42645527</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 18:08:51 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

#define N 100

int main(int argc, char **argv) {

	int n;
	scanf("%d", &n);
	getchar();
	
	char line[N][300] = {{}};
	int length[N] = {};
]]></description><category></category></item><item><title><![CDATA[1076. Forwards on Weibo (30)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42644731</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42644731</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 17:04:51 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 1001

int count(int src, int n, vector sn[], int level) {
	bool done[N] = {};
	int dist[N] = {};

	int node ]]></description><category></category></item><item><title><![CDATA[1075. PAT Judge (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42644011</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42644011</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 16:20:43 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 10001
#define K 6

struct user {
	int id;
	int ts;
	int psp;

	bool operator<(const user &b) const {
		if(ts]]></description><category></category></item><item><title><![CDATA[1074. Reversing Linked List (25)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42643255</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42643255</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 15:35:47 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100000

bool reverse(int &head, int &last, int key[], int next[], int k) {
	if(head != -1) {
		int i = 0;
		]]></description><category></category></item><item><title><![CDATA[1073. Scientific Notation (20)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42641819</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42641819</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 14:04:31 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;

int main(int argc, char **argv) {
	bool sign = getchar() == '+';

	vector digits;
	digits.push_back(getchar() - '0');
	getchar()]]></description><category></category></item><item><title><![CDATA[1072. Gas Station (30)]]></title><link>https://blog.youkuaiyun.com/Missan/article/details/42641507</link><guid>https://blog.youkuaiyun.com/Missan/article/details/42641507</guid><author>Missan</author><pubDate>Mon, 12 Jan 2015 13:45:22 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 1010

struct road {
	int next;
	int dist;

	road(int d1, int d2) : next(d1), dist(d2) {}
};

inline int uid(char str[]]]></description><category></category></item></channel></rss>