代码搜索结果

#include main() { int power(int x, int n); int a, b, c; printf("please input X and n: \n"); scanf("%d %d",&a, &b); c=power(a, b); printf("\

% Use this input file to excite function "ssj_req" clear all pt = 50.0e+3; % peak power in Watts g = 35.0; % antenna gain in dB freq = 3.2e+9; % radar operating frequency in Hz sigma =

#include #include #include #include "msp.h" void mpsplot(float psdr[],float psdi[],int mfre,float ts) { /*----------------------------------------------------------

program tju1131; var n,x:longint; a:qword; begin repeat read(n); n:=power(2,n); a:=n+1; a:=a*n div 2; repeat read(x); dec(a,x); dec(n); un

program tju1131; var n,x:longint; a:qword; begin repeat read(n); n:=power(2,n); a:=n+1; a:=a*n div 2; repeat read(x); dec(a,x); dec(n); un

program tju1206; var n,m:byte; begin repeat read(n,m); writeln(power(2,n)*(m+1)); until seekeof; end.

program tju1206; var n,m:byte; begin repeat read(n,m); writeln(power(2,n)*(m+1)); until seekeof; end.

-- Copyright (C) 1991-2005 Altera Corporation -- Your use of Altera Corporation's design tools, logic functions -- and other software and tools, and its AMPP partner logic -- functions,

%用遗传算法进行简单函数的优化,可以显示中间过程 clear bn=22; %个体串长度 inn=50; %初始种群大小 gnmax=200; %最大代数 pc=0.8; %交叉概率 pm=0.05; %变异概率 %产生初始种群 s=round(rand(inn,bn)); gnf1=5; gnf2=20; %计算适应度,返回适应度f和累积概率p [f,p

% NMM Toolbox: routines for eigenvalue computation % % eigSort Eigenvalue/vectors sorted in ascending or descending order % iterMult Iterated multiplication of a vector by a matrix: u = A*A