代码搜索：盒维数
找到约 10,000 项符合「盒维数」的源代码
代码结果 10,000
www.eeworm.com/read/300587/13904226
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/135367/13937676
ppt 数的识别.ppt
www.eeworm.com/read/134640/13978715
txt 随机数.txt
01010100101100100000010101111010000000100010110001010000001001110000011001110100011111011000000000011010011100100000110110001001001001011110110101011001011110000001001110100011010001011110101000101111
www.eeworm.com/read/236748/14000188
txt 随机数.txt
#include "iostream.h"
#include "stdlib.h"
int main(int argc, char* argv[])
{
int num;
coutnum)
{
int b=0,f=0,i;
for(i=0;i
www.eeworm.com/read/133496/14038699
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/203529/15356479
cpp 优先数调度.cpp
#include
#define running 1 //用running表示进程处于运行态
#define aready 2 //用aready表示进程处于就绪态
#define blocking 3 //用blockin
www.eeworm.com/read/107030/15614507
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