代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/280878/10283651
c 15ikey0.c
#define HEAPSORT struct student
#define KEY age
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include
www.eeworm.com/read/280777/10292488
bak btree.cpp.bak
/*第4题 二叉树操作--源代码及关键源代码注解如下：*/
// By Dror Helper. last updated 23.1.2002
#include // Dror Helper I.D. 034354712
#include // sample main for RB tree
#include"RBtree.h"
i
www.eeworm.com/read/280777/10292503
cpp btree.cpp
/*二叉树操作--源代码及关键源代码注解如下：*/
#include
#include
#include"RBtree.h"
int main()
{
ifstream data("BTREE.txt", ios::in|ios::nocreate);
if(data.bad())
{
cout
www.eeworm.com/read/426022/10293680
java saizi.java
package women;
public class Saizi {
public static void main(String[] args)
{
int num1,num2,log1=0,log2=0,log3=0;
float index;
for(int i=0;i
www.eeworm.com/read/426022/10293689
java saizi.java
package women;
public class Saizi {
public static void main(String[] args)
{
int num1,num2,log1=0,log2=0,log3=0;
float index;
for(int i=0;i
www.eeworm.com/read/162541/10297660
txt 整数组成图(216.2).txt
#include
void main()
{
int num,i,j;
//接受用户输入
printf("请输入一个数:");
scanf("%d",&num);
//打印上半部分
for (i=num;i>=1;i--)
{
for (j=1;j
www.eeworm.com/read/280638/10301630
m test.m
radius=2.5;
area=pi*2.5^2;
string=['the area of the circle is',num2str(area)];
disp(string);
www.eeworm.com/read/425953/10305792
m mcm_explicit.m
%%% 本程序采用显示方案实现“平均曲率运动(MCM)”模型
clear;
clc;
%%- 读取曲线数据所在的文件
[filename, pathname] = uigetfile( ...
{
'*.c', 'All c-Files (*.c)'; ...
'*.dat', 'All tif-Files (*.dat)'; ...
'*.*'
www.eeworm.com/read/425953/10305885
m mcm_explicit.m
%%% 本程序采用显示方案实现“平均曲率运动(MCM)”模型
clear;
clc;
%%- 读取曲线数据所在的文件
[filename, pathname] = uigetfile( ...
{
'*.c', 'All c-Files (*.c)'; ...
'*.dat', 'All tif-Files (*.dat)'; ...
'*.*'
www.eeworm.com/read/425953/10305956
m mcm_explicit.m
%%% 本程序采用显示方案实现“平均曲率运动(MCM)”模型
clear;
clc;
%%- 读取曲线数据所在的文件
[filename, pathname] = uigetfile( ...
{
'*.c', 'All c-Files (*.c)'; ...
'*.dat', 'All tif-Files (*.dat)'; ...
'*.*'