- 博客(13)
- 资源 (1)
- 收藏
- 关注
原创 poj 1023 --The Fun Number System(分析题)
The Fun Number SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6988 Accepted: 2176DescriptionIn a k bit 2's complement number, where the bits are indexed from 0 to k-1, the w
2011-03-31 16:39:00 3278 4
原创 poj 2668 -- Defending Castle(数学题)
<br />Defending CastleTime Limit: 2000MS Memory Limit: 65536K<br />Total Submissions: 4559 Accepted: 1060<br /><br /><br />Description<br />The kingdom Eintagra is in great danger! Overwhelming enemy has surrounded the emperor's castle and once they ente
2011-03-30 20:26:00 1509 1
转载 转:KMP算法详解
原帖地址:http://www.matrix67.com/blog/archives/115 如果机房马上要关门了,或者你急着要和MM约会,请直接跳到第六个自然段。 我们这里说的KMP不是拿来放电影的(虽然我很喜欢这个软件),而是一种算法。KMP算法是拿来处理字符串匹配的。换句话说,给你两个字符串,你需要回答,B串是否是A串的子串(A串是否包含B串)。比如,字符串A="I'm matrix67",字符串B="matrix",我们就说B是A的子串。你可以委婉地问你的MM:“假如你要向你喜欢的人表白的话
2011-03-29 22:09:00 780 1
原创 Opengl -- 五角星的绘制
<br />#include <Windows.h>#include <math.h>#include <gl/glut.h>const double PI=acos(-1.0);//Pos[2]=五角星坐标,Length=五角星尺寸void DrawFivestar(GLfloat Pos[2],GLfloat Length){ float Short=Length*sin(0.1*PI)/sin(0.7*PI); float p1[2],p2[2];
2011-03-24 17:00:00 6993 4
原创 pku 2104 -- K-th Number (sort +小优化水过)
<br /><br /> <br /> <br />http://poj.org/problem?id=2104<br /> <br /> <br /> K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 22939 Accepted: 6366Case Time Limit: 2000MS<br />DescriptionYou are working for Macrohard company in data
2011-03-21 23:19:00 1924
原创 hdu 1754 -- I Hate It (线段树)
<br /> <br /> <br /> <br />I Hate It<br /> <br />Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 7941 Accepted Submission(s): 2808<br /><br /><br />Problem Description<br />很多学校流行一种比较的习惯。老师们很
2011-03-14 17:58:00 593
转载 win7的10个技巧
<br />1. 窗口管理<br /><br />你很可能已经看到了Windows7使窗口管理变容易很多:你只要拖动窗口拱到屏幕边缘,就能把它“dock”到屏幕的左半边或者右半边;类似的,你可以把窗口拱到屏幕顶部来最大化,双击上/下边框把窗口宽度不变而高度最大化。你可能不知道的是所有这些动作都有快捷键: <br /><br />Win+左箭头 和 Win+右箭头 靠左/右dock;<br /><br />Win+上箭头 和 Win+下箭头 最大化和回复/最小化;<br /><br />Win+Shift+
2011-03-12 23:16:00 476
原创 pku -- 3468 A Simple Problem with Integers(线段树)
题目连接:http://poj.org/problem?id=3468 Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 17698 Accepted: 4581Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2
2011-03-10 22:36:00 929
原创 pku 1220--NUMBER BASE CONVERSION(高精度进制转换)
<br /><br />NUMBER BASE CONVERSIONTime Limit: 1000MS Memory Limit: 10000K<br />Total Submissions: 3000 Accepted: 1277<br /><br /><br />Description<br />Write a program to convert numbers in one base to numbers in a second base. There are 62 different dig
2011-03-05 15:33:00 1592 1
原创 hdu 1496 -- Equations(哈希)
<br />Hot! 浙大计算机研究生复试上机考试—— 历年题目(链接) 全真模拟(链接) <br />Equations<br />Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 1387 Accepted Submission(s): 542<br /><br /><br />Problem Description<br />C
2011-03-04 15:37:00 1208
原创 pku 1164 -- The Castle (递归)
<br />1164 -- The Castle (递归)<br />The CastleTime Limit: 1000MS Memory Limit: 10000K<br />Total Submissions: 4361 Accepted: 2460<br /><br /><br />Description<br /> <br /><br /> <br />Figure 1 shows the map of a castle.Write a program that cal
2011-03-02 17:15:00 789
原创 pku 3630--Phone List(二分查找,trie树)
<br />Phone ListTime Limit: 1000MS Memory Limit: 65536K<br />Total Submissions: 10228 Accepted: 3288<br /><br /><br />Description<br /><br />Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another.
2011-03-02 16:53:00 1717
转载 Ubuntu Linux 3D桌面完全教程,显卡驱动安装方法,compiz特效介绍,常见问题解答。
文章标题 : Ubuntu Linux 3D桌面完全教程,显卡驱动安装方法,compiz特效介绍,常见问题解答。发表于 : 2008-08-03 0:57 <br /><br />注意:Ubuntu 10.04以上版本的用户,已经可以不需要使用本文中envyng的安装步骤安装显卡驱动,只需使用系统自带的硬件驱动即可。<br /><br />[2010年8月17日更新] Ubuntu Linux 3D桌面完全教程,显卡驱动安装方法,compiz特效介绍,常见问题解答。<br />
2011-03-01 20:20:00 2770
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人