代码搜索：M-I
找到约 56 项符合「M-I」的源代码
代码结果 56
www.eeworm.com/read/324125/13284031
m gf2gauss.m
function [B]=gf2gauss(A,i,q)
[m,n]=size(A);
A(i+1:m,q:q)=zeros(m-i,1);
A(1:i-1,q:q)=zeros(i-1,1);
B=A;
www.eeworm.com/read/435517/7790996
c tonggoushu.c
# include
void main ()
{
int i,n=0,m,s=0,k=10;
for (i=6;n!=6;i++)
{
m=i*i;
for (;i/k!=0;)
k*=10;
if ((m-i)%k==0)
{
n++;
printf ("%d ",i);
s+=i;
}
}
www.eeworm.com/read/279550/10421369
txt pku 1095.txt
#include
void makeTree(int n){
int i, j, sum, m;
int a[19] = {0, 1, 3, 8, 22, 64, 196, 625, 2055, 6917, 23713, 82499, 290511, 1033411,
3707851, 13402696, 48760366, 178405156,
www.eeworm.com/read/455595/7369724
txt pku 1095.txt
#include
void makeTree(int n){
int i, j, sum, m;
int a[19] = {0, 1, 3, 8, 22, 64, 196, 625, 2055, 6917, 23713, 82499, 290511, 1033411,
3707851, 13402696, 48760366, 178405156,
www.eeworm.com/read/449211/7516738
cpp 几个进制之间的转化.cpp
/*.......注意本程序对其它进制转化为十进制的时候字符串长度不得超出100位本程序还可以进行适当的修改可以在任何
的两个进制之间进行转化,在这里不进行仔细的分析只给出了10进制也其他进制之间的转化和其它进制与十进制之间的转化*/
#include "stdio.h"
#include "stdlib.h"
#include "iostream.h"
#include "math
www.eeworm.com/read/407780/11410900
txt pku 1095.txt
#include
void makeTree(int n){
int i, j, sum, m;
int a[19] = {0, 1, 3, 8, 22, 64, 196, 625, 2055, 6917, 23713, 82499, 290511, 1033411,
3707851, 13402696, 48760366, 178405156,
www.eeworm.com/read/402538/11533591
m ziji.m
function [a]=ziji(b)
%对于一个集合，生成该集合的所有非空非全子集
%结果的记录方式
%a{i}{j} 其中i表示含有i个元素的子集，j表示其中的一个
%生成一项子集
m=length(b);
for i=1:m
a{1}{i}=b(i);
end
n=floor(m/2);
for i=2:n
%由K-1项子集生成k项子集
n
www.eeworm.com/read/207195/15280053
m change.m
function x1=change(x0);
global citynumber
x1=x0;
p=1+fix(rand*citynumber);
q=1+fix(rand*citynumber);
m=max(p,q);n=min(p,q);
for i=n:m
x1(i)=x0(n+m-i);
end
www.eeworm.com/read/473191/6858055
txt pku 1095.txt
#include
void makeTree(int n){
int i, j, sum, m;
int a[19] = {0, 1, 3, 8, 22, 64, 196, 625, 2055, 6917, 23713, 82499, 290511, 1033411,
3707851, 13402696, 48760366, 178405156,
www.eeworm.com/read/165343/7143920
txt genrm.cc.txt
//
//
// Program: genrm.cc
// Create a generator for an RM(r,m) code
// This is a kind of quick, brute-force (non recursive) way to
// do this, that can only be coded explicitly up to a fixed value