代码搜索：Digit
找到约 4,689 项符合「Digit」的源代码
代码结果 4,689
www.eeworm.com/read/240249/13229155
txt readme.txt
These digits were created by Chris Williams of www.PowerASP.com from scratch.
Primarily to be used with any counter systems.
If this digit archive is distributed in any
way this text file must
www.eeworm.com/read/240249/13229176
txt readme.txt
These digits were created by Chris Williams of www.PowerASP.com from scratch.
Primarily to be used with any counter systems.
If this digit archive is distributed in any
way this text file must
www.eeworm.com/read/240249/13229197
txt readme.txt
These digits were created by Chris Williams of www.PowerASP.com from scratch.
Primarily to be used with any counter systems.
If this digit archive is distributed in any
way this text file must
www.eeworm.com/read/240249/13229218
txt readme.txt
These digits were created by Chris Williams of www.PowerASP.com from scratch.
Primarily to be used with any counter systems.
If this digit archive is distributed in any
way this text file must
www.eeworm.com/read/240249/13229241
txt readme.txt
These digits were created by Chris Williams of www.PowerASP.com from scratch.
Primarily to be used with any counter systems.
If this digit archive is distributed in any
way this text file must
www.eeworm.com/read/319348/13453174
h fraction.h
#ifndef FRACTION_H
#define FRACTION_H
#include
using namespace std;
int count(int a); //cout the digit numbers of an integer
class fraction
{
friend ostream &operator
www.eeworm.com/read/101082/6243401
1a l17.1a
#print
Write in a program which reads its input and writes it
out line numbered, with a three-digit line number (starting at one)
followed by a single space and then by the original line.
Note: the pr
www.eeworm.com/read/100601/6267403
txt div.txt
Division
This describes the division algorithm used by the MPI library.
Input: a, b; a > b
Compute: Q, R; a = Qb + R
The input numbers are normalized so that the high-order digit of b is
at lea
www.eeworm.com/read/488224/6498632
m program_15_1.m
% Program 15_1
% Dual-Tone Multifrequency Tone Detection
% Using the DFT
%
clf;
d = input('Type in the telephone digit = ', 's');
symbol = abs(d);
tm = [49 50 51
www.eeworm.com/read/254742/12121124
m program_15_1.m
% Program 15_1
% Dual-Tone Multifrequency Tone Detection
% Using the DFT
%
clf;
d = input('Type in the telephone digit = ', 's');
symbol = abs(d);
tm = [49 50 51