字符串
文章平均质量分 83
risker_2013
这个作者很懒,什么都没留下…
展开
-
hdu 2029 Palindromes _easy version
Palindromes _easy version Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16712 Accepted Submission(s): 10501 Problem Description原创 2013-08-02 14:22:11 · 640 阅读 · 0 评论 -
hdu 4891 The Great Pan 2014多校联合第三场
The Great Pan Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1713 Accepted Submission(s): 349 Problem Description As a progr原创 2014-07-31 17:59:14 · 761 阅读 · 0 评论 -
zoj 3406 Another Very Easy Task
#include #include #include #include #include using namespace std; int main() { char a[10010]; int i,j,k; while(gets(a)!=NULL) { // printf("%s\n",a); int t=strlen(a); int tt=0,原创 2014-05-20 21:18:08 · 1220 阅读 · 0 评论 -
poj 2752 Seek the Name, Seek the Fame(KMP)
点击打开题目链接 Seek the Name, Seek the Fame Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 11198 Accepted: 5457 Description The little cat is so famous原创 2014-05-08 21:36:56 · 416 阅读 · 0 评论 -
CROC-MBTU 2012, Elimination Round (ACM-ICPC)
代码很烂,将就着看吧~ 点击打开题目链接 A. System Administrator 水题 代码: #include #include #include #include #include using namespace std; int main() { double a,b,c; int n,i,j,k; double sum1,sum2,s1原创 2014-04-21 16:20:49 · 704 阅读 · 0 评论 -
nefu 677 Gift
Time Time Limit 1000ms Memory Limit 65536K description Digital clock use 4 digits to express time, each digit is described by 3*3 characters (in原创 2014-05-05 16:09:09 · 532 阅读 · 0 评论 -
Codeforces Round #142 (Div. 2) C. Shifts
C. Shifts time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a table consisting of n rows and m原创 2014-04-03 13:25:03 · 744 阅读 · 0 评论 -
Codeforces Round #141 (Div. 2)
题目链接 B. Two Tables time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You've got two rectan原创 2014-03-31 19:42:27 · 724 阅读 · 0 评论 -
Poj 3461 Oulipo(KMP算法)
Description The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tout avait Pair n原创 2013-10-17 21:37:28 · 679 阅读 · 0 评论 -
hdu 1062 Text Reverse(字符串处理,简单模拟)
Text Reverse Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13435 Accepted Submission(s): 5138 Problem Description Ignatius lik原创 2013-09-03 21:13:06 · 971 阅读 · 0 评论 -
hdu 1161 Eddy's mistakes
Eddy's mistakes Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6158 Accepted Submission(s): 3497 Problem Description Eddy usual原创 2013-09-01 13:15:13 · 538 阅读 · 0 评论 -
hdu 1060 Leftmost Digit
Leftmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11006 Accepted Submission(s): 4213 Problem Description Given a po原创 2013-08-28 20:57:09 · 531 阅读 · 0 评论 -
hdu 1013 Digital Roots
Digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 39984 Accepted Submission(s): 12322 Problem Description The digita原创 2013-08-24 14:46:34 · 567 阅读 · 0 评论 -
uva 10706 Number Sequence
Number Sequence Input: standard input Output: standard output Time Limit: 1 second A single positive integer i is given. Write a program to find the digit located in the position i in the sequ原创 2013-08-12 12:06:02 · 640 阅读 · 0 评论 -
uva 10340 All in All
All in All Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB You have devised a new encryption technique which encodes a message by inserting between its cha原创 2013-08-12 11:56:57 · 575 阅读 · 0 评论 -
UVA 10905 Children's Game
Description 4thIIUCInter-University Programming Contest, 2005 A Children’s Game Input: standard input Output: standard output Problemsetter: Md. Kam原创 2013-08-10 14:25:14 · 502 阅读 · 0 评论 -
UVA 10025 The ? 1 ? 2 ? ... ? n = k problem
给定任意一个值k,使k=(-)1+(-)2+(-)3+(-)4+(-)5++++(-)n,求最小的n 思路:S1=1+2+3+.....+n>=k,S2=1+2+3+...-x+...+n==k 所以S1-S2=2x,所以只要有一个数导致S1和S2差为偶数就符合条件 #include #include int main() {原创 2013-08-04 20:56:02 · 588 阅读 · 0 评论 -
hdu 2030 汉字统计
汉字统计Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18125 Accepted Submission(s): 9980 Problem Description统计给定文本文件中汉字的个数。 Input输入文件首先包含一个整原创 2013-08-02 15:37:42 · 451 阅读 · 0 评论 -
Ural 1993 This cheeseburger you don't need
1993. This cheeseburger you don't need Time limit: 1.0 second Memory limit: 64 MB Yoda: May the Force be with you. Master Yoda is the oldest member of the Jedi Council. He conducts原创 2014-07-31 18:21:51 · 609 阅读 · 0 评论