代码搜索结果
找到约 10,000 项符合
N 的代码
@n=d
Index of /courses/GD/jsj/GD_jsj_008b/chap02/rm
Index of /courses/GD/jsj/GD_jsj_008b/chap02/
@n=d
Index of /courses/GD/jsj/GD_jsj_008b/chap02/image
Index of /courses/GD/jsj/GD_jsj_008b/chap
9.4.1 n
NJMP:
MOV A,R3
MOV DPTR,#JMPTBL
MOVC A,@A+DPTR
JMP @A-t-DPTR
JMPTBL:
DB MEMO-JMPTBL
DB MEM1-JMPTBL
DB MEM2-JMPTBL
DB MEM3-JMPTBL
MEMO:
MOV A,@R0
RET
MEM1:
MOVX A,@R0
for.n
'\"
'\" Copyright (c) 1993 The Regents of the University of California.
'\" Copyright (c) 1994-1997 Sun Microsystems, Inc.
'\"
'\" See the file "license.terms" for information on usage and redistribut
if.n
'\"
'\" Copyright (c) 1993 The Regents of the University of California.
'\" Copyright (c) 1994-1996 Sun Microsystems, Inc.
'\"
'\" See the file "license.terms" for information on usage and redistribut
n+-
/*
* File: queen.c
* Description: 求 N 皇后问题回溯算法
* Created: 2001/11/12
* Author: Justin Hou [mailto:justin_hou@hotmail.com]
*/
#include
#define DelayTime 20000 /* 显示棋
n!.cpp
#include
#include
#include
int n;
void count()
{
int m,flag=0,top=1,zero=0,fac[10000]={0},add[10000]={0};
fac[1]=1;
int i,j;
for(i=1;i
@n=d
Index of /~hollingd/netprog/projects/p2/proj2.tests
Index of /~hollingd/netprog/projects/p2
@n=d
Index of /~hollingd/netprog/projects/p2/proj2.tests/docs
Index of /~hollingd/netprog/projec
@n=d
Index of /~hollingd/netprog/projects/p1/testcode
Index of /~hollingd/netprog/projects/p1/te