laymenISmouse的专栏

今天第一次做杭电的acm题，初看1000感觉非常简单，但是我这样写完提交出去时，总是报wrong answer!，My God,我太天真啦！ #include using namespace std; int main() { int a,b; cin >> a >> b; cout << a+b << endl; return 0; } 杭电1000题

算法导论---逆序对 p24题，2-4 修改合并排序 基本思路见p17 分解 -解决- 合并

题目描述 计算字符串最后一个单词的长度，单词以空格隔开。 输入描述: 一行字符串，非空，长度小于5000。 输出描述: 整数N，最后一个单词的长度。 输入例子: hello world 输出例子: 5

题目描述 密码要求:       1.长度超过8位       2.包括大小写字母.数字.其它符号,以上四种至少三种       3.不能有相同长度超2的子串重复       说明:长度超过2的子串 输入描述: 一组或多组长度超过2的子符串。每组占一行 输出描述: 如果符合要求输出：OK，否则输出NG 输入例子: 021A

杭电题1005 Tick and Tick Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16425    Accepted Submission(s): 3970 Problem Description The

Quoit Design Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 43918    Accepted Submission(s): 11417 Problem Description Have you ever

Number Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 145531    Accepted Submission(s): 35358 Problem Description A number se

杭电题1004 Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When th

杭电题1003 Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (

package demo; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int number = sc.nextInt(); int shuzu[] = new int[num