Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - arrays c
Search - arrays c - List
DL : 0
A tutorial on pointers and arrays in C
Date : 2025-12-16 Size : 27kb User : 黄东

使用数组精确计算M/N(0<M<N<=100)的值。如果M/N是无限循环小数,则计算并输出它的第一循环节,同时要求输出 循环节的起止位置(小数位的序号) *问题分析与算法设计 由于计算机字长的限制,常规的浮点运算都有精度限制,为了得到高精度的计算结果,就必须自行设计实现方法。 为了实现高精度的计算,可将商存放在一维数组中,数组的每个元素存放一位十进制数,即商的第一位存放在第一个元素中,商的第二位存放在第二个元素中....,依次类推。这样就可以使用数组不表示一个高精度的计算结果。 进行除法运算时可以模拟人的手工操作,即每次求出商的第一位后,将余数乘以10,再计算商的下一位,重复以上过程,当某次计算后的余数为0 时,表示M/N为有限不循环小数某次计算后的余数与前面的某个余数相同时,则M/N为无限循环小数,从该余数第一次出现之后所求得的各位数就是小数的循环节。 程序具体实现时,采用了数组和其它一些技巧来保存除法运算所得到的余数和商的各位数。 -arrays precise calculation of the M/N (0lt; Mlt; Nlt; = 100) value. If M/N is unlimited circulator, calculated and exporting its first cycle of festivals, while output cycle requirements of section starting and ending location (number of decimal places)* Analysis and design of computer algorithms size limitations, conventional precision floating-point operations have restrictions, in order to have a high-precision the results, we must design their own method. In order to achieve high precision calculations can be stored in a business-dimensional arrays, each array element placed a decimal number, the first one in a storage element, the second in the second storage element ..., followed by analogy. This array can use it does not mean that a highly accurate results. For computing divisi
Date : 2025-12-16 Size : 1kb User : 姚紫欣

清华出版社出版,严蔚敏和吴伟民编写的,C语言版数据结构参考程序,有线性表、栈和队列、串、数组和广义表、树和二叉树、图、动态存储器、查找-Tsinghua University Publishing House, Yan Wei-min and Xiulan WU Weimin prepared by the C language version of the reference program data structure, linear scale stack and Queue, strings, arrays and generalized form, tree and binary tree, graphics, dynamic memory, you
Date : 2025-12-16 Size : 41kb User : fanyan

DL : 0
求整数的质因数分解(采用了数组).c.rar 可以求出整数的质因数-for the quality factor decomposition (using the arrays). C.rar integers can be calculated the quality factor
Date : 2025-12-16 Size : 2kb User : z

DL : 0
魔力游戏伤害计算器源码c#编写,用数组进行数据存储,对经常pk的人有很大帮助-magic of the game hurt calculators source c# prepared with data storage arrays, on the regular pk be very helpful
Date : 2025-12-16 Size : 47kb User : cyh

华东师范大学(面向对象程序设计基于C++)课程全部作业(12次)代码,包含一个大整数类。(包含作业内容) 1 How to use VC++ & IBM Visual Age (XL) C++ 2 Pointers, Arrays and Structures 3 Operators & Statements 4 Functions 5 Use of classes in STL 6 Define concrete classes 7 Data abstraction 8 Operator Overloading 9 Define integer type with arbitrary precision 10 Virtual functions 11 Templates 12 Exception handling -East China Normal University (object-oriented programming based on the C++) Courses all operations (12) code, contains a large integer type. (Including operational content) 1 How to use VC++
Date : 2025-12-16 Size : 409kb User : Nick

DL : 0
1.c企业发放的奖金根据利润提成。 2.c 计算器 3.c 班级通信录 4.c 求x的y方的低三位值 5.c a b 两数组分别正逆序相加-1.c enterprises bonuses paid under the profit percentage. 2.c Calculator 3.c class communications recorded 4.c of y for x 3 the value of the low side 5.cab reverse the two arrays are the sum of the respective
Date : 2025-12-16 Size : 5kb User : yuyu

