JackyZhengX1990-CSDN博客

原创给大家介绍几种Linux-Ubuntu操作系统

以前从来没有自己装过Linux，了解的Linux知识也是零星的从阿飞那里得到的一些。因为Linux系列中Ubuntu系列的桌面环境是最晚上的，所以一般教学或者个人使用都是选择Ubuntu的。今天用虚拟机，把Ubuntu的各个版本都安装的一下。得到了许多知识，今天就给大家介绍一下Ubuntu的各个版本的操作系统，下个学期我们也要开Linux实验课了，到时候大家应该都会用到吧，快来选一个你喜欢的装上练习一下吧。1.Ubuntu 这是最基本的版本，其他所有桌面版本都是他的衍生版本，使用的是Gnome桌面环境，和W

2011-01-26 22:58:00 1611

原创 My First Game Cheating Program

The Program I design is a Cheating Program for QQGame_LianLianKan.It is Writen By C++,the IDE which I use is VC++ 6.0,I use many API to realize some functions，such as “ReadProcessMemory”,“SetTimer”,and so on.The UI Design is not difficult,just use the mous

2011-01-25 17:21:00 1126

原创 UVa10189 Minesweeper

Problem B: Minesweeper The ProblemHave you ever played Minesweeper? It's a cute little game which comes within a certain Operating System which name we can't really remember. Well, the goal of the game is tofind where are all the mines within a MxN field

2010-12-31 13:52:00 1696

原创 UVa100 The 3n+1 problem

The 3n + 1 problem BackgroundProblems in Computer Science are often classified as belonging to acertain class of problems (e.g., NP, Unsolvable, Recursive). In thisproblem you will be analyzing a property of an algorithm whoseclassification is not known

2010-12-31 10:30:00 4099 3

原创 ZOJ1092 Arbitrage

ArbitrageTime Limit: 1 Second Memory Limit: 32768 KB Arbitrage is the use of discrepancies in currency exchange rates to transform one unitof a currency into mo

2010-12-19 09:04:00 654

原创 JOJ1126 Monkey and Banana

1126: Monkey and BananaResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K22294Standard A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean ti

2010-12-17 10:37:00 1120

原创 HDU1754 I Hate It(线段树入门题)

I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7182 Accepted Submission(s): 2583Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师

2010-12-15 15:44:00 3699 1

原创 JOJ2237 Hero Ranklist

2237: Hero RanklistResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE5s8192K257119StandardArthur想要将手下的战士按照能力进行排名, 选择出得力的助手进行冒险. 他收集了很多人之间比武的胜负情况，如A战胜了B，B战胜了C等。他发现，这些胜负关系之间彼此互不矛盾，也就是不能出现C又战胜了A这种情况，但很多人之间并没有比武, 也就无法衡量谁更强。在这种情况下，Arthur想把所有可能的排行榜都列举出来，供他进一步研究。

2010-12-14 13:11:00 761

原创 POJ1088 滑雪

滑雪Time Limit:1000MSMemory Limit:65536KTotal Submissions:44155Accepted:15802 DescriptionMichael喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michae

2010-12-12 13:03:00 6563 7

原创模板方法模式

上学期看过一些程杰老师的《大话设计模式》,看了不少说实话记不住，也不怎么理解，昨天Java补课的时候，李老师给我们讲了一下模板方法模式，例子举得很好，再加上以前了解一些，所以听得比较有感觉，今天就拿来和大家分享一下吧，没什么技术含量，当做一个笔记吧，希望对大家有一些帮助。李老师也告诉我们设计模式是一个比较抽象的东西，需要很多实践经验才能真正理解其中奥妙，但是本科生也可以了解了解，没什么害处。 先套用一下子《大话设计模式》里程杰老师引用DP里的模板设计模式的定义:定义一个操

2010-12-08 15:49:00 734 2

原创 JOJ2306 Marriage（归并排序求逆序数）

2306: Marriage ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K42460StandardNow, a lot of persons holding their marriages together are in fashion. One day, a lot of people hold their marriages together. They are all happy, so they want to play a g

2010-12-07 14:45:00 862

原创 JOJ2329 Maximal

2329: MaximalResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K375126StandardGive you some positive integers, you should tell me the max of (a + b + c) where a, b, c can make up a triangle, and in each traingle, every edge you choose can't be choose

2010-12-06 09:18:00 509

原创 JOJ2701 Party

2701: PartyResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K11623StandardGo, go, go, it's party time !!! A great many of guests are invited. Guests are numbered from 1 to N. To make the party more joyful, every 3 guests, who are friends to each ot

2010-12-05 22:01:00 581

原创 JOJ1600 Big Mod

一直对那些ACM的神牛们从心底里有膜拜知情，总会对自己有些鄙视啊，好多数学方面的知识真的不是一般的匮乏，就唠叨到这里吧，1600: Big ModResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1725324StandardCalculate for large values of B, P, and M using an efficient algorithm. (That's right, this problem has a time

2010-12-04 12:22:00 649

原创 POJ1664 放苹果

放苹果Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 16055Accepted: 10133Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 Output对输入的每组数据M和N，用一行输出相应的K。Sample Input17 3Sample Output8Sourcelwx@POJ 解题

2010-12-02 09:12:00 6597

Moon's Blog