<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[NineFailure的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/NineFailure</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; NineFailure]]></copyright><item><title><![CDATA[bzoj3566(106/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77878325</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77878325</guid><author>NineFailure</author><pubDate>Thu, 07 Sep 2017 10:41:01 +0800</pubDate><description><![CDATA[著名的电子产品品牌 SHOI 刚刚发布了引领世界潮流的下一代电子产品——概率充电器: 
“采用全新纳米级加工技术,实现元件与导线能否通电完全由真随机数决定!SHOI 概率充电器,您生活不可或缺的必需品!能充上电吗?现在就试试看吧! 
” 
SHOI 概率充电器由 n-1 条导线连通了 n 个充电元件。进行充电时,每条导线是否可以导电以概率决定,每一个充电元件自身是否直接进行充电也由概率决定。 
随后]]></description><category></category></item><item><title><![CDATA[CodeForces 850A(105/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77870952</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77870952</guid><author>NineFailure</author><pubDate>Wed, 06 Sep 2017 20:20:11 +0800</pubDate><description><![CDATA[You are given set of n points in 5-dimensional space. The points are labeled from 1 to n. No two points coincide.We will call point a bad if there are different points b and c, not equal to a, from the]]></description><category></category></item><item><title><![CDATA[CodeForces - 650A(104/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77715668</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77715668</guid><author>NineFailure</author><pubDate>Wed, 30 Aug 2017 14:40:31 +0800</pubDate><description><![CDATA[Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (xi,]]></description><category></category></item><item><title><![CDATA[CodeForces - 631C(103/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77688768</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77688768</guid><author>NineFailure</author><pubDate>Tue, 29 Aug 2017 21:56:46 +0800</pubDate><description><![CDATA[Each month Blake gets the report containing main economic indicators of the company “Blake Technologies”. There are n commodities produced by the company. For each of them there is exactly one integer]]></description><category></category></item><item><title><![CDATA[HDU - 6166(102/600)点集之间最短路]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77676573</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77676573</guid><author>NineFailure</author><pubDate>Tue, 29 Aug 2017 12:48:34 +0800</pubDate><description><![CDATA[Senior Pan fails in his discrete math exam again. So he asks Master ZKC to give him graph theory problems everyday.  
The task is simple : ZKC will give Pan a directed graph every time, and selects som]]></description><category></category></item><item><title><![CDATA[UVA 10385(101/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77648283</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77648283</guid><author>NineFailure</author><pubDate>Mon, 28 Aug 2017 14:20:21 +0800</pubDate><description><![CDATA[A duathlon is a race that involves running r km and cycling k km. n contestants have entered the 
race; each contestant has different running and cycling speeds. One of the contestants has bribed the]]></description><category></category></item><item><title><![CDATA[HDU - 5876(100/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77609113</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77609113</guid><author>NineFailure</author><pubDate>Sat, 26 Aug 2017 22:40:33 +0800</pubDate><description><![CDATA[In graph theory, the complementcomplement of a graph GG is a graph HH on the same vertices such that two distinct vertices of HH are adjacent if and only if they are notnot adjacent in GG. Now you are]]></description><category></category></item><item><title><![CDATA[codeforces841c(99/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77560101</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77560101</guid><author>NineFailure</author><pubDate>Fri, 25 Aug 2017 10:12:58 +0800</pubDate><description><![CDATA[C. Leha and Function 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Leha like all kinds of strange things. Recently he liked the function]]></description><category></category></item><item><title><![CDATA[CodeForces - 837D(98/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77511184</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77511184</guid><author>NineFailure</author><pubDate>Wed, 23 Aug 2017 20:12:22 +0800</pubDate><description><![CDATA[Let’s call the roundness of the number the number of zeros to which it ends.You have an array of n numbers. You need to choose a subset of exactly k numbers so that the roundness of the product of the]]></description><category></category></item><item><title><![CDATA[HDU5543(97/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77458041</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77458041</guid><author>NineFailure</author><pubDate>Mon, 21 Aug 2017 20:33:56 +0800</pubDate><description><![CDATA[The story happened long long ago. One day, Cao Cao made a special order called “Chicken Rib” to his army. No one got his point and all became very panic. However, Cao Cao himself felt very proud of his]]></description><category></category></item><item><title><![CDATA[HDU6138(96/600)二分+贪心+hash]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77368380</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77368380</guid><author>NineFailure</author><pubDate>Fri, 18 Aug 2017 12:41:59 +0800</pubDate><description><![CDATA[Problem Description
  The Eternal Fleet was built many centuries ago before the time of Valkorion by an unknown race on the planet of Iokath. The fate of the Fleet’s builders is unknown but their legac]]></description><category></category></item><item><title><![CDATA[HDU - 4821(95/600)字符串水题]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77262227</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77262227</guid><author>NineFailure</author><pubDate>Wed, 16 Aug 2017 18:16:59 +0800</pubDate><description><![CDATA[Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if  
  (i) It is of length M*L;  
  (ii) It can be constructed by concatenating M “diversified” subs]]></description><category></category></item><item><title><![CDATA[codeforces835D(94/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77248683</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77248683</guid><author>NineFailure</author><pubDate>Wed, 16 Aug 2017 15:41:14 +0800</pubDate><description><![CDATA[Palindromic characteristics of string s with length |s| is a sequence of |s| integers, where k-th number is the total number of non-empty substrings of s which are k-palindromes.A string is 1-palindrom]]></description><category></category></item><item><title><![CDATA[HDU - 4815(93/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77186181</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77186181</guid><author>NineFailure</author><pubDate>Tue, 15 Aug 2017 11:44:58 +0800</pubDate><description><![CDATA[A crowd of little animals is visiting a mysterious laboratory – The Deep Lab of SYSU. “Are you surprised by the STS (speech to speech) technology of Microsoft Research and the cat face recognition proj]]></description><category></category></item><item><title><![CDATA[CodeForces - 785D(92/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77175521</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77175521</guid><author>NineFailure</author><pubDate>Tue, 15 Aug 2017 08:13:32 +0800</pubDate><description><![CDATA[As you probably know, Anton goes to school. One of the school subjects that Anton studies is Bracketology. On the Bracketology lessons students usually learn different sequences that consist of round b]]></description><category></category></item><item><title><![CDATA[poj1364(91/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77163155</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77163155</guid><author>NineFailure</author><pubDate>Mon, 14 Aug 2017 16:23:41 +0800</pubDate><description><![CDATA[King 
Time Limit: 1000MS      Memory Limit: 10000K 
Total Submissions: 13778        Accepted: 4887 
DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen pra]]></description><category></category></item><item><title><![CDATA[HDU3569(90/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77161839</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77161839</guid><author>NineFailure</author><pubDate>Mon, 14 Aug 2017 15:06:46 +0800</pubDate><description><![CDATA[是个板子题 
学一下差分约束怎么建边的//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
//#define int long long 
con]]></description><category></category></item><item><title><![CDATA[codeforces 839D(89/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77151642</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77151642</guid><author>NineFailure</author><pubDate>Sun, 13 Aug 2017 23:51:04 +0800</pubDate><description><![CDATA[D. Winter is here 
time limit per test3 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Winter is here at the North and the White Walkers are close. John Snow h]]></description><category></category></item><item><title><![CDATA[codeforces839B(88/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77141102</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77141102</guid><author>NineFailure</author><pubDate>Sun, 13 Aug 2017 11:18:42 +0800</pubDate><description><![CDATA[time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains a]]></description><category></category></item><item><title><![CDATA[codeforces768D(87/600)]]></title><link>https://blog.youkuaiyun.com/NineFailure/article/details/77129603</link><guid>https://blog.youkuaiyun.com/NineFailure/article/details/77129603</guid><author>NineFailure</author><pubDate>Sat, 12 Aug 2017 20:14:23 +0800</pubDate><description><![CDATA[D. Jon and Orbs 
time limit per test2 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Jon Snow is on the lookout for some orbs required to defeat the white walk]]></description><category></category></item></channel></rss>