代码搜索：预置数
找到约 10,000 项符合「预置数」的源代码
代码结果 10,000
www.eeworm.com/read/257403/11931918
pwi 摸数转换.pwi
www.eeworm.com/read/256090/12029376
pdf 留数定理.pdf
www.eeworm.com/read/132217/14104307
doc 产生随即数.doc
www.eeworm.com/read/233105/14169185
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/129383/14248316
asm 拨号显数.asm
ORG 0
MOV DPTR,#TAB0
MOV P1,#01H
STA1: SETB C
MOV R0,#01
ASP: MOV P0,#0FFH
MOV A,P0
ASP1: RRC A
JNC LED
INC R0
CJNE R0,#9,ASP1
SJMP ST
www.eeworm.com/read/127418/14355997
txt 而叉数.txt
全屏阅读 【版面名称】：Prolog【版主】：徵求中【讨论区】：电脑技术第1页/共1页(总计1笔)
打包
发信人: wave(驰浪)
题 目: 二叉树的遍历与搜索
发信站: 【蜘蛛网虚拟社区】 (发表於 2001-05-17 14:39:55)
二叉树（binary tree）是
www.eeworm.com/read/227639/14418697
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/223140/14654327
frm 统计字符数.frm
VERSION 5.00
Begin VB.Form Frmcharacter
Caption = "统计字符个数"
ClientHeight = 3120
ClientLeft = 60
ClientTop = 345
ClientWidth = 3375
LinkTopi
www.eeworm.com/read/122580/14681868
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/121611/14749096
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