代码搜索：盒维数
找到约 10,000 项符合「盒维数」的源代码
代码结果 10,000
www.eeworm.com/read/391742/8382310
cpp 数的遍历.cpp
#include
//#include
#define INFINITY 32767
#define MAX_VEX 20 //最大顶点个数
#define QUEUE_SIZE (MAX_VEX+1) //队列长度
using namespace std;
bool *visited; //访问标志数组
//图的邻接矩阵存储
www.eeworm.com/read/289579/8541665
c 阿姆斯特朗数.c
#include
main()
{
int i,t,k,a[3];
printf("There are following Armstrong number smaller than 1000: \n");
for(i=152;i=10;t++)
{
a[t]=(i%k)/(k/1
www.eeworm.com/read/388569/8600037
cpp 1406 完数.cpp
/*
1406 完数
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 256 K
15 MS 344 KB 874 B
GUN C++
*/
#include
#include
using namespace std;
const int Max=100
www.eeworm.com/read/388569/8600267
cpp 1261 字串数.cpp
/*
1261 字串数
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 256 K
GUN C++
*/
//组合公式很简单，组合运算量不大，只涉及大数乘除
#include
#include
#include
#include
www.eeworm.com/read/383930/8910579
txt 随机数.txt
import java.util.Arrays;
import java.util.Random;
/**
* RandomUtil - Random Tool Class.
* @author SageZk
* @version 1.0
*/
public class RandomUtil {
private RandomUtil
www.eeworm.com/read/383612/8932634
txt 统计叶子数.txt
#include
#include
typedef struct node
{ char data;
struct node *lchild,*rchild;
}JD;
void countleaf(JD *bt,int *count)//先序统计叶子数
{ if(bt!=NULL)
{ if((bt->lc
www.eeworm.com/read/382229/9041615
txt 主保数.txt
ORG 00H
LJMP STRAT
ORG 0003H
LJMP WAIDUAN
ORG 0BH
LJMP INT_T0
STRAT: SETB EA
SETB EX0
SETB IT0
MOV P1,#09H
MAIN:
www.eeworm.com/read/381930/9062790
cpp 数塔问题.cpp
#include
#include
using namespace std;
int main()
{
int array[5][5]={{9},
/* */{12,15},
/* */{10,6,8},
/* */{2,18,9,5},
/*
www.eeworm.com/read/381930/9062794
txt 数塔问题.txt
#include
#include
using namespace std;
int main()
{
int array[5][5]={{9},
/* */{12,15},
/* */{10,6,8},
/* */{2,18,9,5},
/*
www.eeworm.com/read/376627/9311568
c 阿姆斯特朗数.c
#include
main()
{
int i,t,k,a[3];
printf("There are following Armstrong number smaller than 1000: \n");
for(i=152;i=10;t++)
{
a[t]=(i%k)/(k/1