其他

Squiggly SudokuTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 81    Accepted Submission(s): 18Problem DescriptionToday we play a squiggly sudoku, The objective is to fill a 9*9 grid with

 Pandora adventureAccept: 142    Submit: 473Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem DescriptionThe pollution of the earth is so serious that people can not survive any more. Fortunately, people have found a new planet that maybe has

Charlie's ChangeTime Limit: 2 Seconds      Memory Limit: 65536 KBCharlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically

地址：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=18757#status第一題：給你三個點，判斷是否是直角三角形，或者把一個頂點移動一單位，使其座標仍是整數，並且是直角三角形，或者兩者都不是，這個只要注意移動後依舊是個三角形就行代碼：#include<cstdio>#include<iostream>using namespace std;int dx[]={0,0,-1,1};int dy[]={

Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9159 Accepted: 4441DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid.

Ultimate WeaponTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 1499 Accepted: 742DescriptionIn year 2008 of the Cosmic Calendar, the Aliens send a huge armada towards the Earth seeking after conquest. The humans now depend on their

遊戲通常在適當的適合需要些文字提示，有的遊戲甚至用文字的方式來表示人物的交流，通常劇情遊戲都是這樣的，所以文字顯示也是相當重要的一部分，SDL本身好像沒有支援文字顯示的函數，不過，它的拓展庫SDL_ttf提供了相當大的支援，可以直接使用ttf格式的字型檔，大大方便了中文顯示，畢竟如果是英文，完全可以做26張圖，呵呵，廢話不說了，下面來看看SDL_ttf提供的幾個函數首先，和SDL一樣，它有初始化函數int

剪刀石頭布【問題描述】在一些一對一遊戲的比賽（如下棋、乒乓球和羽毛球的單打）中，我們經常會遇到A勝過B，B勝過C而C又勝過A的有趣情況，不妨形象的稱之為剪刀石頭布情況。有的時候，無聊的人們會津津樂道於統計有多少這樣的剪刀石頭布情況發生，即有多少對無序三元組(A, B, C)，滿足其中的一個人在比賽中贏了另一個人，另一個人贏了第三個人而第三個人又勝過了第一個人。注意這裡無序的意思是說三元組中元素的順序並不重要，將(A, B, C)、(A, C, B)、(B, A, C)、(B, C, A)、(C,

題目地址：http://acm.hdu.edu.cn/showproblem.php?pid=4576題意：給你一個n，m，l，r。n個格子圍成一個圈，一個機器人從第一個格子開始，經過m個步，每個步知道走幾格，但是不知道方向，問你最後在l到r之間的機率。題解：用滾動數組來表示AC代碼：#include <iostream>#include <vector>#include <list>#include <deque>#include

Get Luffy OutTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6191 Accepted: 2327DescriptionRatish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to Arlong's

使用SDL庫之前需要裝載各個子系統，就像要放電影，必須給播放器提供影片一樣裝載子系統的函數是int SDL_Init(Uint32 flags);flags可取的值如下：#define SDL_INIT_TIMER             0x00000001   計時器#define SDL_INIT_AUDIO             0x00000010   音頻#define SDL_INIT_VIDEO             0x00000020  

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9838 Accepted: 5224DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:  In the figure, each node is

Pushing BoxesTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 3975 Accepted: 1403 Special JudgeDescriptionImagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can

映像載入是遊戲常用到的步驟，SDL提供了簡單的方法來載入並顯示圖片不過在這之前，得先建立一個視窗來顯示，SDL提供下面這個簡便的函數SDL_Surface* SDL_SetVideoMode(int width, int height, int bitsperpixel, Uint32

Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 9221 Accepted: 2955DescriptionWrite a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest

Cow XORAdrian Vladu -- 2005Farmer John is stuck with another problem while feeding his cows. All of his N (1 ≤ N ≤ 100,000) cows (numbered 1..N) are lined up in front of the barn, sorted by their rank in their social hierarchy. Cow #1 has the

題目地址：http://acm.hdu.edu.cn/showproblem.php?pid=3074一道最基本的線段樹。AC代碼：#include <iostream>#include <vector>#include <list>#include <deque>#include <queue>#include <iterator>#include <stack>#include

Building roadsTime Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 208    Accepted Submission(s): 66Problem DescriptionFarmer John's farm has N barns, and there are some cows that live in each barn.

題目地址：http://acm.hdu.edu.cn/showproblem.php?pid=4577題意：給你n個球，k個盒子，放球滿足以下規則：1、第i個盒子放編號為x的球，那麼第i+1個盒子一定放編號為2x的求。問你第一個盒子最多能放多少個球。題解：從1開始放在第一個盒子裡面，然後照上面規則放完k個盒子，然後再放剩下球編號最小的在第一個盒子……，直到不能放完k個盒子。第一位最多可放置（n/（2^(k-1)+1）/2個（第奇數個肯定全都能放到），然後再看多餘部分，可以放置1,3,5,7乘以他

 單調隊列說明：單調隊列，顧名思義就是具有單調性的隊列，一般的隊列只能從隊尾入隊、隊首出隊；為了保持單調隊列的單調性，單調隊列除具有這兩種性質外，還可以從隊尾出隊。以單增的單調隊列為例，當元素t要入隊時，先要從隊尾依次彈出所有>=t的元素，再將t加在隊尾。舉個例子，如果序列：1 3 -1 -3 10要構成單調隊列，先將元素“1”放入隊列中，以初始化隊列，接著元素“3”要入隊，隊尾元素“1”比“3”小，因此“3”可以直接入隊，隊列變為1 3，接著“-1”要入隊，從隊尾依次彈出元素“3”“1”