186464-CSDN博客

原创 [C++]1007 Maximum Subsequence Sum (25 分)

1007 Maximum Subsequence Sum (25 分)Given a sequence ofKintegers {N1,N2, ...,NK}. A continuous subsequence is defined to be {Ni,Ni+1, ...,Nj} where1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of...

2021-11-08 23:22:58 552

原创 [C++]1006 Sign In and Sign Out (25 分)

1006 Sign In and Sign Out (25 分)At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find

2021-11-08 22:41:30 93

原创 [C++]1005 Spell It Right (20 分)

1005 Spell It Right (20 分)Given a non-negative integerN, your task is to compute the sum of all the digits ofN, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Each case occupies one line whi..

2021-11-07 21:44:14 482

原创 1004 Counting Leaves (30 分)

1004 Counting Leaves (30 分)A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts with a line containing0&l.

2021-11-07 20:31:51 72

原创 1003 Emergency (25 分)

1003 Emergency (25 分)As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pa

2021-11-07 16:13:55 39

原创 1001 A+B Format (20 分)

1001 A+B Format (20 分)Calculatea+band output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits).Input Specification:Each input file contains one test case. Eac..

2021-11-07 14:53:54 147

原创 1002 A+B for Polynomials (25 分)

This time, you are supposed to findA+BwhereAandBare two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:KN1aN1N2aN2...NKaNK...

2021-11-07 12:04:56 173

单词长度（c语言）（简易）（新手）

题目内容：你的程序要读入一行文本，其中以空格分隔为若干个单词，以‘.’结束。你要输出这行文本中每个单词的长度。这里的单词与语言无关，可以包括各种符号，比如“it's”算一个单词，长度为4。注意，行中可能出现连续的空格。输入格式: 输入在一行中给出一行文本，以‘.’结束，结尾的句号不能计算在最后一个单词的长度内。输出格式：在一行中输出这行文本对应的单词的长度，每个长度之间以空格隔开，行末没有最后的空格。输入样例： It's great to see you here. 输出样例： 4 5 2 3 3 4 时间限制：500ms内存限制：32000kb

2021-07-11

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人