Problem Description
Let A=∑ni=1ai?10n?i(1≤ai≤9)(n is the number of A’s digits). We call A as “beautiful number” if and only if a[i]≥a[i+1] when 1≤i/****************************************************...
分类：
其他好文 时间：
2015-03-01 14:30:19
阅读次数：
91
字符串统计问题，统计每个字符串的次数，输出出现次数最多的字符串#include#include#includeusing namespace std;int main(){int N,i,redex;while (cin >> N&&N!=0){string str[1000];int number...
分类：
编程语言 时间：
2015-03-01 14:26:09
阅读次数：
139
#include#includeusing namespace std;struct Student{ char ID[15]; int score,final_rank,location_number,local_rank; //分数，总排名，考场号，场内排名}STU[30010];bool...
分类：
其他好文 时间：
2015-03-01 14:24:00
阅读次数：
127
beautiful number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 136 Accepted Submission(s): 78
Problem Description
Let A=∑ni=1a...
分类：
其他好文 时间：
2015-03-01 13:19:55
阅读次数：
167
题目Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a)...
分类：
其他好文 时间：
2015-03-01 13:18:01
阅读次数：
124
[LeetCode] 009. Palindrome Number (Easy) (C++/Java/Python)...
分类：
编程语言 时间：
2015-03-01 10:32:57
阅读次数：
246
A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a pr...
分类：
其他好文 时间：
2015-02-28 21:46:29
阅读次数：
187
Problem Description
Nim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects provided they all come from t...
分类：
其他好文 时间：
2015-02-28 21:42:57
阅读次数：
266
Balanced numbers have been used by mathematicians for centuries. A positive integer is considered a balanced number if:1) Every even digit appears an odd number of times in its decimal representat...
分类：
其他好文 时间：
2015-02-28 21:40:21
阅读次数：
112
本文是在学习中的总结，欢迎转载但请注明出处：http://blog.csdn.net/pistolove/article/details/43989997
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the...
分类：
其他好文 时间：
2015-02-28 21:39:28
阅读次数：
164
