代码搜索：Multiplication
找到约 1,176 项符合「Multiplication」的源代码
代码结果 1,176
www.eeworm.com/read/379471/9195041
as object3d.as
/**
* project3D Engine
* @author John Sword
* @version 2 - AS3
*/
package engine.objects
{
import engine.camera.Camera3D;
import engine.geom.Face;
import engine.geom.Point3D;
import
www.eeworm.com/read/378188/9242467
f check.f
Subroutine check( c, m, n, ok )
! ----------------------------------------------------------------------
! --- Routine 'check' does the correctness check for the matrix-vector
! multiplicati
www.eeworm.com/read/378188/9242613
f oper2.f
Subroutine oper2( nmult, linc, hash )
! -------------------------------------------------------------------
! --- 'oper2' does a multiplication with a stride in the index of
! array 'a 'to g
www.eeworm.com/read/378186/9243036
f check.f
Subroutine check( c, m, n, ok )
! ----------------------------------------------------------------------
! --- Routine 'check' does the correctness check for the matrix-vector
! multiplicati
www.eeworm.com/read/178176/9415596
inf info.inf
#######################################################
####### C++ Simulator of a Turing Machine (TM ) #######
##### Nondeterministic/Deterministic Multitape TM #####
www.eeworm.com/read/360280/10104792
java mcmatrix4.java
/*
* Marching Cubes Tutorial Applet
* Copyright (C) 2002 - GERVAISE Raphael & RICHARD Karen
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Ge
www.eeworm.com/read/275202/10829393
m dual.m
function C = dual(A)
%dual(A): Computes the dual, A/I3
%
%See also gable.
% GABLE, Copyright (c) 1999, University of Amsterdam
% Copying, use and development for non-commercial purposes permitted.
%
www.eeworm.com/read/275202/10829502
m edual.m
function C = Edual(A)
%Edual(A): Computes the dual, A/I3
%
%See also gable.
% GABLE, Copyright (c) 1999, University of Amsterdam
% Copying, use and development for non-commercial purposes permitted.
www.eeworm.com/read/272894/10937320
dpr ex.dpr
{
这道题目是一个组合数学问题，处理方法很多。我的方法是这样的。
首先，不难发现两种颜色的球，放入盒子中，是互不相干的。所以总方案数应该是两种颜色
的球放入n个盒子里的方案数的积。对于n个盒子，未必放全a个球，球是相同的，盒子不相同
，可重复的组合书可以这样来解决。因为未必放全a个球，所以可以把未放入n个盒子里的球，
视为放入了第n+1个盒子。接下来可重复排列，所以总方案数是C(n+1+ ...
www.eeworm.com/read/166571/7095726
hpp exprops2.hpp
/* The following code example is taken from the book
* "C++ Templates - The Complete Guide"
* by David Vandevoorde and Nicolai M. Josuttis, Addison-Wesley, 2002
*
* (C) Copyright David Vandevoorde