STL
文章平均质量分 84
lose__way
这个作者很懒,什么都没留下…
展开
-
hackerrank>Dashboard>C++>STL>Deque-STL
Double ended queue or Deque(part of C++ STL) are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back). The member functions of deque th原创 2017-06-10 09:37:14 · 594 阅读 · 0 评论 -
hackerrank>Dashboard>C++>STL>Print Pretty
Your manager gave you a text file with many lines of numbers to format and print. For each row ofspace-separated doubles, format and print the numbers using the specifications in theOutput Forma原创 2017-06-10 09:58:52 · 500 阅读 · 0 评论 -
hackerrank>Dashboard>C++>STL> Maps-STL
Maps are a part of the C++ STL.Maps are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order.The mainly used member function原创 2017-06-10 10:02:45 · 424 阅读 · 0 评论 -
hackerrank>Dashboard>C++>STL>Sets-STL
Sets are a part of the C++ STL. Sets are containers that store unique elements following a specific order. Here are some of the frequently used member functions of sets:Declaration:sets; //Cre原创 2017-06-10 10:07:36 · 587 阅读 · 0 评论 -
hackerrank>Dashboard>C++>STL>Lower Bound-STL
You are given integers in the sorted order. Then you are given queries. In each query you will be given an integer and you have to tell whether that integer is present in the array, if so you have原创 2017-06-10 10:10:59 · 328 阅读 · 0 评论 -
hackerrank>Dashboard>C++>STL>Vector-Erase
You are given a vector of integers.Then you are given queries.First query consists of integer denoting the position in the vector which should be removed.Next query consists ofintegers denot原创 2017-06-10 10:17:43 · 437 阅读 · 0 评论 -
hackerrank>Dashboard>C++>STL>Vector-Sort
You are given integers.Sort the integers and print the sorted order.Store the integers in a vector.Vectors are sequence containers representing arrays that can change in size.Declaration原创 2017-06-10 10:20:43 · 497 阅读 · 0 评论 -
EOJ——Problem #3215——奶牛优惠券
奶牛优惠券Time limit per test: 1.0 secondsMemory limit: 256 megabytes约翰需要买更多的奶牛!市场上有 N 头奶牛待售,第 i 头奶牛的原价是 Pi 元。约翰只有 M 元,不过他还有 K 张优惠券。如果他在买第 i 头牛的时候使用一张优惠券,那么就可以享受一个折扣原创 2017-06-10 21:01:53 · 600 阅读 · 0 评论 -
EOJ——Problem #3214——锯栅栏
锯栅栏Time limit per test: 1.0 secondsMemory limit: 256 megabytes约翰正在修复农场的一段围栏。进过丈量,他需要 N 块木板,第 i 块木板的长度应该是 Li。他订购了一根很长的木料,长度就是这N 块木板的总长度,由于约翰没有锯子,所以他找到了老唐,想让他帮忙锯开木料。老唐是个生意精原创 2017-06-12 20:05:12 · 628 阅读 · 0 评论