其他

第一題：坑爹的題目，讀了好長時間的題意，幸好最後懂了，我好多同學最後都錯了在與判斷只有一個數的情況下到底輸不輸出的問題。#include <iostream>#include <queue>#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <cmath>#

遊戲主要就是互動，沒有互動的遊戲跟電影有什麼區別。。。於是我們就得處理許多相關的事件，鍵盤按下或放開，滑鼠移動，單擊。。。。用事件來驅動遊戲的運行，SDL提供了很方便的函數可以處理常式中的事件，事件定義為一個多種事件的聯合SDL_Event，下面這個函數可以取回事件隊列中的第一個事件：int SDL_PollEvent(SDL_Event

    一直想寫個播放器之類的東西，但是缺少音頻檔案的解碼知識，又懶得去學習，畢竟急著寫個像樣的軟體，而且自己寫解碼器需要太多時間，並且不能保證可以處理大部分情況，難免會有bug，幸好SDL再次提供了拓展庫SDL_mixer，它本身內建的支援格式太少，不過拓展庫已經支援大部分的格式，現在來看看這些簡單且常用的函數吧！int Mix OpenAudio(int frequency, Uint16 format, int channels, int chunksize )這個函數用一定方式開啟音頻，

Betsy's TourDon PieleA square township has been divided up into N2 square plots (1 <= N <= 7). The Farm is located in the upper left plot and the Market is located in the lower left plot. Betsy takes her tour of the township going from Farm to

circuitsTime Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 381    Accepted Submission(s): 128Problem Description　　Given a map of N * M (2 <= N, M <= 12) , '.' means empty, '*' means walls.

Tour in the CastleTime Limit: 5 Seconds      Memory Limit: 32768 KBAfter the final BOSS is defeated, the hero found that the whole castle is collapsing (very familiar scene, isn't it). Escape from the castle is easy, just need to cross a few rooms.

Character RecognitionThis problem requires you to write a program that performs character recognition.Each ideal character image has 20 lines of 20 digits. Each digit is a `0' or a `1'. See Figure 1a (way below) for the layout of character images in

TwofiveIOI 2001In order to teach her young calvess the order of the letters in the alphabet, Bessie has come up with a game to play with them. The calves are given a 5 x 5 grid on which they can put the letters 'A'-'Y', but the one rule is that all

題目地址： http://acm.hdu.edu.cn/showproblem.php?pid=2079 常規的母函數問題。 代碼如下：#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <string>#include <algorithm>#include

題目地址： http://codeforces.com/contest/332第一題：題目又臭又長，讀了好長時間才讀懂。n個人，你是0號，從0開始到n-1迴圈做動作，只要你前面三個人動作一樣，你就喝一杯橙汁，問你能喝多少杯，類比#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cstdlib>#include

NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5679 Accepted: 2671DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two

Square DestroyerTime Limit: 10 Seconds      Memory Limit: 32768 KBThe left figure below shows a complete 3*3 grid made with 2*(3*4) (=24) matchsticks. The lengths of all matchsticks are one. You can find many squares of different sizes in the grid.

Check CornersTime Limit: 2000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 858    Accepted Submission(s): 275Problem DescriptionPaul draw a big m*n matrix A last month, whose entries Ai,j are all integer

 The Hive IITime Limit: 5 Seconds      Memory Limit: 65536 KBThere is a hive in the village. Like this. There are 8 columns(from A to H) in this hive. Different colums have the same number of grids. Every grid has its own coordinate, which is formed

 Tony's TourTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1680 Accepted: 751DescriptionA square township has been divided up into n*m(n rows and m columns) square plots (1<=N,M<=8),some of them are blocked, others are unblocked.

 Beautiful MeadowTime Limit: 5 Seconds      Memory Limit: 32768 KBTom's MeadowTom has a meadow in his garden. He divides it into N * M squares. Initially all the squares are covered with grass and there may be some squares cannot be mowed.(Let's

 PipesTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 171    Accepted Submission(s): 75Problem DescriptionThe construction of office buildings has become a very standardized task.

超弦Time Limit 5000msMemory Limit

CarcassonneTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 75    Accepted Submission(s): 8Problem DescriptionCarcassonne is a tile-based board game for two to five players.Square tiles are

Margaritas on the River WalkTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2126 Accepted: 792DescriptionOne of the more popular activities in San Antonio is to enjoy margaritas in the park along the river know as the River Walk.