- 博客(19)
- 资源 (2)
- 收藏
- 关注
RSS订阅翻译 string类的总结
标准c++中string类函数介绍注意不是CString之所以抛弃char*的字符串而选用C++标准程序库中的string类，是因为他和前者比较起来，不必 担心内存是否足够、字符串长度等等，而且作为一个类出现，他集成的操作函数足以完成我们大多数情况下(甚至是100%)的需要。我们可以用 = 进行赋值操作，== 进行比较，+ 做串联（是不是很简单?）。我们尽可以把它看成是C++的基本数据
2016-12-28 16:28:11
223
原创 codeforces 743 C. Vladik and fractions (数学)
C. Vladik and fractionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVladik and Chloe decided to determin
2016-12-20 18:05:23
415
原创 codeforces 743 B. Chloe and the sequence (规律题)
B. Chloe and the sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputChloe, the same as Vladik, is a co
2016-12-20 17:32:17
712
原创 codeforces 735 D. Taxes (数学)
D. Taxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Funt now lives in a country with a very specif
2016-12-19 18:14:36
309
原创 codeforces 735 C. Tennis Championship (数学)
C. Tennis Championshiptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFamous Brazil city Rio de Janeiro ho
2016-12-17 22:40:35
329
原创 codeforces 735 A. Ostap and Grasshopper (简单题)
A. Ostap and Grasshoppertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn the way to Rio de Janeiro Ostap
2016-12-17 21:15:28
498
原创 codeforces 735 B.Urbanization (简单题)
Local authorities have heard a lot about combinatorial abilities of Ostap Bender so they decided to ask his help in the question of urbanization. There are n people who plan to move to the cities. The
2016-12-13 12:16:39
437
原创 codeforces 74B. Arpa’s obvious problem and Mehrdad’s terrible solution (异或+二分STL)
B. Arpa’s obvious problem and Mehrdad’s terrible solutiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTh
2016-12-11 18:09:35
548
原创 codeforces 246 D. Colorful Graph (set)
D. Colorful GraphYou've got an undirected graph, consisting of n vertices and m edges. We will consider the graph's vertices numbered with integers from 1 to n. Each vertex of the graph has
2016-12-10 21:39:34
919
原创 codefoeces C.Buggy Sorting
C. Beauty Pageanttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGeneral Payne has a battalion of n soldie
2016-12-10 21:30:23
463
原创 codeforces C. Queue (思维)
C. Queuetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the Main Berland Bank n people stand in a queue
2016-12-10 21:19:49
332
原创 codeforces 141 B. Hopscotch (规律)
B. Hopscotchtime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputSo nearly half of the winter is over and M
2016-12-10 21:12:32
332
原创 hdoj 5058 So easy (简单set)
So easyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1109 Accepted Submission(s): 592Problem DescriptionSmall W gets two fi
2016-12-07 19:35:10
266
原创 poj 2503 Babelfish (map)
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 41977 Accepted: 17800DescriptionYou have just moved from Waterloo to a big city. The people
2016-12-07 17:31:54
275
原创 codeforces 734 (思维 暴力)
D. Anton and Chesstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton likes to play chess. Also, he like
2016-12-06 18:22:36
330
原创 hdoj 1004 Let the Balloon Rise (map)
Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 112557 Accepted Submission(s): 43959Problem DescriptionCo
2016-12-06 18:02:19
234
原创 hdoj 2072 单词数 (map)
单词数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47086 Accepted Submission(s): 11515Problem Descriptionlily的好朋友xiaoou333最近很
2016-12-06 17:58:34
398
转载 STL中 map用法详解
Map是STL的一个关联容器，它提供一对一（其中第一个可以称为关键字，每个关键字只能在map中出现一次，第二个可能称为该关键字的值）的数据处理能力，由于这个特性，它完成有可能在我们处理一对一数据的时候，在编程上提供快速通道。这里说下map内部数据的组织，map内部自建一颗红黑树(一种非严格意义上的平衡二叉树)，这颗树具有对数据自动排序的功能，所以在map内部所有的数据都是有序的，后边我们会见识到有
2016-12-06 15:26:39
262
原创 codeforces 734 C. Anton and Making Potions (二分 STL)
C. Anton and Making Potionstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is playing a very interes
2016-12-05 20:10:53
199
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人