其他

How manyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1028    Accepted Submission(s): 403Problem DescriptionGive you n ( n < 10000) necklaces ,the length of necklace will not large than 100

（七）set類的主要成員set<T>是一種集合容器。☆void clear();//刪除所有元素☆bool empty() const; //返回是否為空白☆void erase(iterator position);//刪除在位置position的元素      //貌似也可以直接刪除值☆iterator find(const key_type& x)const;//返回索引為x的元素的指標☆pair<iterator,bool>insert(const

Problem

Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3076    Accepted Submission(s): 1175Problem DescriptionDuring the War of Resistance Against Japan, tunnel warfare was carried out

Problem

Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to

Problem DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].  InputThe input contains several test cases.

Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want

今年暑假不ACTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20878    Accepted Submission(s): 10923Problem

Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will

DescriptionSome of Farmer John's N cows (1 ≤ N ≤80,000) are having a bad hair day! Since each cow is self-conscious about hermessy hairstyle, FJ wants to count the number of other cows that can see thetop of other cows' heads.Each cow i has a

Description （Special Judge）We are given a sequence of Npositive integers a = [a1, a2, ..., aN] on which we can perform contractionoperations.One contraction operation consists of replacing adjacent elements ai and ai+1by their difference ai-ai+1.

Problem DescriptionArbitrage is the use ofdiscrepancies in currency exchange rates to transform one unit of a currencyinto more than one unit of the same currency. For example, suppose that 1 USDollar buys 0.5 British pound, 1 British pound buys 10.0

USACO/ratiosFeed Ratios飼料調配1998 ACM Finals, Dan Adkins [描述農夫約翰從來只用調配得最好的飼料來喂他的奶牛。飼料用三種原料調配成：大麥，燕麥和小麥。他知道自己的飼料精確的配比，在市場上是買不到這樣的飼料的。他只好購買其他三種混合飼料（同樣都由三種麥子組成），然後將它們混合，來調配他的完美飼料。給出三組整數，表示 大麥：燕麥：小麥 的比例，找出用這三種飼料調配 x：y：z 的飼料的方法。 例如，給出目標飼料 3：4：5 和三種飼料的比例：

POJ 1002 - 487-3279(基礎)http://acm.pku.edu.cn/JudgeOnline/problem?id=1002題意：略解法：二叉尋找數，map，快排...POJ 1200 - Crazy Search(基礎)http://acm.pku.edu.cn/JudgeOnline/problem?id=1200題意：找出不相同的子串數量，字母表大小和子串長度會給定，這題很推薦hash入門者一做解法：hash(建議karp-rabin)POJ 1204 - Word

二分法用來解決單調函數的極值問題，而三分法用來解決凸函數的極值問題。所以在使用三分的時候要注意函數具有凹凸性模板：double cal(){//.....具體計算根據題目要求實現return 0.0;}void solve(){double

用STL的優先隊列實現了dijsktra的最佳化#define inf 999999999using namespace std;const int maxn=1000010;int dis[maxn];int head[maxn];int pnt[maxn];int next[maxn];int cost[maxn];int vis[maxn];int node,edgenum,edg;//int start[maxn],end[maxn],wight[maxn];struct

Description（Special  Judge）Andrew is working as systemadministrator and is planning to establish a new network in his company. Therewill be N hubs in the company, they can be connected to each other usingcables. Since each worker of the company must

http://acm.hdu.edu.cn/showproblem.php?pid=1575http://acm.hdu.edu.cn/showproblem.php?pid=1757赤裸裸的兩道http://acm.hdu.edu.cn/showproblem.php?pid=2256這題正解不是矩陣,不過如果推出公式來的話可以用矩陣解http://acm.hdu.edu.cn/showproblem.php?pid=2604推公式吧,推完後矩陣求解(也是道正解不是矩陣的題)http://ac

DescriptionJapan plans to welcome the ACMICPC World Finals and a lot of roads must be built for the venue. Japan is tallisland with N cities on the East coast and M cities on the West coast (M <=1000, N <= 1000). K superhighways will be build.