±à³ÌÌâ:
89£®Ñ§ÉúµÄ¼Ç¼ÓÉѧºÅºÍ³É¼¨×é³É£¬NÃûѧÉúµÄÊý¾ÝÒÑÔÚÖ÷º¯ÊýÖзÅÈë½á¹¹ÌåÊý×ésÖУ¬Çë±àдº¯Êýfun£¬ËüµÄ¹¦ÄÜÊÇ£º°Ñ¸ßÓÚµÈÓÚƽ¾ù·ÖµÄѧÉúÊý¾Ý·ÅÔÚbËùÖ¸µÄÊý×éÖУ¬¸ßÓÚµÈÓÚƽ¾ù·ÖµÄѧÉúÈËÊýͨ¹ýÐβÎn´«»Ø£¬Æ½¾ù·Öͨ¹ýº¯ÊýÖµ·µ»Ø¡£
×¢Ò⣺²¿·ÖÔ´³ÌÐò¸ø³öÈçÏ¡£
ÇëÎð¸Ä¶¯Ö÷º¯ÊýmainºÍÆäËûº¯ÊýÖеÄÈκÎÄÚÈÝ£¬½öÔÚº¯ÊýfunµÄ»¨À¨ºÅÖÐÌîÈëËù±àдµÄÈô¸ÉÓï¾ä¡£
#include
#define N 12
typedef struct
{
char num [10];
double s;
}STREC;
double fun ( STREC *a, STREC *b, int *n )
{
}
main ()
{
STREC s[N]={{¡°GA05¡å,85}, {¡°GA03¡å,76}, {¡°GA02¡å,69}, {¡°GA04¡å,85},
{¡°GA01¡å,91}, {¡°GA07¡å,72}, {¡°GA08¡å,64}, {¡°GA06¡å,87},
{¡°GA09¡å,60}, {¡°GA11¡å,79}, {¡°GA12¡å,73}, {¡°GA10¡å,90}};
STREC h [N], t;
FILE *out ;
int i,j,n;
double ave;
ave=fun ( s, h, &n );
printf ( ¡°The %d student data which is higher than %7.3f:\n¡±, n, ave);
for ( i=0; i
printf (¡°%s %4.1f\n¡±, h[i]. num, h[i]. s);
printf (¡°\n¡±);
out=fopen(¡°out12.dat¡±,¡±w¡±);
fprintf(out,¡±%d\n%7.3f\n¡±, n, ave);
for(i=0;i
for(j=i+1;j
if(h[i].s
{
t=h[i] ;
h[i]=h[j];
h[j]=t;
}
for(i=0;i
fprintf(out, ¡°%4.1f\n¡±,h[i].s);
fclose(out);
}
90£®Çë±àдº¯Êýfun£¬Æ书ÄÜÊÇ£º¼ÆËã²¢Êä³öÏÂÁжàÏîʽֵ£º
Sn= (1-1/2) + (1/3-1/4)+¡+(1/2n-1-1/2n)
ÀýÈ磬ÈôÖ÷º¯Êý´Ó¼üÅ̸ønÊäÈë8ºó£¬ÔòÊä³öΪS=0.662872¡£
×¢Ò⣺nµÄÖµÒªÇó´óÓÚ1µ«²»´óÓÚ100¡£²¿·ÖÔ´³ÌÐò¸ø³öÈçÏ¡£
ÇëÎð¸Ä¶¯Ö÷º¯ÊýmainºÍÆäËûº¯ÊýÖеÄÈκÎÄÚÈÝ£¬½öÔÚº¯ÊýfunµÄ»¨À¨ºÅÖÐÌîÈëËù±àдµÄÈô¸ÉÓï¾ä¡£
#include
double fun(int n)
{
}
main()
{
int n;
double s;
printf(¡°\nInput n: ¡°);
scanf(¡°%d¡±,&n);
s=fun(n);
printf(¡°\ns=%f\n¡±,s);
}
¸Ä´íÌâ:
12£®ÏÂÁиø¶¨³ÌÐòÖк¯ÊýfunµÄ¹¦ÄÜÊÇ£ºÇó³öÔÚ×Ö·û´®ÖÐ×îºóÒ»´Î³öÏÖµÄ×Ó×Ö·û´®µÄµØ
Ö·£¬Í¨¹ýº¯ÊýÖµ·µ»Ø£¬ÔÚÖ÷º¯ÊýÖÐÊä³ö´Ó´ËµØÖ·¿ªÊ¼µÄ×Ö·û´®£»ÈôδÕÒµ½£¬Ôòº¯ÊýֵΪNULL¡£
ÀýÈ磬µ±×Ö·û´®ÖеÄÄÚÈÝΪabcdabfabcdx£¬tÖеÄÄÚÈÝΪabʱ£¬Êä³ö½á¹ûÓ¦ÊÇ£ºabcdx¡£µ±×Ö·û´®ÖеÄÄÚÈÝΪabcdabfabcdx£¬tÖеÄÄÚÈÝΪabdʱ£¬Ôò³ÌÐòÊä³öδÕÒµ½ÐÅÏ¢£ºnot be found!¡£
Çë¸ÄÕý³ÌÐòÖеĴíÎó£¬Ê¹ËüÄܵóöÕýÈ·µÄ½á¹û¡£
×¢Ò⣺²»Òª¸Ä¶¯mainº¯Êý£¬²»µÃÔöÐлòɾÐУ¬Ò²²»µÃ¸ü¸Ä³ÌÐòµÄ½á¹¹!
ÊÔÌâ³ÌÐò£º
#include
#include
#include
char *fun(char *s,char *t)
{
char *p,*r,*a;
/********found********/
a=NuLL;
while(*s)
{
p=s;r=t;
while(*r)
/********found********/
if(r==p)
{
r++;
p++;
}
else
break;
if(*r==¡¯\0¡ä)
a=s;
s++;
}
return a;
}
main()
{
char s[100],t[100],*p;
clrscr();
printf(¡°\nplease enter string s:¡±);
scanf(¡°%s¡±,s);
printf(¡°\nplease enter substring t:¡±);
scanf(¡°%s¡±,t);
p=fun(s,t);
if(p)
printf(¡°\nthe result is:%s\n¡±,p);
else
printf(¡°\nnot found!\n¡±);
}
20£®N¸öÓÐÐòÕûÊýÊýÁÐÒÑ·ÅÔÚһάÊý×éÖУ¬¸ø¶¨ÏÂÁгÌÐòÖУ¬º¯ÊýfunµÄ¹¦ÄÜÊÇ£ºÀûÓÃÕÛ°ë²éÕÒËã·¨²éÕÒÕûÊýmÔÚÊý×éÖеÄλÖá£ÈôÕÒµ½£¬Ôò·µ»ØÆäϱêÖµ£»·´Ö®£¬Ôò·µ»Ø-1¡£
ÕÛ°ë²éÕҵĻù±¾Ëã·¨ÊÇ£ºÃ¿´Î²éÕÒÇ°ÏÈÈ·¶¨Êý×éÖдý²éµÄ·¶Î§£ºlowºÍhigh(lowhigh£¬²éÕÒ½áÊø¡£
Çë¸ÄÕý³ÌÐòÖеĴíÎó£¬Ê¹ËüÄܵóöÕýÈ·½á¹û¡£
×¢Ò⣺²»Òª¸Ä¶¯mainº¯Êý£¬²»µÃÔöÐлòɾÐУ¬Ò²²»µÃ¸ü¸Ä³ÌÐòµÄ½á¹¹¡£
ÊÔÌâ³ÌÐò£º
#include
#define N 10
/********found********/
void fun(int a[],int m)
{
int low=0,high=N-1,mid;
while(low<=high)
{
mid=(low+high)/2;
if(m
high=mid-1;
/********found********/
else
if(m>=a[mid])
low=mid+1;
else
return(mid);
}
return (-1);
}
main()
{
int i,a[N]={-3,4,7,9,13,45,67,89,100,180},k,m;
printf(¡°a:¡±);
for(i=0;i
printf(¡°%d ¡°,a[i]);
printf(¡°Enter m:¡±);
scanf(¡°%d¡±,&m);
k=fun(a,m);
if(k>=0)
printf(¡°m=%d,index=%d\n¡±,m,k);
else
printf(¡°Not be found!\n¡±);
}