代码搜索:Sign
找到约 10,000 项符合「Sign」的源代码
代码结果 10,000
www.eeworm.com/read/481966/6634288
cpp 1221.cpp
/* This Code is Submitted by wywcgs for Problem 1221 on 2005-10-03 at 00:28:10 */
#include
#include
int main()
{
double power;
long long total, r;
int p, sign, i;
www.eeworm.com/read/479135/6699609
h operation.h
#include
#include
#include
#include
#include
#include
#define LEN 200
#define L_STR 10000
using namespace std;
typedef s
www.eeworm.com/read/263437/11362673
java signedmutablebiginteger.java
/*
* Copyright 2003 Sun Microsystems, Inc. All rights reserved.
* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
*/
/*
* @(#)SignedMutableBigInteger.java 1.8 03/01/23
*/
package
www.eeworm.com/read/407141/11428536
m neg_loglog.m
function h = neg_loglog(x,y,h, varargin)
% h = neg_loglog(x,y,h, varargin)
%
% neg_loglog.m is part of the CR1Dmod forward modeling package, and contains
% the code used to plot data-sets with
www.eeworm.com/read/404153/11491063
asm example 2-28.asm
;Example 2 - 28. Float-Point Addition ASM Listing for TMS320C54x
;/* ============================================================================*/
;/* Copyright (C) 2004 YINXING TECHN
www.eeworm.com/read/404153/11491072
asm example 2-30.asm
;Example 2 - 30. Float-Point Multiplication ASM Listing for TMS320C54x
;/* ============================================================================*/
;/* Copyright (C) 2004 YINXI
www.eeworm.com/read/404153/11491077
asm example 2-29.asm
;Example 2 - 29. Float-Point Subtraction ASM Listing for TMS320C54x
;/* ============================================================================*/
;/* Copyright (C) 2004 YINXING TE
www.eeworm.com/read/348208/11606136
java signfunction.java
public class SignFunction{
public static void main(String args[]) {
int intx;
intx=0;
if(intx>0)
System.out.println("The sign of "+intx+" is + ;");
www.eeworm.com/read/261097/11666714
m gensignal.m
function [X]=GenSignal(Num)
%产生BPSK信号
X=rand(1,Num)-0.5;
X=sign(X);
www.eeworm.com/read/260908/11687465
cpp 1019.cpp
#include
#include
using namespace std;
char position[1000];
int start[1000] , end[1000] , n , m ;
int dfs(int step,int x,int y,int a[105][105],int nn)
{
int game , flag=0 ,