代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/271478/10992710
txt damon.txt
(排列宝石问题)设有n种不同的颜色，同一种形状的n颗宝石分别具有这种不同的颜色。现有n种不同形状的宝石共有 颗，欲将这 颗宝石排列成n行n列的一个方阵，使方阵中每一行每一列的宝石都有n种不同颜色和n种不同形状。试设计一个算法计算出对于给定的n有多少种不同的宝石排列方案。
算法思想
形如着色问题依次填充,如不能填写任何宝石则回溯.
程序流程图:
源程序:
#include ...
www.eeworm.com/read/417331/10994210
m myga.m
function [f,x]=myga(num,bounds,N,CP,P)
%[f,x]=ga(num,bounds,fun,N,CP,P)
%[f,x]=myga([],bounds,[],[],[])
%该遗传算法适用于：
% 目标函数为求最大值，且解非负整数解
%bounds 边界约束
%Myfun 为目标函数
%num
www.eeworm.com/read/271414/10997830
m variable_eta.m
ybus;
D=zeros(nn,p);
for k=1:Vg_num
for h=1:p
busdata(Vg(k),3)=CV(k,h);%Vg
www.eeworm.com/read/271333/11000057
m pseudo-inverse cos.m
dim =10000;
num =100;
cost = zeros(dim/100,num);
for n=1:dim/100
for m= 1:num
V=rand(n,m);
flops(0)
V=pinv(V);
cost(n,m)= flop
end
end
www.eeworm.com/read/417063/11004888
m myga.m
function [f,x]=myga(num,bounds,N,CP,P)
%[f,x]=ga(num,bounds,fun,N,CP,P)
%[f,x]=myga([],bounds,[],[],[])
%该遗传算法适用于：
% 目标函数为求最大值，且解非负整数解
%bounds 边界约束
%Myfun 为目标函数
%num
www.eeworm.com/read/271125/11006015
cpp encrypt.cpp
#include
void main()
{
long int num;
int serial[10];
int count,i,temp;
printf("请输入原数据：\n");
scanf("%d",&num);
count=0;
while(num>0)/*拆分数据*/
{
serial[count]=
www.eeworm.com/read/416981/11008448
c uart.c
#include
#include
#include "uart.h"
static unsigned char idata uartbuf;
static unsigned char idata bufwptr, bufrptr;
unsigned char idata uartbuff[UARTBUFFLEN];
sta
www.eeworm.com/read/416775/11013599
pas unit1.pas
unit Unit1;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, StdCtrls,Math;
type
TForm1 = class(TForm)
Button1: TButton;
B
www.eeworm.com/read/416762/11013868
_c timer1._c
#include
#include
#include
#include
//TIMER0 initialize - prescale:8
// WGM: Normal
// desired value: 1Hz
// actual value: 1953.125Hz (99.9%)
voi
www.eeworm.com/read/416762/11013914
c timer1.c
#include
#include
#include
#include
//TIMER0 initialize - prescale:8
// WGM: Normal
// desired value: 1Hz
// actual value: 1953.125Hz (99.9%)
voi