代码搜索：arccos
找到约 68 项符合「arccos」的源代码
代码结果 68
www.eeworm.com/read/439490/7707866
c arccos.c
#include
#include
#define DOMAIN 1
#define SING 2
#define OVERFLOW 3 /* overflow error */
#define UNDERFLOW 4 /* underflow error */
#define TLOSS 5
#define PLOSS 6
#de
www.eeworm.com/read/111530/6154292
txt arccos.txt
E:\MyWorks\PenBex13\PBXSDK\src\FGWork\Large\arccos.bmp
Colors : Gray
Width : 33
Height : 12
WORD
0x626D,0x0400,0x0021,0x000C,0x0000,0x0000,0x0000,0x0000,0x0000,0x0000,// 10
0x0000,0x0000,0x000
www.eeworm.com/read/284346/4066117
arccos h.arccos
* * * * * * * * * * *
* arcsin, arccos *
* arctan, arccot *
* * * * * * * * * * *
"arcussinus
www.eeworm.com/read/273938/10894393
cpp rw_gfa.cpp
#include "stdafx.h"
#include "rw_gfa.h"
#include "math.h"
#define PI 3.14159265358979323846
CString strChar_(WORD DecimalZahl)
{
CString string;
string.Format("%c", DecimalZahl);
return
www.eeworm.com/read/440423/7689530
cpp rw_gfa.cpp
#include "stdafx.h"
#include "rw_gfa.h"
#include "math.h"
#define PI 3.14159265358979323846
CString strChar_(WORD DecimalZahl)
{
CString string;
string.Format("%c", DecimalZahl);
return
www.eeworm.com/read/272894/10937150
dpr ex.dpr
{
check(a,b,p,q) //p>=q
let the diagonal of the rectangle with edge a,b be L
let the rectangle with edge p,q be Rect
let the center of the rectangle be O
Discuss at which points the circle O
www.eeworm.com/read/184327/9109602
pas ac1136.pas
program tju1136;
const
maxn=100;
maxm=1000;
var
x,y,z:array[0..maxn]of word;
s,e:array[0..maxm*2]of byte;
time:array[-1..maxm*2]of extended;
v:array[1..maxm*2]of boolean;
n,m,ta
www.eeworm.com/read/353423/10448507
bas trigofunc.bas
Attribute VB_Name = "trigofunc"
' ==========================================
' Dijkstra's algorithm to find Shortest Path
' ==========================================
'
' E.W. Dijkstra is a Du
www.eeworm.com/read/272894/10936999
dpr ex.dpr
{$N+}
program Ural_1075(Input, Output);
type
TData = Extended;
function ArcCos(X: TData): TData;
begin
if X = 0 then
ArcCos := Pi / 2
else if X < 0 then
ArcCos :
www.eeworm.com/read/246404/12727480
pas ac1136.pas
program tju1136;
const
maxn=100;
maxm=1000;
var
x,y,z:array[0..maxn]of word;
s,e:array[0..maxm*2]of byte;
time:array[-1..maxm*2]of extended;
v:array[1..maxm*2]of boolean;
n,m,ta