<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[退役的铜牌狗]]></title><description><![CDATA[away from acm]]></description><link>https://blog.youkuaiyun.com/elbadaernu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; elbadaernu]]></copyright><item><title><![CDATA[centos7 下pyinstaller手动安装]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/109638264</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/109638264</guid><author>elbadaernu</author><pubDate>Thu, 12 Nov 2020 11:36:55 +0800</pubDate><description><![CDATA[环境：

centos7.8 python2.7.5

安装

在尝试了各种命令行安装pyinstaller都失败的情况下，没得办法，最终还是决定采取手动安装

首先你需要查看下自己linux系统中python 的版本信息 可以用python -V 来查看，然后进入pyinstaller官网https://pyinstaller.readthedocs.io/en/stable/CHANGES.html#来查看各个版本的信息，找到适合对应自己python版本的进行下载 。

需要注意的是在4.0和3.6这.]]></description><category></category></item><item><title><![CDATA[window 下pdfminer 安装]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/89851161</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/89851161</guid><author>elbadaernu</author><pubDate>Sun, 05 May 2019 17:25:11 +0800</pubDate><description><![CDATA[进入官网下载

https://pypi.python.org/pypi/pdfminer/

然后打开cmd命令，进入到setup.py所在的文件夹目录中

然后输入命令setup.py install 即可

比如我的在f盘下


]]></description><category></category></item><item><title><![CDATA[pat 1047]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/79429405</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/79429405</guid><author>elbadaernu</author><pubDate>Sat, 03 Mar 2018 12:14:47 +0800</pubDate><description><![CDATA[Zhejiang University has 40000 students and provides 2500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.Input Speci...]]></description><category></category></item><item><title><![CDATA[2017 acm icpc 上海final L 题（博弈）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78868284</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78868284</guid><author>elbadaernu</author><pubDate>Thu, 21 Dec 2017 22:07:01 +0800</pubDate><description><![CDATA[emmmmm大致题意就是给你连续的n个格子，编号1到n，两个人轮流往空格子里放字母s或者o，谁先使得相邻的三个格子里字母为sos则谁获胜，假设A先手，B后手问谁会赢，如果所有格子都被填满了但是没有出现sos则认为两人平局。思路：一开始看到这题本来我想用状压啊，sg函数啊什么的去写，但是gg，于是就先扔一旁了，后来卡题的时候看榜单发现有一些奇奇怪怪的队伍过了这题，于是就觉得这题会不会是个傻逼题，然后对]]></description><category></category></item><item><title><![CDATA[退役总结]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78852455</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78852455</guid><author>elbadaernu</author><pubDate>Wed, 20 Dec 2017 13:59:49 +0800</pubDate><description><![CDATA[。。]]></description><category></category></item><item><title><![CDATA[D-query SPOJ - DQUERY （树状数组离线预处理||主席树）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78808151</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78808151</guid><author>elbadaernu</author><pubDate>Thu, 14 Dec 2017 22:37:24 +0800</pubDate><description><![CDATA[Given a sequence of n numbers a1, a2, …, an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in the sub]]></description><category></category></item><item><title><![CDATA[poj2104 K-th Number （主席树无修改）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78798178</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78798178</guid><author>elbadaernu</author><pubDate>Wed, 13 Dec 2017 23:52:40 +0800</pubDate><description><![CDATA[DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to r]]></description><category></category></item><item><title><![CDATA[HDU 4777 Rabbit Kingdom（树状数组+离线预处理）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78787682</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78787682</guid><author>elbadaernu</author><pubDate>Wed, 13 Dec 2017 02:15:53 +0800</pubDate><description><![CDATA[Problem Description 
　　Long long ago, there was an ancient rabbit kingdom in the forest. Every rabbit in this kingdom was not cute but totally pugnacious, so the kingdom was in chaos in season and out]]></description><category></category></item><item><title><![CDATA[bzoj 3747: [POI2015]Kinoman （线段树+预处理）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78784909</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78784909</guid><author>elbadaernu</author><pubDate>Tue, 12 Dec 2017 18:59:22 +0800</pubDate><description><![CDATA[Description共有m部电影，编号为1~m，第i部电影的好看值为w[i]。 
在n天之中（从1~n编号）每天会放映一部电影，第i天放映的是第f[i]部。 
你可以选择l,r(1<=l<=r<=n)，并观看第l,l+1,…,r天内所有的电影。如果同一部电影你观看多于一次，你会感到无聊，于是无法获得这部电影的好看值。所以你希望最大化观看且仅观看过一次的电影的好看值的总和。 
Input第一行两个整]]></description><category></category></item><item><title><![CDATA[HDU 4776 Ants（字典树+优先队列+思维题）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78778142</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78778142</guid><author>elbadaernu</author><pubDate>Tue, 12 Dec 2017 00:06:07 +0800</pubDate><description><![CDATA[Problem Description 
　　There are some apple trees in a farm. An apple tree can be described as a connected graph which has n nodes and n-1 edges. The apples are the nodes and the branches are the edges]]></description><category></category></item><item><title><![CDATA[HDU 1712 ACboy needs your help （分组背包）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78759919</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78759919</guid><author>elbadaernu</author><pubDate>Sat, 09 Dec 2017 16:23:09 +0800</pubDate><description><![CDATA[Problem Description 
ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arr]]></description><category></category></item><item><title><![CDATA[HDU 4747 Mex（线段树+思维题）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78756295</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78756295</guid><author>elbadaernu</author><pubDate>Fri, 08 Dec 2017 22:40:44 +0800</pubDate><description><![CDATA[Problem Description 
Mex is a function on a set of integers, which is universally used for impartial game theorem. For a non-negative integer set S, mex(S) is defined as the least non-negative integer]]></description><category></category></item><item><title><![CDATA[HDU 3951 Coin Game（博弈水题）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78734982</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78734982</guid><author>elbadaernu</author><pubDate>Wed, 06 Dec 2017 20:48:05 +0800</pubDate><description><![CDATA[Problem Description 
After hh has learned how to play Nim game, he begins to try another coin game which seems much easier. 
The game goes like this:  
Two players start the game with a circle of n coi]]></description><category></category></item><item><title><![CDATA[HDU 5776 sum（思维题+前缀和）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78728718</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78728718</guid><author>elbadaernu</author><pubDate>Wed, 06 Dec 2017 11:21:00 +0800</pubDate><description><![CDATA[Problem Description 
Given a sequence, you’re asked whether there exists a consecutive subsequence whose sum is divisible by m. output YES, otherwise output NOInput 
The first line of the input has an]]></description><category></category></item><item><title><![CDATA[HDU 5550 Game Rooms （dp+前缀和预处理）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78726595</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78726595</guid><author>elbadaernu</author><pubDate>Wed, 06 Dec 2017 01:57:56 +0800</pubDate><description><![CDATA[Problem Description 
Your company has just constructed a new skyscraper, but you just noticed a terrible problem: there is only space to put one game room on each floor! The game rooms have not been fu]]></description><category></category></item><item><title><![CDATA[Dima and Sequence CodeForces - 272B （思维题）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78674908</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78674908</guid><author>elbadaernu</author><pubDate>Thu, 30 Nov 2017 12:54:44 +0800</pubDate><description><![CDATA[Dima got into number sequences. Now he’s got sequence a1, a2, …, an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:f(0) = 0;]]></description><category></category></item><item><title><![CDATA[Painting Eggs CodeForces - 282B （思维题）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78671161</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78671161</guid><author>elbadaernu</author><pubDate>Wed, 29 Nov 2017 23:11:59 +0800</pubDate><description><![CDATA[The Bitlandians are quite weird people. They have very peculiar customs.As is customary, Uncle J. wants to have n eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the]]></description><category></category></item><item><title><![CDATA[Non-square Equation CodeForces - 233B （数学）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78670706</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78670706</guid><author>elbadaernu</author><pubDate>Wed, 29 Nov 2017 22:21:57 +0800</pubDate><description><![CDATA[Let’s consider equation:

x2 + s(x)·x - n = 0,  
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.

You are given an integer ...]]></description><category></category></item><item><title><![CDATA[POJ 2155 Matrix（二维树状数组）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78660910</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78660910</guid><author>elbadaernu</author><pubDate>Wed, 29 Nov 2017 01:18:32 +0800</pubDate><description><![CDATA[DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 <= i, j <= N). We can change the matrix in]]></description><category></category></item><item><title><![CDATA[Pocky HDU - 5984 （求期望+推公式+调和级数）]]></title><link>https://blog.youkuaiyun.com/elbadaernu/article/details/78660212</link><guid>https://blog.youkuaiyun.com/elbadaernu/article/details/78660212</guid><author>elbadaernu</author><pubDate>Tue, 28 Nov 2017 22:40:06 +0800</pubDate><description><![CDATA[Problem Description 
Let’s talking about something of eating a pocky. Here is a Decorer Pocky, with colorful decorative stripes in the coating, of length L. 
While the length of remaining pocky is long]]></description><category></category></item></channel></rss>