
字符串
文章平均质量分 79
xiaoleiacm
asdfghjkl;
展开
-
poj 1488 TEX Quotes
TEX QuotesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7500 Accepted: 3946DescriptionTEX is a typesetting language developed by Donald Knuth. It takes原创 2012-10-21 21:17:36 · 559 阅读 · 0 评论 -
2013春季SD高校ACM周赛9(SDUT) -b
Hide That Number Time Limit: 1000MS Memory limit: 65536K 题目描述According to Wikipedia, Cryptography is “the practice and study of hiding information” and this is exactly what Alex is lo原创 2013-03-17 16:28:59 · 816 阅读 · 0 评论 -
hdu Pixel density 2411
Pixel density Time Limit: 1000MS Memory limit: 65536K 题目描述 Pixels per inch (PPI) or pixel density is a measurement of the resolution of devices in various contexts; typically computer displa原创 2013-02-28 20:40:47 · 625 阅读 · 0 评论 -
Substrings hdu
SubstringsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5336 Accepted Submission(s): 2371Problem DescriptionYou are given a n原创 2013-03-06 21:49:38 · 990 阅读 · 0 评论 -
字符串 练习
做了一下大一的字符串题 主要是练习一下string的用法 地址:http://acm.sdut.edu.cn/sdutoj/contest_show.php?contest_id=1136 第一题:#include#includeusing namespace std;int main(){ string str1,str2; while(原创 2013-01-26 20:25:12 · 654 阅读 · 0 评论 -
字符串的处理
25、strtol函数名:strtol功 能:将串转换为长整数用 法:long strtol(char *str, char **endptr, int base);程序例:#include #include int main(void){ char *string = "87654321", *endptr; long lnumbe原创 2013-01-25 17:36:05 · 572 阅读 · 0 评论 -
NEFU要崛起——第4场 B - Center Alignment
B -Center Alignment Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u DescriptionAlmost every text editor has a buil原创 2012-12-14 11:13:10 · 608 阅读 · 1 评论 -
NEFU要崛起——第3场 C - Registration system
C -Registration system Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u原创 2012-12-14 10:39:49 · 636 阅读 · 0 评论 -
NEFU要崛起——第5场 B - President's Office
B -President's Office Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Sta原创 2012-12-14 11:24:24 · 846 阅读 · 1 评论 -
NEFU要崛起——第4场 A - Chat Server's Outgoing Traffic
A -Chat Server's Outgoing Traffic Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u原创 2012-12-14 10:57:34 · 569 阅读 · 0 评论 -
NEFU要崛起——第2场 A - Shortest path of the king
A -Shortest path of the king Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u原创 2012-12-14 10:24:19 · 439 阅读 · 0 评论 -
codeforces--NEFU要崛起——第1场 " B - Winne
B -Winner Time Limit:1000MSMemory Limit:65536KB 64bit IO Format:%I64d & %I64u DescriptionThe winner of the card game popular in Berland "Berlogg原创 2012-11-27 12:29:43 · 626 阅读 · 0 评论 -
"codeforces--NEFU要崛起——第1场 " A - Theatre Square
A -Theatre Square Limit:2000MSMemory Limit:65536KB 64bit IO Format:%I64d & %I64u DescriptionTheatre Square in the capital city of Berland has a rectangula原创 2012-11-27 12:39:18 · 573 阅读 · 0 评论 -
poj 2141
Message DecowdingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10590 Accepted: 5849DescriptionThe cows are thrilled because they've just learned about e原创 2012-11-05 20:05:52 · 803 阅读 · 2 评论 -
poj 1750
DictionaryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2123 Accepted: 647DescriptionAuthors of the new, all-in-one encyclopedia have organized the titl原创 2012-11-04 21:02:08 · 1131 阅读 · 1 评论 -
排列 next_permutation的应用
C++的STL有一个函数可以方便地生成全排列,这就是next_permutation 在C++ Reference中查看了一下next_permutation的函数声明:#include bool next_permutation( iterator start, iterator end );The next_permutation() function attempts t原创 2013-02-28 20:46:22 · 468 阅读 · 0 评论