原创 uva 10954 - Add All
Problem FAdd AllInput: standard inputOutput: standard output Yup!! The problem name reflects your task; just add a set
原创 uva 674 - Coin Change
Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make chan
原创 uva 357 - Let Me Count The Ways
Let Me Count The Ways After making a purchase at a large department store, Mel's change was 17 cents. He received 1
原创 公司考試記(Y-Y)
好久沒有做題了,水平真的會退步。上機考個試做題都累,考試感悟如下:第一題:水題,給16組目標(R,G,B),再輸入多組(R’,G' , B'),距離定義爲歐式距離,求輸入每組(R’,G' , B')與前面16個距離最小的並輸出。第二題:水
原创 MySQL 5.6 for Windows 解壓縮版配置安裝
MySQL 5.6 for Windows 解壓縮版配置安裝 | 瀏覽:21782 | 更新:2014-03-05 12:28 1 2 3 4 5 6 7 分步閱讀 方法/步驟
原创 uva 714 - Copying Books
Copying Books Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had
原创 uva 103 - Stacking Boxes
Stacking Boxes Background Some concepts in Mathematics and Computer Science are simple in one or two dimensions bu
原创 uva 10827 - Maximum sum on a torus
Problem HMaximum sum on a torusInput: Standard Input Output: Standard Output A grid that wraps both horizontally and
原创 遞歸下降分析法
各類參看書都會給的一個例子: LL(0)文法 G[E]: 其中 E→TG G爲E’ G→+TG|∧ ∧爲ε T→FS S爲T’ S→*FS|∧ F→i|(E)
原创 文件夾隱藏項灰色
舍友的電腦不能亂插啊,手機sd卡中招了。 計算機中毒後,病毒會對“受害者”進行各種各樣的“惡搞”。其中令人頭疼的“惡搞”之一就是:強行將磁盤的部分或全部文件夾(包括其中的子文件夾和全部文件)設置爲“隱藏”,而不能通過
原创 uva 10714 - Ants
Problem B: Ants An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a
原创 實驗一 線性表的順序表示與實現
實驗一 線性表的順序表示與實現#include <stdio.h> #include <stdlib.h> #include <iostream> #define OVERFLOW -2 #define OK 1 #define ER
原创 2012 ACM/ICPC Asia Regional Changchun Online
1006 LianLianKan Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s):
原创 2012 ACM/ICPC Asia Regional Tianjin Online
A very hard mathematic problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total S
原创 uva 108 - Maximum Sum
Maximum Sum Background A problem that is simple to solve in one dimension is often much more difficult to solve in