代码搜索：OPERATION
找到约 10,000 项符合「OPERATION」的源代码
代码结果 10,000
www.eeworm.com/read/422271/10651072
h operation.h
#ifndef __OPERATION_h__
#define __OPERATION_h__
// write your header here
#define ADD 1
#define SUB 2
#define MUL 3
#define DIV 4
#endif
www.eeworm.com/read/421842/10694109
h operation.h
//直接插入排序
void Insertsort()
{
int i,j,k,m=0;
printf("\n\t\t原始数据为（按回车键开始排序）：\n\t\t");
for(k=1;k
www.eeworm.com/read/418487/10944186
vi operation.vi
www.eeworm.com/read/270583/11032445
h operation.h
double Operation(double x1,double x2,char sign)
{
if(sign=='+')
{
return x1+x2;
}
else if(sign=='-')
{
return x1-x2;
}
else if(sign=='*')
{
return x1*x2;
}
else if(sign==
www.eeworm.com/read/135632/6959279
java operation.java
package com.wayout.wayoutsp.operation;
import java.util.*;
import java.net.*;
import java.sql.*;
import com.wayout.wayoutsp.operation.Operation.*;
/**
* Title: Operation
* Descr
www.eeworm.com/read/468297/6996245
cs operation.cs
using System;
using System.Collections.Generic;
using System.Text;
using System.Data;
using System.Data.SqlClient;
using System.Windows.Forms;
//using Microsoft.Internal.Performance;
namesp
www.eeworm.com/read/465280/7052646
h operation.h
//各种全局操作函数以及全局变量
#ifndef operation_H_H_H
#define operation_H_H_H
#define mapH 40 //地图水平栅格数目
#define mapV 40 //地图垂直栅格数目
#define AntNumber 20 //蚂蚁数目
#define AntNumber2 20 //蚂蚁数目
#defi
www.eeworm.com/read/398287/7105083
vhd operation.vhd
---------------------------------------------------------------------------------------------------
--*************************************************************************************************