代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/461415/7227928
cpp ysf.cpp
#include
#include
typedef struct node
{
int num;
int password;
struct node *next;
}node, *LinkList;
InitList(node *p)
{
p=(node *)malloc(sizeof(node));
p->ne
www.eeworm.com/read/461262/7230883
m frame_syn.m
len=100; %每帧的数据长度
n=3; %进行仿真的帧数
c=[1 1 1 -1 -1 1 -1]; %巴克码
for i=1:n
s(i,:)=randsrc(1,len); %产生每周的信源数据
end
r=[c s(1,:) c s(2,:) c s(3,:)]; %将巴克码插入信源数据中
thr=6; %判决门限，
www.eeworm.com/read/461196/7232082
cpp soj2993nim变形.cpp
#include
int main(void)
{
int num[1000];
int n;
while(scanf("%d",&n)&&n)
{
int i;
for(i=0;i
www.eeworm.com/read/461196/7232086
cpp soj2704快速分解组合数.cpp
#include
#include
const int MAX = 1000001;
int a[MAX];
int next(int i)
{
int j=i+1;
while(a[j]==1&&j
www.eeworm.com/read/461196/7232087
cpp soj2427floyed算法.cpp
#include
#define NIL 99999999
int main(void)
{
int n,m;
while(scanf("%d%d",&n,&m)==2&&(n||m))
{
int num[101][101]={0};
int i;
for(i=1;i
www.eeworm.com/read/461140/7232896
txt 1.txt
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import java.io.*;
import java.util.*;
public class Lei
{
public static void main(String args[])
{
new ManagerWindow(
www.eeworm.com/read/460783/7240775
txt 分数.txt
struct frac{
int num,den;
};
double fabs(double x){
return x>0?x:-x;
}
int gcd(int a,int b){
int t;
if (a
www.eeworm.com/read/460783/7240778
txt 置换(polya).txt
//求置换的循环节,polya原理
//perm[0..n-1]为0..n-1的一个置换(排列)
//返回置换最小周期,num返回循环节个数
#define MAXN 1000
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
int polya(int* perm,int n,int& num){
int i,j,p,v[M