代码搜索：float
找到约 10,000 项符合「float」的源代码
代码结果 10,000
www.eeworm.com/read/175456/9547310
c munwrap.c
#include
#include
#include
#include "msp.h"
void munwrap(float phase[],int n)
{
/*----------------------------------------------------------------------
Routine
www.eeworm.com/read/371466/9552743
cpp main.cpp
//---------------------------------------------------------------------------
#include
#include
#include
#pragma hdrstop
#include "warning.h"
#include "home.h"
#
www.eeworm.com/read/371355/9554791
cpp 标准pso.cpp
#include"stdio.h"
#include"stdlib.h"
#include"time.h"
#include"math.h"
#define rdint(i)(rand()%(int)(i))
#define rdft()(float)((double)rdint(16384)/(16383.0))
#define rnd(a,b) (rdint((int)(b
www.eeworm.com/read/175226/9555254
cpp list0502.cpp
#include
float Convert(float);
int main()
{
using namespace std;
float TempFer;
float TempCel;
cout
www.eeworm.com/read/175157/9557381
cpp rgb-hsv.cpp
/******************************************************************************
* 下面两个函数实现rgb和hsv的互相转换
* r,g,b 的值在 0 到 1 之间
* h = [0,360], s = [0,1], v = [0,1]
* if s == 0, then h = -1 (undefi
www.eeworm.com/read/175155/9557401
cpp 线性规划(单纯形ii).cpp
#include
#include
#include
#define M 30000
int r,c; //global parameter row and colum;
int turn = 1;
int variable = 0; //自变量个数,初始化为零,在main函数中设定
int restri
www.eeworm.com/read/175073/9561178
cpp knapsacktwoinone.cpp
#include
using namespace std;
const int max=100000000u;
int c[20][1000];
int vpw[20]={0};
int Max(int x,int y)
{
if(x>y)
return x;
return y;
}
inline void Swap(in
www.eeworm.com/read/371105/9568037
c 99.c
main()
#include "stdio.h"
main()
{
float peven(),podd(),dcall();
float sum;
int n;
while (1)
{
scanf("%d",&n);
if(n>1)
break;
}
if(n%2==0)
{printf("Even=");
sum=dcall(peven,n);
}
else
www.eeworm.com/read/371105/9568082
c 6.c
# define N 5
main( )
{
int x , num[N+1] ;
float st[N+1] , ave , sum=0;
for (x=1 ; x
www.eeworm.com/read/371050/9570072
h settings.h
/*****************************************************************************************
* SEU-3D
* ---------------------------------------