代码搜索:数字识别

找到约 10,000 项符合「数字识别」的源代码

代码结果 10,000
www.eeworm.com/read/450798/7476776

c 数字移动.c

#include int a[]={0,1,2,5,8,7,6,3}; int b[9]; int c[9]; int count=0; main() { int i,j,k,t; void print(); printf("Please enter original order of digits 1~8: "); for(i=0;i
www.eeworm.com/read/449694/7498069

c 数字移动.c

#include int a[]={0,1,2,5,8,7,6,3}; int b[9]; int c[9]; int count=0; main() { int i,j,k,t; void print(); printf("Please enter original order of digits 1~8: "); for(i=0;i
www.eeworm.com/read/447573/7549405

cpp 数字游戏.cpp

#include using namespace std; const int N = 2009; int n, m, a[N], b[N], f[N]={0}; void QSort( int h, int t ); // b >= >= int main(){ cin >>n >>m; int i, j, k; for(
www.eeworm.com/read/443588/7630368

数字钟

www.eeworm.com/read/439388/7711359

asm 数字显示.asm

ORG 000H AJMP MAIN ORG 0003H CLR EX0 RETI ORG 000BH CLR ET0 RETI ORG 0013H CLR EX1 RETI ORG 001BH CLR ET1 RETI ORG 0023H RETI MAIN:MOV 50H,#11 MOV 51H,#7 MOV 52H,#
www.eeworm.com/read/439388/7711365

bin 数字显示.bin

www.eeworm.com/read/439388/7711366

hex 数字显示.hex

www.eeworm.com/read/298817/7933426

c 数字移动.c

#include int a[]={0,1,2,5,8,7,6,3}; int b[9]; int c[9]; int count=0; main() { int i,j,k,t; void print(); printf("Please enter original order of digits 1~8: "); for(i=0;i
www.eeworm.com/read/332124/12777511

c 数字移动.c

#include int a[]={0,1,2,5,8,7,6,3}; int b[9]; int c[9]; int count=0; main() { int i,j,k,t; void print(); printf("Please enter original order of digits 1~8: "); for(i=0;i
www.eeworm.com/read/243633/12930876

c 数字移动.c

#include int a[]={0,1,2,5,8,7,6,3}; int b[9]; int c[9]; int count=0; main() { int i,j,k,t; void print(); printf("Please enter original order of digits 1~8: "); for(i=0;i