代码搜索：Num

找到约 10,000 项符合「Num」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/330400/6944822

g1n graph.g1n

num label 10 A 24 B 12 C 7 D 34 E 15 F 19 G
·
www.eeworm.com/read/221940/6955980

cs matrix.cs

namespace Opus6 { using System; using System.Reflection; [Version("$Id: Matrix.cs,v 1.6 2001/10/28 19:50:09 brpreiss Exp $"), Copyright("Copyright (c) 2001 by Bruno R. Preiss, P.Eng.
·
www.eeworm.com/read/415022/6956226

m dinfo.m

%displays the information about people MANUALLY %ldinfo.m displays the same information after the recognitiopn automaticly clc clear all jk=input('Please Type the ID Number or Name of the person
·
www.eeworm.com/read/414333/6960823

c pi_mc.c

/* NAME: Pi_mc: PI Monte Carlo Purpose: This program uses a Monte Carlo algorithm to compute PI as an example of how random number generators are used to solve problems. Note th
·
www.eeworm.com/read/212797/6962556

m vtb3_5.m

function [ap,bp]=vtb3_5(a0,a,b,N,T) %VTB3_5 Plot Fourier Series Approximation of Function. % VTB3_5(a0,a,b,N,T) Plot the Fourier series defined by: % N is the number of terms. Other arguments as de
·
www.eeworm.com/read/426165/6965157

c main.c

#include void maopao(int tempArray[],int index)//冒泡排序 {int i,j,temp; for(i=index;i>0;i--) { for(j=0;jtempArray[j+1]) { temp=tempArra
·
www.eeworm.com/read/465112/6966683

c filter.c

#include #include #include "lpcdefs.h" #include "filter.h" /* -------------------------------- FILTER_CREATE -------------------------------- */ FILTER *filter_crea
·
www.eeworm.com/read/289163/6969311

m c8_snrexample.m

% File: c8 snrexample.m kpts = 1024; % FFT Block size k = 1:kpts; % sample index vector fd = 2; % desired signal frequ
·
www.eeworm.com/read/469371/6973801

cc 2831898_ac_468ms_1104k.cc

#include using namespace std; typedef struct { int p; int rank; }node; node mg[100001]; int n,m,t; char h; int find(int x,int &k) { k=0; while(x!=mg[x]
·
www.eeworm.com/read/469371/6973802

cpp 2831894_ce.cpp

#include using namespace std; typedef struct { int p; int rank; }node; node mg[100001]; int n,m,t; char h; int find(int x,int &k) { k=0; while(x!=mg[x]
·