代码搜索:舒服点

找到约 10,000 项符合「舒服点」的源代码

代码结果 10,000
www.eeworm.com/read/147473/6315732

m fmap1.m

%例6.5,fmap1.m % clear pi=3.1416; x=0:0.5*pi/99:0.5*pi; P=[sin(x);cos(x)]; %画圆 plot(P(1,:),P(2,:),'b.'); %画输入点图 axis('equal') [R,Q]=size(P); S=20; W0=r
www.eeworm.com/read/422575/6327494

cpp cappack2.cpp

// CapPack2.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include "pcap.h" #include "inc.h" #include "windows.h" #pragma comment(lib, "wpcap.lib") #pragma comment(lib, "ws2_32") void An
www.eeworm.com/read/283218/6339727

cpp snake.cpp

// 贪食蛇.cpp : 定义应用程序的入口点。 // //#include "stdafx.h" //#include "贪食蛇.h" #define MAX_LOADSTRING 100 //#define N_FOOD 4 // 全局变量: HINSTANCE hInst; // 当前实例 HWND hWnd1; TCHAR szTitle[MAX
www.eeworm.com/read/494702/6360695

txt 2009-2-20-pku1511.txt

一个SPFA()的算法! !!!!!!!!! #include #include const int MAX=1000005; const int INF=0x7fffffff; typedef struct Node { //邻接表 int next;//边的开始点 int to;//边的目的点 int distance;//边
www.eeworm.com/read/494121/6378807

html readme_zh_cn.html

 自述文件——代码点输入法 代码
www.eeworm.com/read/490168/6459892

m dft.m

function [Xk] = dft(xn,N) % 计算离散付利叶变换 % ----------------------------------- % [Xk] = dft(xn,N) % Xk = 在0
www.eeworm.com/read/487101/6523591

cpp mygame.cpp

// mygame.cpp : 定义应用程序的入口点。 // #include "stdafx.h" #include "mygame.h" #define MAX_LOADSTRING 100 bool g_bActive = true; Cpplayer player1; xg rl; boss b; LP_BITMAPX ppp=NULL; LP_BITMAPX
www.eeworm.com/read/482610/6619802

cpp p294.cpp

#include "p292.cpp" #include "iostream.h" template void AOVGraph::TopologicalSort ( ) { //对n个顶点的AOV网进行拓扑排序。top是入度为零顶点栈的栈顶指针。 int top
www.eeworm.com/read/480047/6675911

asm fir.asm

.include 240x.h .global start,FIR .data .include "lowpass.inc" ;低通滤波器系数(32个) N .set 32 ;32点FIR滤波 DPTRI .set 8000h ;输入波形地址 DPTRO .set 0a000h ;输出波形地址 i
www.eeworm.com/read/480149/6678112

m sequen.m

%定义变量a a=[15,20,25,30,35]; %定义变量b b=[1554.88,1555.24,1555.76,1556.20,1556.68]; figure(1) %使用缺省设置进行作图,以a为横轴,b为纵轴 plot(a,b) hold on %用红色标志’x’画出相关的点 plot(a,b,'rx');