随笔分类 -  hdu

摘要：模拟题, 枚举1002 1004 1013 1015 1017 1020 1022 1029 1031 1033 1034 1035 1036 1037 1039 1042 1047 1048 1049 1050 1057 1062 1063 1064 1070 1073 1075 1082 1083 1084 1088 1106 1107 1113 1117 1119 1128 1129 1144 1148 1157 1161 1170 1172 1177 1197 1200 1201 1202 1205 1209 1212(大数取模) 1216（链表）1218 1219 1225 1228 阅读全文

摘要：96300652013-11-20 11:27:36Accepted2015125MS4916K657 BJavajack偶数求和Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37775Accepted Submission(s): 16338Problem Description有一个长度为n(n<=100)的数列，该数列定义为从2开始的递增有序偶数，现在要求你按照顺序每m个数求出一个平均值，如果最后不足m个，则以实际数量求平均值。编 阅读全文

摘要：96298832013-11-20 10:41:39Accepted2028140MS5008K554 BJavajackLowest Common Multiple Plushttp://acm.hdu.edu.cn/showproblem.php?pid=2028Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27749Accepted Submission(s): 11198Problem Description求n个数的最小公倍数。In 阅读全文

摘要：Problem CTime Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 66Accepted Submission(s) : 8Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Descriptionlily的好朋友xiaoou333最近很空，他想了一件没有什么意义的事情，就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这个问题。Input有多组数据， 阅读全文

摘要：Problem FTime Limit : 3000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 65Accepted Submission(s) : 9Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description在网络课程上，我学到了很多有关IP的知识。IP全称叫网际协议，有时我们又用IP来指代我们的IP网络地址，现在IPV4下用一个32位无符号整数来表示，一般用点分方式来显示，点将IP地 阅读全文

摘要：Problem BTime Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 122Accepted Submission(s) : 12Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or p 阅读全文

摘要：import java.util.Scanner;public class hdu1003 {public static void main(String[] args) {Scanner cin = new Scanner(System.in);while (cin.hasNext()) {String a = cin.nextLine();try {String[] arr;int flag = 0;int flag2 = 0;arr = a.split("\\.");int p=0;for(int i=0;i 0) && (arr[i].length( 阅读全文