razrlele

POJ1840

Written by  on December 20, 2014

POJ1840 Eqs Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 14507 Accepted: 7122 Description Consider equations having the following form:

[Read more...]

UVAOJ10152

Written by  on December 20, 2014

UVAOJ10152 题意: 首先给出一堆栈乌龟, 然后每个乌龟都可以爬到顶端去, 然后求最少爬的次数以及先后顺序以达到目的堆栈乌龟的顺序.

[Read more...]

20141214

Written by  on December 14, 2014

唔…最近过得还算不错, 或者这一个学期都过得还算爽, 虽然刷题速度还没能突破两题/天, 但是也没有去想强迫自己质疑自己了, 或者说已经坦然接受了自己水平还没到家所以速度上不去这个事实, 常规题到手随手1A这个离我还有一定距离的我只能承认, 随着这几年慢慢变大, 我已经渐渐地发现自己过去大跃进思想尤其根深蒂固, 以前尽管几乎每次的初衷都是好的, 但是结果都是不好的, 说白了就是不踏实, 干什么都想一步登天, 不懂得为过程而努力和享受过程.

[Read more...]

UVAOJ101

Written by  on December 14, 2014

UVAOJ101 101 – The Blocks Problem Time limit: 3.000 seconds   The Blocks Problem  Background  Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in which a robot arm performed tasks involving the manipulation of blocks.

[Read more...]

UVAOJ127

Written by  on December 13, 2014

UVAOJ127 127 – “Accordian” Patience Time limit: 3.000 seconds  Accordian” Patience  You are to simulate the playing of games of Accordian” patience, the rules for which are as follows:

[Read more...]

Strange#0

Written by  on December 12, 2014

Update0 刚刚才发现在另外一台电脑上面, 同样的程序, 同样的数据, 代码却是在pilecount == 33, i == 4的时候出现Segment Fault, 并且i最终变成的是18474…

[Read more...]

AOAPC I: Volume 1.Maths-Simple Geometry

Written by  on December 10, 2014

<<算法竞赛入门经典>> UVaoj第二卷计算几何习题: 10250-The Other Two Trees 第一次做到WF的题目(*ノωノ), 只不过是道热身题…

[Read more...]

AOAPC I: Volume 1.Maths-Number Theory

Written by  on December 6, 2014

<<算法竞赛入门经典>> UVaoj第二卷数论习题: 575-Skew Binary Skew Binary, 斜进制, 就是一种进制转换的变种. 10110-Light, more light

[Read more...]

UVAOJ10061

Written by  on December 6, 2014

UVAOJ10061 有一点意思的数论题, 求N!在B进制数系统下的结果的位数以及末尾的零的个数. 求位数比较简单, 因为M位的B进制数最大值为B^M-1, 故

[Read more...]

素数打表

Written by  on December 6, 2014

C++ 123 const int maxn = 1000000;int primenum;bool visit[maxn];

[Read more...]