- 博客(5)
- 收藏
- 关注
RSS订阅原创 2013年辽宁省赛 NEU1311 Rightmost non-zero Digit in N!
1311: Rightmost non-zero Digit in N!时间限制: 2 Sec 内存限制: 128 MB提交: 67 解决: 3题目描述The expression N!, read as "N factorial," denotes the product of the first N positive in
2013-06-28 20:22:35
1020
2
原创 uva 11889 - Benefit
11889 - Benefit Benefit Recently Yaghoub is playing a new trick to sell some more. When somebody gives him A Tomans, he who never has appropriate changes, asks for B
2013-05-23 15:31:52
995
原创 NEUOJ-1235 Palindrome Substring
NEUOJ-1235 Palindrome SubstringDescription Mourinho is a CS student studying in NEU. One day, he learns an English word 'palindrome' from a dictionary. A palindrome is a word or phra
2013-05-23 15:29:11
494
原创 NEUOJ: 1299: 磊磊的难题
1299: 磊磊的难题题目描述最近磊磊迷上了coding，立志要做一个苦逼的程序员 ^o^ ，他遇到了这样一个神题：要求从小到大输出两个小数之间的所有分母不超过10w的最简分数。磊磊郁闷了， 他甚至都不知道这样的分数有多少个~ 于是他向你投来了哀怨的眼神……输入要求每组数据有5个数，a，b，c，d，n（其中 a 且 a*d ），且5个数字都不超过10万。
2013-05-23 15:26:45
834
原创 NEUOJ 1262: ASCII Sequence II
NEUOJ 1262: ASCII Sequence IIDescription Given two number string of the same length, we assume their distance is the sum of every number at the same position difference. For example
2013-05-23 15:23:34
443
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人