<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[x_flyx的博客]]></title><description><![CDATA[蒟蒻]]></description><link>https://blog.youkuaiyun.com/x_flyx</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; x_flyx]]></copyright><item><title><![CDATA[HDU6198 number number number]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/82219905</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/82219905</guid><author>x_flyx</author><pubDate>Thu, 30 Aug 2018 13:31:26 +0800</pubDate><description><![CDATA[number number number

 HDU - 6198 

We define a sequence FF: 
⋅⋅ F0=0,F1=1F0=0,F1=1; 
⋅⋅ Fn=Fn−1+Fn−2 (n≥2)Fn=Fn−1+Fn−2 (n≥2). 
Give you an integer kk, if a positive number nn can be expressed by 
n=F...]]></description><category></category></item><item><title><![CDATA[B. Creating the Contest]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/82055541</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/82055541</guid><author>x_flyx</author><pubDate>Sat, 25 Aug 2018 21:29:30 +0800</pubDate><description><![CDATA[B. Creating the Contest

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a problemset consisting of nn problems. The ...]]></description><category></category></item><item><title><![CDATA[A. Many Equal Substrings]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/82054755</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/82054755</guid><author>x_flyx</author><pubDate>Sat, 25 Aug 2018 20:09:18 +0800</pubDate><description><![CDATA[A. Many Equal Substrings

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a string tt consisting of nn lowercase Lati...]]></description><category></category></item><item><title><![CDATA[Rikka with Badminton]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81875767</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81875767</guid><author>x_flyx</author><pubDate>Mon, 20 Aug 2018 18:28:03 +0800</pubDate><description><![CDATA[Rikka with Badminton

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 53    Accepted Submission(s): 44
 

Problem Description

In the last se...]]></description><category></category></item><item><title><![CDATA[Rikka with Stone-Paper-Scissors]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81875741</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81875741</guid><author>x_flyx</author><pubDate>Mon, 20 Aug 2018 18:25:59 +0800</pubDate><description><![CDATA[Rikka with Stone-Paper-Scissors

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1    Accepted Submission(s): 1
 

Problem Description

Did y...]]></description><category></category></item><item><title><![CDATA[鹏]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81840551</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81840551</guid><author>x_flyx</author><pubDate>Sun, 19 Aug 2018 21:09:48 +0800</pubDate><description><![CDATA[链接：https://www.nowcoder.com/acm/contest/136/B
来源：牛客网
 

鹏

时间限制：C/C++ 2秒，其他语言4秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

    化而为鸟，其名为鹏。鹏之背，不知其几千里也。

                                ...]]></description><category></category></item><item><title><![CDATA[The Triangle Division of the Convex Polygon]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81813229</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81813229</guid><author>x_flyx</author><pubDate>Sat, 18 Aug 2018 21:35:52 +0800</pubDate><description><![CDATA[The Triangle Division of the Convex Polygon
		Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
		Total submit users: 28, Accepted users: 17
		Problem 11562 : No special judgement
		...]]></description><category></category></item><item><title><![CDATA[Graduation Examination]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81812934</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81812934</guid><author>x_flyx</author><pubDate>Sat, 18 Aug 2018 21:06:06 +0800</pubDate><description><![CDATA[Graduation Examination
		Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
		Total submit users: 41, Accepted users: 33
		Problem 11566 : No special judgement
		Problem description
	...]]></description><category></category></item><item><title><![CDATA[Problem D Game of Throwns]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81704197</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81704197</guid><author>x_flyx</author><pubDate>Wed, 15 Aug 2018 14:59:58 +0800</pubDate><description><![CDATA[Problem D Game of Throwns

Daenerys frequently invents games to help teach her second grade Computer Science class about various aspects of the discipline. For this week’s lesson she has the children ...]]></description><category></category></item><item><title><![CDATA[Magic Square]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81703779</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81703779</guid><author>x_flyx</author><pubDate>Wed, 15 Aug 2018 14:38:43 +0800</pubDate><description><![CDATA[Magic Square

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0
 

Problem Description

A magic square is a 3×3 ...]]></description><category></category></item><item><title><![CDATA[Problem C DRM Messages]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81675032</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81675032</guid><author>x_flyx</author><pubDate>Tue, 14 Aug 2018 21:38:34 +0800</pubDate><description><![CDATA[Problem C DRM Messages

DRM Encryption is a new kind of encryption. Given an encrypted string (which we’ll call a DRM message), the decryption process involves three steps: Divide, Rotate and Merge. T...]]></description><category></category></item><item><title><![CDATA[题目 D. 错误的算法]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81638263</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81638263</guid><author>x_flyx</author><pubDate>Mon, 13 Aug 2018 22:29:56 +0800</pubDate><description><![CDATA[题目 D. 错误的算法 有道题目是这样的： 输入一个 n 行 m 列网格，找一个格子，使得它所在的行和列中所有格子的数之和最大。如果答 案不唯一，输出任意解即可。比如，在下面的例子中，最优解是(1,3)，即第一行和的三列的交 点（行从上到下编号为 1~n，列从左到右编号为 1~m），所有 7 个数之和为 35。 5 5 5 5 1 1 5 1 1 1 5 1 1 1 5 1 快要比赛的时候，有一个...]]></description><category></category></item><item><title><![CDATA[题目 B. 大还是小？]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81636518</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81636518</guid><author>x_flyx</author><pubDate>Mon, 13 Aug 2018 20:32:31 +0800</pubDate><description><![CDATA[题目 B. 大还是小？

输入两个实数，判断第一个数大，第二个数大还是一样大。每个数的格式为： [整数部分].[小数部分] 简单起见，整数部分和小数部分都保证非空，且整数部分不会有前导 0。不过，小数部分的最 后可以有 0，因此 0.0 和 0.000 是一样大的。

输入

输入包含不超过 20 组数据。每组数据包含一行，有两个实数（格式如前所述）。每个实数都 包含不超过 100 个字符。

输...]]></description><category></category></item><item><title><![CDATA[Hamburger String]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81635960</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81635960</guid><author>x_flyx</author><pubDate>Mon, 13 Aug 2018 19:55:45 +0800</pubDate><description><![CDATA[Hamburger String
		Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
		Total submit users: 17, Accepted users: 15
		Problem 10865 : No special judgement
		Problem description
		  BUG...]]></description><category></category></item><item><title><![CDATA[分金条]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81634933</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81634933</guid><author>x_flyx</author><pubDate>Mon, 13 Aug 2018 18:42:14 +0800</pubDate><description><![CDATA[分金条
		Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
		Total submit users: 17, Accepted users: 14
		Problem 10866 : No special judgement
		Problem description
		  相信很多人都看过这个经典的数学故...]]></description><category></category></item><item><title><![CDATA[The Confusion of Euclid]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81631888</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81631888</guid><author>x_flyx</author><pubDate>Mon, 13 Aug 2018 16:14:06 +0800</pubDate><description><![CDATA[The Confusion of Euclid
		Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
		Total submit users: 18, Accepted users: 12
		Problem 10867 : No special judgement
		Problem description
...]]></description><category></category></item><item><title><![CDATA[Harmonious Contest]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81611381</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81611381</guid><author>x_flyx</author><pubDate>Sun, 12 Aug 2018 22:01:30 +0800</pubDate><description><![CDATA[Harmonious Contest
		Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
		Total submit users: 18, Accepted users: 18
		Problem 10864 : No special judgement
		Problem description
		  T...]]></description><category></category></item><item><title><![CDATA[C. Less or Equal]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81566736</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81566736</guid><author>x_flyx</author><pubDate>Fri, 10 Aug 2018 17:14:18 +0800</pubDate><description><![CDATA[C. Less or Equal

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a sequence of integers of length nn and integer nu...]]></description><category></category></item><item><title><![CDATA[B. Two-gram]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81565568</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81565568</guid><author>x_flyx</author><pubDate>Fri, 10 Aug 2018 16:29:14 +0800</pubDate><description><![CDATA[B. Two-gram

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Two-gram is an ordered pair (i.e. string of length two) of capital Lat...]]></description><category></category></item><item><title><![CDATA[A. Wrong Subtraction]]></title><link>https://blog.youkuaiyun.com/x_flyx/article/details/81544770</link><guid>https://blog.youkuaiyun.com/x_flyx/article/details/81544770</guid><author>x_flyx</author><pubDate>Thu, 09 Aug 2018 21:46:03 +0800</pubDate><description><![CDATA[A. Wrong Subtraction

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little girl Tanya is learning how to decrease a number by one...]]></description><category></category></item></channel></rss>