EricYang

摘要： A Knight's JourneyTime Limit:1000MSMemory Limit:65536KTotal Submissions:14310Accepted:4766DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is two squares in o 阅读全文

摘要： Colored SticksTime Limit:5000MSMemory Limit:128000KTotal Submissions:19454Accepted:5083DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are 阅读全文

摘要： A Bug's LifeTime Limit:10000MSMemory Limit:65536KTotal Submissions:16957Accepted:5446DescriptionBackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender 阅读全文

摘要： Wireless NetworkTime Limit:10000MSMemory Limit:65536KTotal Submissions:10043Accepted:4245DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the n 阅读全文

摘要： Cube StackingTime Limit:2000MSMemory Limit:30000KTotal Submissions:11443Accepted:3804Case Time Limit:1000MSDescriptionFarmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks 阅读全文

摘要： su用户下，更新系统 yum update加入软件仓库：rpm -ivh rpmfusion-free-release-stable.noarch.rpmrpm -ivh rpmfusion-nonfree-release-stable.noarch.rpm1.安装右键打开终端程序nautilus-open-terminalyum install nautilus-open-terminal注销后重新登入,在任何一个 Nautilus 窗口中点击鼠标右键,你就可以看到“在终端中打开”这个命令了。2.*Gnome 启动时打开 Num Lock 键yum install numlockxcp /e 阅读全文

摘要： Navigation NightmareTime Limit:2000MSMemory Limit:30000KTotal Submissions:2033Accepted:848Case Time Limit:1000MSDescriptionFarmer John's pastoral neighborhood has N farms (2 <= N <= 40,000), usually numbered/labeled 1..N. A series of M (1 <= M < 40,000) vertical and horizontal roads 阅读全文

摘要： Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:16443Accepted:4809DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify whi 阅读全文

摘要： The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:10794Accepted:5120DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separa 阅读全文

摘要： Is It A Tree?Time Limit:1000MSMemory Limit:10000KTotal Submissions:10943Accepted:3762DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is exa 阅读全文