代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/398319/7994735
c test3.c
#include "stdio.h"
int prime(int num);
void main()
{
int num;
printf("Input int num:");
scanf("%d",&num);
if(prime(num)==1)
printf("YES\n");
else
printf("NO\n");
return ;
}
in
www.eeworm.com/read/398319/7994751
c test2.c
#include "stdio.h"
#define MAX 1000
int fun(int lim,int aa[]);
int prime(int num);
void main()
{
int lim,aa[MAX],result,i;
printf("Please Input a Int:");
scanf("%d",&lim);
result=fun(lim,
www.eeworm.com/read/398242/7997418
c 6.c
# define N 5
main( )
{
int x , num[N+1] ;
float st[N+1] , ave , sum=0;
for (x=1 ; x
www.eeworm.com/read/398197/8000046
c~ finder.c~
#include
#include
int main(){
char str[10000];
int num;
scanf("%d%s",&num,str);
int i;
int len = strlen(str);
printf("%d",len);
for(i = 0; i < len; i++){
int counter = 0;
www.eeworm.com/read/398197/8000050
c finder.c
#include
#include
int main(){
char str[10000];
int num;
scanf("%d%s",&num,str);
int i;
int len = strlen(str);
for(i = 0; i < len; i++){
int counter = 0;
while(str[i] >=
www.eeworm.com/read/398074/8006566
c button.c
/*int get_str(WINDOW *textbox, char inputed_str[], int style, int num_limit, int input_limit)
NODE* link_get_node_by_key(C_CLASS LINKLIST* link,char* key,int (*condition)(void *p1,void *p2))
*/
int
www.eeworm.com/read/397839/8019685
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/397796/8021438
c text1.c
#include"stdio.h"
status InitStack(sqstack &s,int n)
{ s.base=(LelemType)malloc(n*sizeof(elemType));
if(!s.base) exit(OVeRFLOW);
s.top=s.base;
s.stacksize=n;
retu
www.eeworm.com/read/297402/8024731
m ex4_15.m
Z=[]; K=10; P=[-1;-2;-3;-4]; G=zpk(Z,P,K);
G1=tf(G); [R,PP,X]=residue(G1.num{1},[G1.den{1},0])
[y,t]=step(G);
for i=1:5, y=[y, R(i)*exp(PP(i)*t)]; end
plot(t,y)
plot(t,y(:,1),'-',t,sum(y(:,
www.eeworm.com/read/297402/8024970
m ex2_16.m
num=[1,7,24,24]; den=[1,10,35,50,24]; G=tf(num,den);
G1=ss(G)