上一页 1 ··· 5 6 7 8 9 10 11 下一页
摘要: 时间日期格式转换Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6582Accepted: 3079Description世 界各地有多种格式来表示日期和时间。对于日期的常用格式,在中国常采用格式的是“年年年年/月月/日日”或写为英语缩略表示的”yyyy/mm/dd”, 此次编程大赛的启动日期“2009/11/07”就是符合这种格式的一个日期,而北美所用的日期格式则为“月月/日日/年年年年”或”mm/dd /yyyy”,如将“2009/11/07”改成这种格式,对应的则是”11/07/2009”。对于时间的格式,则常有12小时制 阅读全文
posted @ 2013-05-19 20:03 ~~Snail~~ 阅读(347) 评论(0) 推荐(0) 编辑
摘要: 破译密码Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7014Accepted: 4406Description据说最早的密码来自于罗马的凯撒大帝。消息加密的办法是:对消息原文中的每个字母,分别用该字母之后的第5个字母替换(例如:消息原文中的每个字母A都分别替换成字母F)。而你要获得消息原文,也就是要将这个过程反过来。密码字母:A B C D E F G H I J K L M N O P Q R S T U V W X Y Z原文字母:V W X Y Z A B C D E F G H I J K L M N O P Q R 阅读全文
posted @ 2013-05-18 19:05 ~~Snail~~ 阅读(228) 评论(0) 推荐(0) 编辑
摘要: 字母旋转游戏Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7053Accepted: 2642Description给定两个整数M,N,生成一个M*N的矩阵,矩阵中元素取值为A至Z的26个字母中的一个,A在左上角,其余各数按顺时针方向旋转前进,依次递增放置,当超过26时又从A开始填充。例如,当M=5,N=8时,矩阵中的内容如下: A B C D E F G H V W X Y Z A B I U J K L M N C J ... 阅读全文
posted @ 2013-05-17 21:58 ~~Snail~~ 阅读(151) 评论(0) 推荐(0) 编辑
摘要: The Circumference of the CircleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6480Accepted: 4077DescriptionTo calculate the circumference of a circle seems to be an easy task - provided you know its diameter. But what if you don't? You are given the cartesian coordinates of three non-c 阅读全文
posted @ 2013-05-17 21:23 ~~Snail~~ 阅读(207) 评论(0) 推荐(0) 编辑
摘要: Pre-Post-erous!Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1976Accepted: 1206DescriptionWe are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal of a binary tree when given the i 阅读全文
posted @ 2013-05-17 18:42 ~~Snail~~ 阅读(386) 评论(0) 推荐(0) 编辑
摘要: Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9354Accepted: 5868DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her creation 阅读全文
posted @ 2013-05-16 20:00 ~~Snail~~ 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Machined SurfacesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 2473Accepted: 1588DescriptionAn imaging device furnishes digital images of two machined surfaces that eventually will be assembled in contact with each other. The roughness of this final contact is to be estimated. A digital i 阅读全文
posted @ 2013-05-15 17:46 ~~Snail~~ 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 人见人爱A^BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16211 Accepted Submission(s): 11450 Problem Description求A^B的最后三位数表示的整数。 说明:A^B的含义是“A的B次方”Input输入数据包含多个测试实例,每个实例占一行,由两个正整数A和B组成(1<=A,B<=10000),如果A=0, B=0,则表示输入数据的结束,不做处理。Output对于每个测试实例,请 阅读全文
posted @ 2013-05-14 21:11 ~~Snail~~ 阅读(112) 评论(0) 推荐(0) 编辑
摘要: Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27899 Accepted Submission(s): 13476 Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequ 阅读全文
posted @ 2013-05-14 21:04 ~~Snail~~ 阅读(129) 评论(0) 推荐(0) 编辑
摘要: HumidexTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13478Accepted: 4959DescriptionAdapted from Wikipedia, the free encyclopediaThe humidex is a measurement used by Canadian meteorologists to reflect the combined effect of heat and humidity. It differs from the heat index used in the Unit 阅读全文
posted @ 2013-05-14 20:52 ~~Snail~~ 阅读(143) 评论(0) 推荐(0) 编辑
摘要: Reduced ID NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8197Accepted: 3300DescriptionT. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an integer in the range 0 ≤ s ≤ MaxSIN with MaxSIN = 106-1. 阅读全文
posted @ 2013-05-13 19:46 ~~Snail~~ 阅读(184) 评论(0) 推荐(0) 编辑
摘要: 字符串替换Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8278Accepted: 3907Description编写一个C程序实现将字符串中的所有"you"替换成"we"Input输入包含多行数据每行数据是一个字符串,长度不超过1000数据以EOF结束Output对于输入的每一行,输出替换后的字符串Sample Inputyou are what you doSample Outputwe are what we do如此大水居然CE一次,好心疼T^T[C++] 1 #include& 阅读全文
posted @ 2013-05-13 18:40 ~~Snail~~ 阅读(155) 评论(0) 推荐(0) 编辑
摘要: 组合素数Time Limit 1000msMemory Limit 65536Kdescription小明的爸爸从外面旅游回来给她带来了一个礼物,小明高兴地跑回自己的房间,拆开一看是一个很大棋盘(非常大),小明有所失望。不过没过几天发现了大棋盘的好玩之处。从起点(0,0)走到终点(n,n)的非降路径数是C(2n,n),现在小明随机取出1个素数p, 他想知道C(2n,n)恰好被p整除多少次?小明想了很长时间都没想出来,现在想请你帮助小明解决这个问题,对于你来说应该不难吧! input有多组测试数据。第一行是一个正整数T,表示测试数据的组数。接下来每组2个数分别是n和p的值,这里1<=... 阅读全文
posted @ 2013-05-13 18:16 ~~Snail~~ 阅读(197) 评论(0) 推荐(0) 编辑
摘要: n!后面有多少个0Time Limit 1000msMemory Limit 65536Kdescription从输入中读取一个数n,求出n!中末尾0的个数。 input输入有若干行。第一行上有一个整数m,指明接下来的数字的个数。然后是m行,每一行包含一个确定的正整数n,1<=n<=1000000000。 output对输入行中的每一个数据n,输出一行,其内容是n!中末尾0的个数。 sample_input331001024 sample_output024253数论基础题,应用结论: n!的素因子分解中,素数p的幂为:[n/p]+[n/(p^... 阅读全文
posted @ 2013-05-13 16:51 ~~Snail~~ 阅读(178) 评论(0) 推荐(0) 编辑
摘要: Ural 1022: http://www.cnblogs.com/lzj-0218/archive/2013/05/12/3074527.html 阅读全文
posted @ 2013-05-12 21:01 ~~Snail~~ 阅读(114) 评论(0) 推荐(0) 编辑
摘要: 1022. Genealogical TreeTime limit: 1.0 second Memory limit: 64 MBBackgroundThe system of Martians’ blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather together in different groups, so that a Martian can have one parent as well as ten. Nobody wi 阅读全文
posted @ 2013-05-12 21:00 ~~Snail~~ 阅读(205) 评论(0) 推荐(0) 编辑
摘要: Prime DistanceTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9195Accepted: 2490DescriptionThe branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primali 阅读全文
posted @ 2013-05-12 20:48 ~~Snail~~ 阅读(600) 评论(0) 推荐(0) 编辑
摘要: The Perfect StallTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15710Accepted: 7176DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For th 阅读全文
posted @ 2013-05-12 20:36 ~~Snail~~ 阅读(143) 评论(0) 推荐(0) 编辑
摘要: Sorting It All OutTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 23404Accepted: 8093DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, 阅读全文
posted @ 2013-05-12 20:04 ~~Snail~~ 阅读(204) 评论(0) 推荐(0) 编辑
摘要: Judging OlympiaTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7155Accepted: 3392DescriptionFor years, a group of Regional Contest Directors (RCDs) of the ACM International Collegiate Programming Contest (ICPC) have been unsatisfied with the way contest submissions get ranked. The group see 阅读全文
posted @ 2013-05-11 13:32 ~~Snail~~ 阅读(227) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 下一页