登录
首页 » C++ » Fibonacci

Fibonacci

于 2010-11-24 发布 文件大小:1KB
0 97
下载积分: 1 下载次数: 3

代码说明:

  Gives the user s desired number of Fibonacci Sequence

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

发表评论

0 个回复

  • CProgram.rar
    说明:  实现了很多的数据结构算法,适合与想学习数据结构编程的读者。(achieve a lot of data structure algorithms, fit and want to learn data structure programming readers.)
    2006-04-05 16:52:57下载
    积分:1
  • Csendmail
    这是一个实现用C语言发送电子邮件的小程序,可以把截获的键盘记录发送给监控的主机。(This is a realization of C language small program to send email, you can send intercepted keyloggers monitored host.)
    2013-07-28 19:00:36下载
    积分:1
  • 抗积分饱和PID算法及仿真抗积分饱PIDsimulation2
    抗积分饱和PID控制算法及仿真抗积分饱和PID控制算法及仿真抗积分饱和PID控制算法及仿真抗积分饱和PID控制算法及仿真(Anti-integral saturation PID control algorithm and simulation)
    2020-07-07 19:38:56下载
    积分:1
  • 声音技术
    说明:  在dos下声音的处理pc喇叭发声,声卡技术,WAV文件的播放技术(voice processing pc speakers audible, audio technology, WAV file playback technology)
    2005-12-02 21:38:44下载
    积分:1
  • StringDataManage
    控制台下的字符串管理程序,并且带有好看的节面(使用其他人的库)(String under the console management program, and with a good-looking face of the section (using other people s libraries))
    2012-11-22 01:26:14下载
    积分:1
  • 347013
    OPNET 无线仿真 PPT + 源码 好好学习吧(OPNET wireless simulation PPT source code)
    2019-01-04 05:14:51下载
    积分:1
  • FRWS
    Script File for remote restart or shutdown computer
    2011-01-11 03:00:10下载
    积分:1
  • 窗口震动
    对控制台窗口操作进行抖动,通过窗口句柄找到控制台窗口,通过快速移动窗口位置实现抖动效果(The operation of the console window is jittered, the console window is found by the window handle, and the jitter effect is achieved by moving the window position quickly.)
    2019-05-02 00:38:53下载
    积分:1
  • Desktop
    调度问题的回溯算法,算法中的经典问题。问题描述:假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
    2010-02-19 23:31:11下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • 696522资源总数
  • 104042会员总数
  • 18今日下载