登录
首页 » Visual C++ » 3

3

于 2013-09-11 发布 文件大小:28KB
0 247
下载积分: 1 下载次数: 2

代码说明:

  用刷选法求出100之内的素数。并输出数有多少个。(100 prime number is calculated by the method of selection. And the output count how many.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • MICRO
    电磁场圣经,林为干院士的书,学习电磁场重要材料(EMF Bible, it' s dry academician of the book, an important material for studying the electromagnetic field)
    2016-06-29 20:30:23下载
    积分:1
  • udf-RPE
    fluent 改进的全空化模型,针对可压缩流,内有声速处理(fluent improved full cavitation model for compressible flow, there are the speed of sound processing)
    2021-03-02 16:59:33下载
    积分:1
  • juzhen
    矩阵的练习 对于掌握数组的 概念很重要。如何快速掌握数组,灵活运用。(The practice of the matrix is ​ ​ very important to grasp the concept of the array. How to quickly grasp the array of flexible use.)
    2012-06-29 11:34:40下载
    积分:1
  • Curve_fitting
    对平面上给定的多点进行多项式曲线的拟合,可设置拟合多项式的次数(Given more points on the plane polynomial curve fitting, you can set the number of polynomial fitting)
    2021-02-14 15:29:49下载
    积分:1
  • C_P
    恒温减压沸腾UDF,一个基于压力计算的水蒸发UDF程序,请大家探讨一下(boiling udf of costant T and decreasing P)
    2011-12-19 11:41:40下载
    积分:1
  • ShortDistance
    本算法是求取点到曲线的距离,希望对大家有帮助(the algorithm is to strike a point of the distance curve, and I hope to be helpful)
    2006-11-09 10:48:00下载
    积分:1
  • 82859165cifa
    编程序,按如下要求来求解n元一次线性方程组(假设方程组具有唯一解)。 (1)方程个数n之值由用户通过键盘输入; (2)方程组存放在“增广矩阵”A之中,而n行n+1列的A存储空间通过new来动态分配,且A的各元素值也由用户通过键盘输入 (Allocation procedures, the following requirements to solve the n-a system of linear equations (assuming a unique solution of equations). (1) the number n of the value equation by the user through the keyboard input (2) equations stored in the augmented matrix A, while n line n+ 1 column A storage space through the new dynamically allocated, and A The value of each element by the user through the keyboard input)
    2011-06-21 22:50:34下载
    积分:1
  • Riemann-solver
    程序是关于计算两相黎曼问题的一个求解器。可以直接设置。(The code is a solver about the two-phase Riemann problem. the user can use it directly.)
    2016-06-28 13:52:45下载
    积分:1
  • na7
    Orthogonal Polynomials Approximation 数值分析,计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
    2011-11-27 11:47:21下载
    积分:1
  • 20036127002
    反密法在数值计算中的地位就不用我来一一列举了,此程序就可以轻易的使其实现。(anti-secret numerical calculation method in the position I would not have to list them one by one, this procedure can easily achieve it.)
    2006-11-24 18:26:46下载
    积分:1
  • 696516资源总数
  • 106918会员总数
  • 4今日下载