Search - ie - CodeBus

Search - ie - List

[Mathimatics-Numerical algorithms] 2136 DL : 0: 北京大学ACM比赛题目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.-Peking University ACM Competition Title Write a program to read four lines of upper case (ie, all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter ( but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
Date : 2026-01-09 Size : 2kb User : pengfam
[Mathimatics-Numerical algorithms] mopsoGECCO.tar DL : 0: The last step in training phase is refinement of the clusters found above. Although DynamicClustering counters all the basic k-means disadvantages, setting the intra-cluster similarity r may require experimentation. Also, a cluster may have a lot in common with another, i.e., sequences assigned to it are as close to it as they are to another cluster. There may also be denser sub-clusters within the larger ones. -The last step in training phase is refinement of the clustersfound above. Although DynamicClustering counters all thebasic k-means disadvantages, setting the intra-cluster similarityr may require experimentation. Also, a cluster mayhave a lot in common with another, ie, sequences assignedto it are as close to it as they are to another cluster. Theremay also be denser sub-clusters within the larger ones.
Date : 2026-01-09 Size : 39kb User : yznushuangyu
[Mathimatics-Numerical algorithms] soduku DL : 0: 数独游戏:是一种源自18世纪末瑞士的数学智力拼图游戏。拼图是九宫格（即3格宽×3格高）的正方形状，每一格又细分为一个九宫格。在每一个小九宫格中，分别填上1至9的数字，让整个大九宫格每一列、每一行的数字都不重复。数独的玩法逻辑简单，数字排列方式千变万化。不少教育者认为数独是锻炼脑筋的好方法。-Sudoku: a late 18th century from the Swiss mathematical intelligence jigsaw puzzle. Puzzle is the squares (ie, 3 cells wide × 3 grid H) of square-shaped, each divided into a fine grid squares. Small squares in each of the respective fill in the figures 1-9, so that the whole big squares in each row, each row will not repeat the figures. The logic of playing Sudoku is simple, the arrangement of the ever-changing figures. Many educators think Sudoku is a good way to exercise their brains.
Date : 2026-01-09 Size : 421kb User : zk
[Mathimatics-Numerical algorithms] xxcz DL : 0: 对于f(x)=1/(1+x^2) (-5<= x <=5) 要求选取11个等距插值节点，分别采用拉格朗日插值和分段线性插值，计算x为0.5, 4.5处的函数值并将结果与精确值进行比较。输入：区间长度，n(即n+1个节点)，预测点输出：预测点的近似函数值，精确值，及误差 -For f (x) = 1/(1+ x ^ 2) (-5 < = x < = 5) asked to select 11 equidistant interpolation nodes, respectively, using the Lagrange interpolation and piecewise linear interpolation to calculate x for the 0.5, 4.5 and the results of the function values compared with the accurate value. Input: interval length, n (ie n+1 nodes), the forecast points, Output: forecast of the approximate function value points, accurate values, and error
Date : 2026-01-09 Size : 1kb User : loseheaven
[Mathimatics-Numerical algorithms] Klinjin DL : 0: 近邻法的基本思想是在测试样本x的k个近邻中，按出现的样本类别来作为x的类别，即先对x的k个近邻一找出它们的类别，然后对x类别进行判别，即在N个训练样本中，找出x的k个近邻。-The basic idea is that neighbors in a test sample x, k-nearest neighbor in categories according to the sample appears as a type of x, ie the first k nearest neighbors of x, find them a category and then determine categories of x, ie In the N training samples, find x, k-nearest neighbor.
Date : 2026-01-09 Size : 30kb User : 岳经凯
[Mathimatics-Numerical algorithms] Redraimen DL : 0: 主算法就是费波纳西数列，即Fib[j]=Fib[j-1]+Fib[j-2] 由于从地第0阶到第N阶的总共方法就是服从费波纳西数列的，故可以用该算法求出总共的方法数。用一个数组Redr[]接收输入数据，即用while循环实现数据输入，用for循环实现费波纳西数列即Fib[]数组，用Fib[]数组对Redr[]数组中的每个数据成员进行求总的方法数，然后用remember[]数组存储每组输入数据的总方法数，最后用for循环输出-Main algorithm is Feibonaxi series that Fib [j] = Fib [j-1]+ Fib [j-2] the order from to 0 to N is to obey the order of the total Feibonaxi series, so The algorithm can be obtained by total number of methods. With an array Redr [] to receive input data, ie data input with a while loop with a for loop to achieve Feibonaxi series that Fib [] array, with Fib [] array to Redr [] array is evaluated for each data member the total number of ways, and then remember [] array of input data stored in each of the total number of ways, with the final output for loop
Date : 2026-01-09 Size : 4kb User : 张维
[Mathimatics-Numerical algorithms] uva-333 DL : 0: 输入一串字符串（首尾允许有空格，长度小于等于80），判断其是否为Good ISBN，并按要求输出 ISBN(国际标准书号)：通常是由10个数字(0,1…9)组成，但第十位可能为X(代表数字10)，数字之间会有连字符（即‘-’) -Enter the string of a string (both spaces are allowed, length less than or equal 80), to determine whether it is Good ISBN, as required output ISBN (International Standard Book Number): usually by 10 digits (0,1 ... 9) composition, but may be the tenth X (representing the number 10), there will be a hyphen between the numbers (ie, ' -' )
Date : 2026-01-09 Size : 3kb User : 冰绡流潦
[Mathimatics-Numerical algorithms] youjing DL : 0: 这是一个关于油井开发的问题，通过编程找出最短的开发路线-it is a project of c++,i hope ie will help you and if it has error please contact with me
Date : 2026-01-09 Size : 874kb User : 肖遥雪锡
[Mathimatics-Numerical algorithms] gui_jie_tui_li DL : 0: 本推理系统可用于命题、谓词、注解命题和注解谓词的自动推理，系统自动识别是何种类型推理。注解命题和注解谓词的推理可以解决一般的推理中的不协调问题（即系统中存在矛盾）-The reasoning system can be used proposition, predicate, annotations and comments predicate of propositional reasoning, the system automatically recognizes what type inference. Annotations and comments predicate proposition reasoning can solve the general problem of uncoordinated reasoning (ie, contradictions exist in the system)
Date : 2026-01-09 Size : 270kb User : pw
[Mathimatics-Numerical algorithms] student DL : 0: 学生成绩管理系统记录了学生的成绩情况。它包括：学生班级、姓名、学号、各科成绩及各科是否及格和相应的学分（系统预置的科目有三个，分别是数学、语文、英语，本系统用户可以设定任意多课程的相关信息，但缺点是用户必须打开存储的文档，事先在文档里边按照一定格式修改）、学生最后的学分绩（即 GPA）。-翻译学生成绩管理系统记录了学生的成绩情况。它包括：学生班级、姓名、学号、各科成绩及各科是否及格和相应的学分（系统预置的科目有三个，分别是数学、语文、英语，本系统用户可以设定任意多课程的相关信息，但缺点是用户必须打开存储的文档，事先在文档里边按照一定格式修改）、学生最后的学分绩（即 GPA）。 Student achievement management system records the case of student achievement. It includes: the student class, name, student number, whether passing all subjects and subjects and corresponding credits (System Preferences three subjects, namely mathematics, language, English, in this system the user can set any number of courses relevant information, but the drawback is that users must open documents stored in advance in accordance with a certain format to modify the document inside), student performance last credits (ie GPA).
Date : 2026-01-09 Size : 7.06mb User : 刘有希