代码搜索：array
找到约 10,000 项符合「array」的源代码
代码结果 10,000
www.eeworm.com/read/455115/7377681
m randomsample.m
% RANDOMSAMPLE - selects n random items from an array
%
% Usage: items = randomsample(a, n)
%
% Arguments: a - Either an array of values from which the items are to
% be selected
www.eeworm.com/read/454486/7388785
js lunar.js
//获得任意日期的农历，以及各种节日、节气等 isaac 修改万年历而得 Aug 2nd 2005
/*****************************************************************************
日期资料
****************************
www.eeworm.com/read/454266/7395454
m domre.m
%%%%%%%%%% start of function domre.m %%%%%%%%%%
%
% Function to solves an inverse problem using Minimum Relative
% Entropy Inversion
%
% Written by: Roseanna M. Neupauer
% Modification Date: Apri
www.eeworm.com/read/452695/7436265
c ex8_01.c
/* Exercise 8.1 A function to calculate an average */
#include
#include
#include
double average(double data[], int count)
{
double sum = 0.0;
for(int i = 0
www.eeworm.com/read/452690/7436462
pas des.pas
unit Des;
interface
uses SysUtils;
type
TKeyByte = array[0..5] of Byte;
TDesMode = (dmEncry, dmDecry);
function EncryStr(Str, Key: String): String;
function DecryStr(Str, Key: S
www.eeworm.com/read/452620/7436774
pas unitconst.pas
unit unitConst;
interface
uses
Graphics;
type
//for universal
TInt= integer;
TShort= shortint;
TUShort= byte;
TUInt= Word;
TULong= Longword;
TBool= boolean;
//for lig
www.eeworm.com/read/452209/7445633
ps gs_std_e.ps
% Copyright (C) 1993, 1994 Aladdin Enterprises. All rights reserved.
%
% This file is part of Aladdin Ghostscript.
%
% Aladdin Ghostscript is distributed with NO WARRANTY OF ANY KIND. No au
www.eeworm.com/read/452050/7449015
c 1785390_wa.c
# include
int MAX(int x,int y)
{
return (x>y?x:y);
}
main()
{
int n,i,j,k,l,sum,max = -128,t = -128,f[2][100][100],array[100][100];
scanf("%d",&n);
for(i = 0; i < n; i++
www.eeworm.com/read/452050/7449017
cpp 1785388_wa.cpp
# include
int MAX(int x,int y)
{
return (x>y?x:y);
}
main()
{
int n,i,j,k,l,sum,max = -128,t = -128,f[2][100][100],array[100][100];
scanf("%d",&n);
for(i = 0; i < n; i++