代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/109624/7003708
cpp 3.cpp
//判断输入的数字串是否为偶数，用mod 2完成
#include
#include
#include
#define BASELEN 10
#define INCRENTMENT 10
void main()
{
char *p;
FILE *fp;
long Num=0;
int i=0;
in
www.eeworm.com/read/467355/7010630
c logp.c
# include "link.h"
float Ligand::Get_LogP()
{
int i,num;
float xlogp=0.000;
for(i=0;i
www.eeworm.com/read/467355/7010806
c pocket.c
# include "pocket.h"
Pocket::Pocket()
{
max_x=max_y=max_z=-999;
min_x=min_y=min_z=999;
grid=NULL; num_grid=0;
feature=NULL; num_feature=0;
}
Pocket::~Pocket()
{
delete [] grid;
www.eeworm.com/read/467355/7010838
c logp.c
# include "grow.h"
float Ligand::Get_LogP()
{
int i,num;
float xlogp=0.000;
for(i=0;i
www.eeworm.com/read/467161/7019323
m ch1example1prg2.m
% ch1example1prg2.m
g=9.8; % 重力加速度
for L=1:5 % 仿真重复5次以便于观察
v=0; % 初始速度
s=0; % 初始位置
t=0;
dt=0.01;% 计算步长
for k=1:200
v=v+g*dt; % 速度
s=s+v*dt;
www.eeworm.com/read/466855/7022085
m exa120501.m
%--------------------------------------------------------------------------
% exa120501.m, for example 12.5.1 and fig12.5.3
%-----------------------------------------------------------------------
www.eeworm.com/read/466855/7022139
m exa120502.m
%--------------------------------------------------------------------------
% exa120502.m, for example 12.5.2 and fig12.5.4
%-----------------------------------------------------------------------
www.eeworm.com/read/466869/7022349
java test.java
import java.io.*;
public class Test {
public static void main(String[] args) throws IOException {
WordAnal wa = new WordAnal();
String readfilename = "test.txt";
String savefilename =
www.eeworm.com/read/466555/7026797
txt miaobiao.txt
#include
void init();
sbit P26=P1^0;
sbit P27=P1^1;
sbit P36=P1^2;
sbit key=P2^0;
unsigned char i,t0,x,down,wait,dispbuf[3],m,num;
unsigned char code table[]=
{
0xc0,0xf9,0xa4,0xb
www.eeworm.com/read/466324/7032672
java exercise4_10.java
// Exercise4_10.java: Display prime numbers
public class Exercise4_10 {
public static void main(String[] args) {
int count = 0;
for (int i = 2; count < 1000; i++) {
// Display e