2011 年 9月 1 日随笔档案 - more think, more gains

Text Formatting

摘要： Text FormattingpTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionYour chief judge is getting long in the tooth and it is getting increasingly difficult for him to read through the densely-written messages of complaints about the problems and s 阅读全文

posted @ 2011-09-01 14:44 more think, more gains 阅读(202) 评论(0) 推荐(0) 编辑

happy 2009

摘要： Happy 2009Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1242Accepted Submission(s): 429Problem DescriptionNo matter you know me or not. Bless you happy in 2009.InputThe input contains multiple test cases.Each test case included one string. There 阅读全文

posted @ 2011-09-01 14:34 more think, more gains 阅读(175) 评论(0) 推荐(0) 编辑

hdu 3787

摘要： A+BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 367Accepted Submission(s): 255Problem Description给定两个整数A和B，其表示形式是：从个位开始，每三位数用逗号","隔开。现在请计算A+B的结果，并以正常形式输出。Input输入包含多组数据数据，每组数据占一行，由两个整数A和B组成（-10^9 < A,B < 10^9）。Output请计算A+B的结果，并以正常阅读全文

posted @ 2011-09-01 12:42 more think, more gains 阅读(209) 评论(0) 推荐(0) 编辑

剪花布条

摘要：剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2960Accepted Submission(s): 1990Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少阅读全文

posted @ 2011-09-01 12:28 more think, more gains 阅读(174) 评论(0) 推荐(0) 编辑

ip 计算

摘要： IP的计算Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3825Accepted Submission(s): 701Problem Description在网络课程上，我学到了很多有关IP的知识。IP全称叫网际协议，有时我们又用IP来指代我们的IP网络地址，现在IPV4下用一个32位无符号整数来表示，一般用点分方式来显示，点将IP地址分成4个部分，每个部分为8位，表示成一个无符号整数（因此不需要用正号出现），如192.168.100.16，阅读全文

posted @ 2011-09-01 12:24 more think, more gains 阅读(295) 评论(0) 推荐(0) 编辑

排序

摘要：排序Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16414Accepted Submission(s): 4195Problem Description输入一行数字，如果我们把这行数字中的‘5’都看成空格，那么就得到一行用空格分割的若干非负整数（可能有些整数以‘0’开头，这些头部的‘0’应该被忽略掉，除非这个整数就是由若干个‘0’组成的，这时这个整数就是0）。你的任务是：对这些分割得到的整数，依从小到大的顺序排序输出。Input输入包含多组阅读全文

posted @ 2011-09-01 11:19 more think, more gains 阅读(190) 评论(0) 推荐(0) 编辑

How to Type

摘要： How to TypeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 868Accepted Submission(s): 373Problem DescriptionPirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing fo 阅读全文

posted @ 2011-09-01 11:15 more think, more gains 阅读(206) 评论(0) 推荐(0) 编辑

hdu 2054

摘要： (有更新)2011ACM/ICPC亚洲区中国大陆5个赛区信息汇集~A == B ?Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29789Accepted Submission(s): 4579Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or print "NO" 阅读全文

posted @ 2011-09-01 11:08 more think, more gains 阅读(252) 评论(0) 推荐(0) 编辑

hdu 1062

摘要： #include <stdio.h>#include <string.h>#include <stdlib.h>char str[110];char ch[110];void reverse( ){ int len, p, q; p = strlen(ch) - 1; for(q = 0; q < p; q++, p--) { char c = ch[q]; ch[q] = ch[p]; ch[p] = c; } printf("%s",ch);}int main( ){ int T, i, k; scanf(... 阅读全文

posted @ 2011-09-01 11:00 more think, more gains 阅读(197) 评论(0) 推荐(0) 编辑