原创 Coins Change
UVA 674 問題描述 Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make change
原创 POJ1100---Dreisam Equations
問題描述: Dreisam Equations Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2060 Accepted: 418 Description Durin
原创 Stacking Boxes
UVA 103 Stacking Boxes Background Some concepts in Mathematics and Computer Science are simple in one or two dim
原创 UVA10673---Play With Floor And Ceil
問題描述: Problem A Play with Floor and Ceil Input: standard inputOutput: standard outputTime Limit: 1 second Theorem Fo
原创 找出字典序
問題描述: 任給一個字符串,求如果組成這個字符串的字母按字典序排列,這個字符串會在第幾個出現。 解法: //這是寫得比較好的C++算法,當然,下面還有一個格式更加整齊的#include<iostream> #include<string
原创 樹的最大獨立集
#include<iostream> #include<fstream> #include<cstdlib> using namespace std; ifstream fin("C:\\data19.in"); struct nod
原创 UVA10006----CarmichaelNumbers
問題描述: An important topic nowadays in computer science is cryptography. Some people even think that cryptography is the
原创 Twin Towers
問題描述:UVA 10066 Problem B The Twin Towers Input: standard input Output: standard output Once upon a time, in an anci
原创 Longest Run On A Snowboard
題目:UVA 10285 Longest Run On A Snowboard Longest Run on a Snowboard Input: standard input Output: standard output Time
原创 UVA138---StreetNumber
問題描述: A computer programmer lives in a street with houses numbered consecutively (from 1) down one side of the street.
原创 百度的新大廈
百度之星2012 J 描述 繼百度搜索框大廈之後,百度又於2012年初在深圳奠基了新的百度國際大廈,作爲未來百度國際化的橋頭堡。不同於百度在北京的搜索框大廈,新的百度國際大廈是一棟高樓,有非常多的樓層,讓每個樓中的電梯都能到達所有樓層將
原创 Fibonacci
//可以用動態規劃 問題: 樓梯有n個臺階,上樓可以一步上1階,也可以一步上2階,一共有多少種上樓方法 #include<iostream> #include<cstdlib> using namespace std; int sta
原创 Cutting Sticks
UVA 10003 問題描述 You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, In
原创 POJ-1211Traffic Lights
Description One way of achieving a smooth and economical drive to work is to `catch' every traffic light, that is have
原创 POJ1081--You Who?
You Who? Time Limit: 1000MSMemory Limit: 10000K Total Submissions: 702Acce