C语言的小算法,包括链表,汉偌塔,进制转换,数组,数据结构等-Small C language algorithms, including linked lists, Han Ruo-tower, hexadecimal conversion, arrays, data structures, etc.
Date : 2025-12-16 Size : 451kb User : 周期

This C++ application calculates home loan analysis with parallel arrays.
Date : 2025-12-16 Size : 1kb User : joshuacollins

本程序是用分支定界法求最短路径的程序,用C++编写。采取的基本思想是:使用最小优先队列分支界限法来构建程序,细节是对于每个节点,包含三个变量:当前走过的路径长度、当前的花费和该节点对应的实际城市的编号。关于确定节点优先级,我们规定首先以“当前走过的路径长度”来确定优先级,当路径长度相等时,以“当前的花费”来确定优先级。同时,我们还定义两个数组dist[i]和pric[i]保存当前求得的从源城市到每个城市的最短距离和花费,用于剪枝时的评判标准。-This procedure is to use branch and bound procedure for seeking the shortest path, using C++ to implement. The basic idea is: Using the minimum priority queue Branch and Bound method to build a program, the details are: for each node, containing three varibles: the current path length traversed, the current cost and the node number corresponding to the actual city. On the determination of priorities, we first use the current path length traversed to determine the priority if the path length is equal, then current cost is used to determine priority. At the same time, we also define two arrays dist [i] and the pric [i] to save the current shortest distance and cost from the source city to every other city . This will be used as the evaluation criterion when pruning.
Date : 2025-12-16 Size : 60kb User : 李贺

DL : 0
c语言array应用程序,共有十几个小实例,初学者必备程序教程。- c language array applications, a total of a dozen small examples, beginners must tutorial.
Date : 2025-12-16 Size : 13kb User : kitty

从键盘输入一行字符(假设少于30个字符),分别统计其中数字、字母、空格和其他字符的个数,函数复制,数组求和,删除不符合的字符信息-Enter a line of characters from the keyboard (assuming less than 30 characters), respectively, where the number of statistical numbers, letters, spaces and other characters, and copy functions, arrays sum, delete character information does not meet the
Date : 2025-12-16 Size : 5kb User : 叶炜

Array manipulations in C-Array manipulations in C++
Date : 2025-12-16 Size : 1kb User : Toqeer Mahmood

c语言学习不得不掌握的几个代码,包含数组,函数,结构体的运用,是初学者要学习的几个小例子-c language learning have to master a few code, including the use of arrays, functions, structures, and a few small examples for beginners to learn
Date : 2025-12-16 Size : 51kb User : aa

DL : 0
含随机出题(四则运算)及其迭代程序、返回数组中最大子数组和及其迭代程序等。-Software class operations, including four operations and iterative procedure, returns an array of sub-arrays and the largest and Iterative procedures
Date : 2025-12-16 Size : 18.42mb User : 申霆

DL : 1
Create arrays in c-Create arrays in c++
Date : 2025-12-16 Size : 1kb User : borism

DL : 0
Sort arrays by bucket sort, only numbers
Date : 2025-12-16 Size : 92kb User : elMopendor

leetcode 原创代码 Median of Two Sorted Arrays There are two sorted arrays A and B of size m and n respectively. Find the median of the two sortedarrays. The overall run time complexity should be O(log(m + n)).(2.1.5 Median of Two Sorted Arrays There are two sorted arrays A and B of size m and n respectively. Find the median of the two sortedarrays. The overall run time complexity should be O(log(m + n)).)
Date : 2025-12-16 Size : 3.52mb User : 每日一题

DL : 0
Homework about how to use arrays in C++
Date : 2025-12-16 Size : 4.85mb User : mpho5772

Programming 1 -Arrays intro to c#
Date : 2025-12-16 Size : 126kb User : moh-92
« 12 3 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.