当前位置:首页 >> IT/计算机 >>

2010年三级网络南开100题(仅答案~绝对最新)


1.

void num(int

3.
+)

I=strl-1; void StrOR(void) while(1) {while

k=1; }

{data=aa[I];aa [I]=aa[j];aa[j]=data;} for(I=0;I<10;I++) bb[I]=aa[I]; }

m,int k,int xx[]) {int data=m+1; int half,n=0,I; while(1) {half=data/2;for(I= 2;I<=half;I++) if(data%I==0)break; if(I>half) {xx[n]=data;n++;} if(n>=k)break; data++; } }

{int I,j,k,index,strl; char ch; for(I=0;I<maxline;I+ {strl=strlen(xx[I]); index=strl; for(j=0;j<strl;j++) if(xx[I][j]=='o') {for(k=j;k<strl-1; k++) xx[I][k]=xx[I][k+1]; xx[I][strl-1]= ' '; index=j;} for(j=strl-1;j>=index ;j--) {ch=xx[I][strl-1];

(((xx[l][I]>='a'&&xx[ l][I]<='z')||(xx[l][I ]>='A'&&xx[l][I]<='z' ))&&I>=0) {for(j=k;j>=0;j--) pp[j+1]=pp[j]; pp[0]=xx[l][I]; k++;I--; } strcat(ch,pp);strcpy( pp, """");k=1; if(I==-1)break; while((xx[l][I]<' A'||xx[l][I]>'z')&&I> =0) {for(j=k;j>=0;j--) pp[j+1]=pp[j]; pp[0]=xx[l][I]; +; I--;} strcat(ch,pp); strcpy(pp,""""); k=0; if(I==-1)break;} strcpy(xx[l],ch); }} } k+

6

.void jsSort()

{int I,j,data; for(I=0;I<199;I++) for(j=I+1;j<200;j++) {if (aa[I]%1000<aa[j]%100 0) {data=aa[I];aa[ I]=aa[j];aa[j]=data;} else if(aa[I]%1000==aa[j]% 1000) if(aa[I]>aa[j]) {data=aa[I];aa [I]=aa[j];aa[j]=data;} } for(I=0;I<10;I++) bb[I]=aa[I];

2.

void jsVal()

for(k=strl-1;k>0;k--) xx[I][k]=xx[I][k-1]; xx[I][0]=ch;} } }

{int bb[4]; int I,j,k,flag; for (I=0;I<200;I++) {bb[0]=a[I]/1000; bb[1]=a[I]%1000/100; bb[2]=a[I]%100/10; bb[3]=a[I]%10; for (j=0;j<4;j++) {if (bb[j]%2==0) flag=1; else {flag=0;break;} } if (flag==1) { b[cnt]=a[I]; cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if (b[I]<b[j]) {k=b[I];b[I]=b[j ];b[j]=k;} }

4.
c;

void StrOL(void)

{int I,j,k,strl,l;char for(I=0;I<maxline;I++) for(j=0;j<strlen(xx [I]);j++) {c=xx[I][j]; if ((c>='A'&&c<='Z')||(c >='a'&&c<='z')||c==' ') ; else xx[I][j]=' '; +) {char ch[80]={0}; char pp[80]={0}; strl=strlen(xx[l]); } for(l=0;l<maxline;l+

5.
{if

7
void jsSort()

.void SortDat()

{int I,j; PRO xy; for(I=0;I<99;I++) for(j=I+1;j<100;j++) if(strcmp(sell[I]. dm,sell[j].dm)<0) {xy=sell[I];sell[I]=s ell[j];sell[j]=xy;} else if(strcmp(sell[I].dm, sell[j].dm)==0) if(sell[I].je<sell[j ].je) {xy=sell[I];

{int I,j,data; for(I=0;I<199;I++) for(j=I+1;j<200;j++) (aa[I]%1000>aa[j]%100 0) {data=aa[I];aa[I ]=aa[j];aa[j]=data;} else if(aa[I]%1000==aa[j]% 1000) if(aa[I]<aa[j])

sell[I]=sell[j]; sell[j]=xy;} }

++) {str =strlen(xx[I]); for(j=0;j<str;j++) if(xx[I][j]=='z')xx[I ][j]='a';

{xy=sell[I]; sell[I]=sell[j]; sell[j]=xy;} }

cnt++;}

}

for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if (b[I]>b[j]) {k=b[I];b[I]=b[j] ;b[j]=k;}

8.
+)

void

else if(xx[I][j]>='a'&&xx[ I][j]<='y') xx[I][j]+=1; } }

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ {pf=xx[I]; while(*pf!=0) {if(*pf*11%256>130 ||*pf*11%256<=32); else *pf=*pf*11%256; pf++; } } }

13.
SortDat() {int I,j; PRO xy;

void

}

15

.

void jsVal()

for(I=0;I<99;I++) for(j=I+1;j<100;j+ . void +) if(strcmp(sell[I]. mc,sell[j].mc)>0) {xy=sell[I]; sell [I]=sell[j]; {*s-=25;s++;} else sell[j]=xy;} else if(strcmp(sell[I].mc, sell[j].mc)==0) if(sell[I].je<sell[ j].je) {xy=sell[I]; sell[I]=sell[j]; sell[j]=xy;} } void

{int I,j; int a1,a2,a3,a4,k; for (I=0;I<MAX;I++) {a1=a[I]/1000; a[I]%1000/100; a3=a[I]%100/10; a4=a[I]%10; if ((a1<=a2)&&(a2<=a3)&& (a3<=a4)&&(a[I]%2==0)) {b[cnt]=a[I]; cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if (b[I]>b[j]) {k=b[I];b[I]=b[j] ;b[j]=k;} } a2=

11
')

chg(char*s) {while(*s) if(*s=='z'||*s=='Z

if(*s>='a'&&*s<='y') {*s+=1;s++;} else v

9

.void

if(*s>='A'&&*s<='Y') {*s+=1;s++;} else s++; }

SortCharD(void) {int I,j,k,strl; char ch; for(I=0;I<maxline;I ++) {strl=strlen(xx[I]); for(j=0;j<strl-1;j++) for(k=j+1;k<strl;k++) if(xx[I][j]<xx[I][k ]) {ch=xx[I][j]; I][j]=xx[I][k]; I][k]=ch;} }} xx[ xx[

12.
SortDat() {int I,j; PRO xy;

14

.oid jsVal()

{int I,j,flag=0; int k; for(I=0;I<MAX-5;I++) {for(j=I+1;j<=I+5;j ++) {if (a[I]>a[j]) flag=1; else {flag=0;break;} if (a[I]%2==0) flag=0;} if (flag==1) {b[cnt]=a[I];

16
++)

.

void

for(I=0;I<99;I++) for(j=I+1;j<100;j++) if(strcmp(sell[I]. dm,sell[j].dm)<0) {xy=sell[I];sell[I]=s ell[j];sell[j]=xy;} else if(strcmp(sell[I].dm, sell[j].dm)==0) if(sell[I].je<sell[j ].je)

StrCharJR(void) {int I,j,strl; for(I=0;I<maxline;I {strl=strlen(xx[I ]); for(j=0;j<strl; j++) xx[I][j]+=xx[I][ j]>>4; } }

10.void
ConvertCharA(void) {int I,j,str; for(I=0;I<maxline;I

注:这个编程题比二级考 得还简单。 void StrCharJR(void) {int i,j; for(i=0;i<maxline;i++) for(j=0;xx[i][j]!='\0 ';j++) xx[i][j]+=xx[i][j]>>4; } }

}

} }

break; return x1;

a[10][9]) {int I,j,k=0; int hun,ten,data; for(I=100;I<=999;I++) {j=10; while(j*j<=I)

19.
*substr)

} int

findStr(char *str,char { int n; char *p , *r; n=0; while ( *str ) { p=str; r=substr; while(*r) if(*r==*p) { r++; p++; } else n++; str++; return n; } } break; if(*r=='\0')

22

.double

{if (I==j*j) {hun=I/100;data=Ihun*100; ten=data/10;data= data-ten*10; if(hun==ten||hun==dat a||ten==data) {bb[k]=I;k++;} } j++;} } } return k;

countValue(int n) {double xy=0.0; int I; for(I=1;I<n;I++) if(I%3==0&&I%7==0) xy+=I; xy=sqrt((double)xy); return xy; } double countvalue(int n) { int i,j=0; double k; for(i=0;i<n;i++) if(i%3==0&&i%7==0) j+=i; k=sqrt(j);

17
I++)

.void ChA(void)

{int I,j,k,str; char ch; for(I=0;I<maxline; {str=strlen(xx[I]); ch=xx[I][0]; for(j=0;j<str-1;j++) xx[I][j]+=xx[I][j+1]; xx[I][str-1]+=ch; for(j=0,k=str-1;j<st r/2;j++,k--) {ch=xx[I][j]; xx[I][j]=xx[I][k]; xx[I][k]=ch;} } }

25.
char xy[20];

int

jsValue(long n) {int I,strl,half;

20
t)

.int jsValue(int

return k;

}

ltoa(n,xy,10); strl=strlen(xy); half=strl/2;

{ int f1=0,f2=1,fn; fn=f1+f2; while(fn<=t) .void {f1=f2; f2=fn; fn=f1+f2;} return fn; }

23.
{int I;

void

for(I=0;I<half;I++) if(xy[I]!=xy[--strl ]) break; if(I>=half) return 1; else return 0; }

18

CalValue(void) double x,sum=0; for (I=0;I<MAXNUM;I++) {sumint=sumint+(int) xx[I]; x=xx[I]-(int)xx[I]; sumdec=sumdec+x;

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) {if(*pf%2==0||*pf* 11%256<=32) ; else *pf=*pf*11%256; pf++;

21.
{x0=x1;

float

sum=sum+xx[I]; } aver=sum/MAXNUM; }

26.

void

countValue() {float x0,x1=0.0; while(1) x1=cos(x0); if(fabs(x0-x1)<1e-6)

CalValue(void) {int I,data; for(I=0;I<MAXNUM;I++) {if(!xx[I]) break; if(xx[I]>0) totNum++;

24.

jsValue(int

data=xx[I]>>1; if (data%2==0){totCnt++; totPjz+=xx[I];} } totPjz/=totCnt; }

&&ab!=0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I]; b[I]=b[j];b[j]=data;} }

{if(a[I]<a[j]) flag=1; else flag=0; if(a[I]%2!=0) flag=0; if (flag==0) break;} if(flag==1) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++)

for(j=I+1;j<MAX;j++) if(strcmp(sell[I].m c,sell[j].mc)<0) {xy=sell[I]; sell [I]=sell[j]; sell[j]=xy;} else if(strcmp(sell[I].mc, sell[j].mc)==0) if(sell[I].je>sell[ j].je) {xy=sell[I];sell[I ]=sell[j]; sell[j]=xy;} }

27
{int

.void jsValue()

I,thou,hun,ten,data,j; for(I=0;I<300;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (thou-hun-ten-data>0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I]; b[I]=b[j]; b[j]=data;} } d hu

29.
jsVal() {int int ab,cd;

void

for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {flag=b[I];b[I]=b [j];b[j]=flag;} }

I,thou,hun,ten,data,j; for(I=0;I<200;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*thou+ten; =10*data+hun; if ((ab-cd)>=0&&(ab-cd)< =10&&ab%2==1&&cd%2==1 &&ab!=0&&cd!=0) {b[cnt]=a[I];cnt++;} cd d hu

31.
SortDat() {int I,j; PRO xy;

33.
void

```void

Compute(void) {int I, yy[MAX]; for(I=0;I<1000;I++) if(xx[I]%2){odd++;av e1+=xx[I]; } else{even++;ave2+=xx [I]; yy[even-1]=xx[I];} ave1/=odd; ave2/=even; for(I=0;I<even;I++) totfc+=(yy[I]-ave2) *(yy[I]-ave2)/even; }

for(I=0;I<99;I++) for(j=I+1;j<100;j++) if(sell[I].je<sell[ j].je) {xy=sell[I]; sell [I]=sell[j]; sell[j]=xy;} else if(sell[I].je==sell[j ].je) if(strcmp(sell[I].d m,sell[j].dm)<0) {xy=sell[I];sell[I ]=sell[j];sell[j]=xy;} }

28.
jsVal() {int int ab,cd;

void

} for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I]; b[I]=b[j];b[j]=data;} hu d cd }

I,thou,hun,ten,data,j; for(I=0;I<200;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*thou+ten; =10*data+hun; if ((ab-cd)>=0&&(ab-cd)< =10&&ab%2==1&&cd%2==1

34
{int

```void

countValue() I,j,half,hun,ten,data; for(I=101;I<1000;I++) {hun=I/100;

30.
jsVal()

void

32.
SortDat() {int I,j; PRO xy;

void

ten=I%100/10; data=I%10; if(hun==(ten+data)% 10) {half=I/2;

{int I,j,flag=0; for(I=0;I<MAX-5;I++) {for(j=I+1;j<=I+5;j ++)

for(I=0;I<MAX-1;I++)

for(j=2;j<half;j++) if(I%j==0) break; if(j>=half) {cnt++;sum+=I;} } }} }

pf++;}

}

CountRs(void) {int I,j=0,k=0; char *str; for(I=0;I<10;I++)

41

```void

37``
{int I; char *pf;

countValue() {int I=100; while(1) {if(3*I%2==0&&3*I/2> =1000&&3*I/2<=9999) {cnt++;sum+=I+3*I/2 ;I++;} else I++; if (I>999||3*I/2>9999) break; } }

``void

yy[I]=0; for(I=0;I<100;I++) {str=xx[I];j=0; while(*str) if(*str=='1'){j++;s tr++;} else str++; if(j!=0&&j!=10) {str=xx[I];k=0; while(*str) if(*str++=='1') yy[k++]+=1; else k++;} } }

encryptChar()

35

```void jsvalue()

{int a1=1,a2=1,n=1,an; int sum0,sum; sum0=a1+a2; while(1) {an=a1+a2*2; sum=sum0+an; a1=a2; a2=an; n++; ` if (sum0<100&&sum>100) b[0]=n; if (sum0<1000&&sum>1000) b[1]=n; if (sum0<10000&&sum>1000 0) } } {b[2]=n; break;} sum0=sum; }

for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) { if ((*pf>='A'&&*pf<='Z') ||*pf*11%256<=32) {pf++;continue;} *pf=*pf*11%256; pf++;} }

42`
PRO

``void

SortDat() {int I,j; xy;

38`
PRO

``void

40
{int

```void

for(I=0;I<99;I++) for(j=I+1;j<100;j++) if(strcmp(sell[I].m c,sell[j].mc)<0) {xy=sell[I]; sell [I]=sell[j]; sell[j]=xy;} else if(strcmp(sell[I].mc, sell[j].mc)==0) if(sell[I].je<sell[ j].je) {xy=sell[I]; sell[I]=sell[j];sell[ j]=xy;} }

SortDat() {int I,j; xy; for(I=0;I<MAX-1;I++) for(j=I+1;j<MAX;j++) if(strcmp(sell[I].d m,sell[j].dm)>0) {xy=sell[I]; sell[I]=sell[j]; sell[j]=xy;} else if(strcmp(sell[I].dm, sell[j].dm)==0) if(sell[I].je>sell[ j].je) {xy=sell[I]; sell[I]=sell[j]; sell[j]=xy;} }

CalValue(void) I,thou,hun,ten,data; int ab,sum=0; for(I=0;I<MAXNUM;I++) {if(xx[I]>0) totNum++; {thou=xx[I]/1000; hun=xx[I]%1000/100; ten=xx[I]%100/10; data=xx[I]%10; ab=thou+hun+ten+dat a; if (ab%2==0) {totCnt++;sum=sum+ xx[I];} }} totPjz=sum/totCnt; }

36`
{int I;

``void

encryptChar() char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) {if((*pf*11%256>=' 0'&&*pf*11%256<='9')| |*pf*11%256<=32) {pf++;continue;} *pf=*pf*11%256;

43

```void jsSort()

{int I,j,k,strl; char ch; for(I=0;I<20;I++)

39

```void

{strl=strlen(xx[I]);

for(j=1;j<strl-2;j= j+2) for(k=j+2;k<strl;k =k+2) if (xx[I][j]>xx[I][k]) {ch=xx[I][j];xx[I] [j]=xx[I][k];xx[I][k] =ch;} } } } ``void jsSort() }

if(a[I]%2!=0) flag=0; if (flag==0) break;} if(flag==1) {b[cnt]=a[I];cnt++;} for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {flag=b[I];b[I]=b [j];b[j]=flag;}

{xy=sell[I]; sell [I]=sell[j]; sell[j]=xy;} else if(sell[I].je==sell[j ].je) if(strcmp(sell[I].d m,sell[j].dm)>0) {xy=sell[I];sell[I ]=sell[j];sell[j]=xy;} }

(thou-hun-ten-data>0) {cnt++;pjz1+=a[I];} else {n++;pjz2+=a[I];} } pjz1/=cnt;pjz2/=n; }

50

````void jsSort()

{int i,strl,half,j,k; char ch; for(i=0;i<20;i++) {strl=strlen(xx[i]); half=strl/2;

44`

{int I,j,k,strl,half; char ch; for(I=0;I<20;I++) {strl=strlen(xx[I]); half=strl/2; for(j=0;j<half-1;j+ +) for(k=j+1;k<half;k ++) if (xx[I][j]<xx[I][k]) {ch=xx[I][j];xx[I] [j]=xx[I][k];xx[I][k] =ch;} for(j=half-1,k=st rl-1;j>=0;j--,k--) {ch=xx[I][j];xx[I ][j]=xx[I][k];xx[I][k ]=ch;} } }

46

48
````void jsVal() {int

````void jsValue()

{int I,j,flag=0; for(I=5;I<MAX-5;I++) {for(j=I-5;j<I;j++) {if(a[I]>a[j]) flag=1; else {flag=0;break;}} if (flag==1&&a[I]%2==1&& a[I]%7==0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {flag=b[I];b[I]=b [j];b[j]=flag;} }

I,thou,hun,ten,data,j; for(I=0;I<300;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (thou+data==hun+ten){ b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I]; b[I]=b[j]; b[j]=data;} } if(xx[i][j]>xx[i][k]) {ch=xx[i][j]; xx[i][j]=xx[i][k]; xx[i][k]=ch;} for(j=half-1,k=strl-1 ;j>=0;j--,k--) {ch=xx[i][j];xx[i][j] =xx[i][k];xx[i][k]=ch ;} } } `````void d for(k=j+1;k<half;k++) hu for(j=0;j<half-1;j++)

49
{int =0;

jsValue()

51`
{int

```void jsVal()

45`

```void jsVal()

47
PRO

`````void

I,thou,hun,ten,data,n for(I=0;I<300;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if d hu

I,thou,hun,ten,data,j; int ab,cd; for(I=0;I<200;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*thou+ten; cd d hu

{int I,j,flag=0; for(I=5;I<MAX-5;I++) {for(j=I-5;j<I;j++) {if(a[I]>a[j]) flag=1; else flag=0;

SortDat() {int I,j; xy; for(I=0;I<MAX-1;I++) for(j=I+1;j<MAX;j++) if(sell[I].je<sell[ j].je)

=10*data+hun; if (isprime(ab)&&isprime (cd)&&ab!=0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (data-thou-hun-ten>0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I]; b[I]=b[j];b[j]=data;} } d }

{value=b[I]; b[I]=b[j]; b[j]=value;}

for(I=0;I<10;I++) yy[I]=0; for(I=0;I<100;I++) {pf=xx[I];count=0; while (*pf)

56

````void

if(*pf=='1'){count+ +;pf++;} else pf++; if (count>5) {pf=xx[I]; while (*pf) j=0;

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) { if ((*pf*11%256>='a'&&*p f*11%256<='z')||*pf*1 1%256<=32) {pf++;continue;} *pf=*pf*11%256; pf++;} } }

if (*pf=='1') {yy[j]+=1;j++;pf++;} else if (*pf=='0') {pf++;j++;} } } }

52
{int

```void jsVal()

54`
{int

```void

I,thou,hun,ten,data,j; int ab,cd; for(I=0;I<200;I++) {thou=a[I]/1000; hun=a[I]%1000/100; ten=a[I]%100/10; data=a[I]%10; ab=10*thou+data; cd=10*hun+ten; if (ab%2==1&&cd%2==1&&(a b%5==0||cd%5==0)&&ab! =0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

jsValue() I,thou,hun,ten,data,j; for(I=0;I<300;I++) {thou=a[I]/1000; hun=a[I]%1000/100; ten=a[I]%100/10; data=a[I]%10; if (thou+hun==data+ten){ b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

59
{int

````void jsVal()

57
s1=s;

I,thou,hun,ten,data,j; ````void int ab,cd; for(I=0;I<200;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*thou+ten; =10*data+hun; if(((ab-cd)<0&&ab%2 ==1&&ab%5!=0)&&cd%2!= 1&&ab!=0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) ````void if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;} } cd d hu

Josegh(void) {int I,j,k,s1,w; for(I=1;I<=n;I++) p[I-1]=I; for(I=n;I>=2;I--) {s1=(s1+m-1)%I; if (s1==0) s1=I; w=p[s1-1]; for(j=s1;j<=I-1;j++) p[j-1]=p[j]; ```void jsValue() p[I-1]=w;} }

55

{int j,I,value; ````void jsValue() for(I=0;I<300;I++) if(isP(a[I])) {b[cnt]=a[I];cnt++;} for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) hu if(b[I]>b[j])

53
{int

58

CountRs(void) {int I,count,j; char *pf;

I,thou,hun,ten,data,j; for(I=0;I<300;I++) {thou=a[I]/1000;

60`

{int I; ```int jsSort() char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) {if((*pf*13%256)/2 *2==*pf||*pf*13%256<= 32) {pf++;continue;} *pf=*pf*13%256; pf++;} } }

65
{int

I,thou,hun,ten,data; ````void for(I=5000;I>=1000;I --) {thou=I/1000; hun=I%1000/100; ten=I%100/10; data=I%10; if (thou+hun==ten+data&& thou+hun==(data-thou) *10) {cnt++;sum+=I;} } }

{int I,cnt=0,j; Data ch; for(I=0;I<200;I++) if(aa[I].x2>aa[I].x1 +aa[I].x3) {bb[cnt]=aa[I];cnt++ ;} for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j+ +) if (bb[I].x2+bb[I].x3<bb [j].x2+bb[j].x3) { ch=bb[I];bb[I]=b b[j];bb[j]=ch;} return cnt; }

CalValue(void) I,thou,hun,ten,data; for(I=0;I<MAXNUM;I++) {if (!xx[I]) break; if (xx[I]>0) totNum++; thou=xx[I]/1000; hun=xx[I]%1000/100; ten=xx[I]%100/10; data=xx[I]%10; if ((thou+hun+ten+data)% 2) {totCnt++;totPjz+=x x[I];} } totPjz/=totCnt; }

63

```void

68`
{ int

```void jsVal()

chg(char*s) {int I,strl; char ch; strl=strlen(s); ch=*s;

void jsVal()

I,thou,hun,ten,data,j; for(I=0;I<200;I++)

61
PRO

```void SortDat()

for(I=0;I<strl-1;I++) *(s+I)=*(s+I+1); *(s+strl-1)=ch; }

{int I,j; xy; for(I=0;I<99;I++) for(j=I+1;j<100;j++) if(sell[I].je>sell[ j].je) {xy=sell[I]; sell [I]=sell[j]; sell[j]=xy;} else if(sell[I].je==sell[j ].je) if(strcmp(sell[I].d m,sell[j].dm)<0) {xy=sell[I];sell[I ]=sell[j];sell[j]=xy;} }

66

{thou=a[I]/1000; ````void n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if

hu d

countValue() {int I,j,half,yy[100]; for(I=500;I<=800;I++) {half=I/2; for(j=2;j<half;j++) if (I%j==0) break; if (j>=half) {yy[cnt]=I;cnt++;} } for (I=0,j=-1;I<cnt;I++) {j=j*-1; sum+=j*yy[ I];} } } }

64

````void

(thou%2!=0&&hun%2!=0& &ten%2!=0&&data%2!=0) {b[cnt]=a[I];cnt++;} for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;}

countValue() {int I,count=0,xx[30]; int j,k,m; cnt=0; sum=0; for(I=1;I<=90;I++) if(isPrime(I)) {xx[count]=I;count++;} for(I=0;I<count;I++) if (isPrime(xx[I]+4)&&is Prime(xx[I]+10)) {cnt++;sum+=xx[I];} }

69`
````void {int

```void jsVal()

62`

67
{int

I,thou,hun,ten,data,j; for(I=0;I<MAX;I++) {thou=a[I]/1000; hu

``void

countValue()

encryptChar()

n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if ((thou-hun-ten-data>= 0)&&a[I]%2==1) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I];b[I]=b [j];b[j]=data;} } } d

{ch=xx[I][j]; xx[I][j]=xx[I][k]; xx[I][k]=ch;} if (strl%2) half++; for(j=half;j<strl1;j++) for(k=j+1;k<strl; k++) if (xx[I][j]>xx[I][k]) {ch=xx[I][j]; xx[I][j]=xx[I][k]; xx[I][k]=ch;} }

73

if(!(c<=32||c>100 ````void )) xx[i][j] =c; } }

ConvertCharD(void) {int I; char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while (*pf) if (*pf=='a'){*pf='z';pf ++;} else if (*pf>='b'&&*pf<='z') {*pf-=1;pf++;} else pf++; } }

75

`````int jsSort(

) /*标准答案*/ {int I,j,count=0; Data val; for(I=0;I<200;I aa[I].x3) {bb[count].x1=aa[I]. x1; bb[count].x2=aa[I]. x2; bb[count].x3=aa[I]. x3; count ;} ) if(aa[I].x1>aa[I].x2

70

````void

CalValue(void) {int I,data; for(I=0;I<MAXNUM;I++) {if(!xx[I]) break; if(xx[I]>0) totNum++; data=xx[I]>>1; if (data%2) {totCnt++; totPjz+=xx[I];} } totPjz/=totCnt; }

72`
{int

```void jsVal()

I,thou,hun,ten,data,j; int ab,cd; for(I=0;I<MAX;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*data+thou; d=10*hun+ten; if ((ab%9==0||cd%9==0)&& ab%2!=1&&cd%2!=1&&ab! c d hu

74`

```void StrCha

for(I=0;I<count-1;I ) for(j=I 1;j<count;j ) if (bb[I].x1 bb[I]. x3<bb[j].x1 bb[j].x3) {val=bb[I]; =bb[j]; } return count; bb[I] bb[j]=val;}

rJL(void) /*标准答案, 有问题!!!*/ {int I,j,str; for(I=0;I<maxline;I ) {str=strlen(xx[I]); for(j=0;j<str;j ||xx[I][j]<<4>100) ; else } } void StrCharJL(void) { int i,j; char c; for(i=0;i<maxline;i ) for(j=0;j<strlen(xx [i]);j ) xx[I][j] =xx[I] [j]<<4; ) if (xx[I][j]<<4<=32

71````void jsSort()
{int I,j,k,strl,half; char ch; for(I=0;I<20;I++) {strl=strlen(xx[I]); half=strl/2; for(j=0;j<half-1;j+ +) for(k=j+1;k<half;k ++) if (xx[I][j]<xx[I][k])

=0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

76
{int

`````void jsVal()

I,thou,hun,ten,data,j; int ab,cd; for(I=0;I<200;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*data+thou; d=10*hun+ten; c d hu

{ c=xx[i][j]<<4;

if ((ab%2!=1&&cd%2==1)|| (ab%2==1&&cd%2!=1)&&( ab%17==0||cd%17==0)&& ab!=0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

ata=a[I]%10; if ((thou>=hun)&&(hun>=t en)&&(ten>=data)&&a[I ]%2!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I];b[I]=b [j];b[j]=data;} } }

} pjz1/=cnt;pjz2/=n;

fscanf(fp, ""%d,"", &xx[I*10+j]); fscanf(fp, ""'n""); if(feof(fp)) break;} ````void jsValue() fclose(fp); return 0;} void Compute(void) {int I, yy[MAX]; for(I=0;I<1000;I++) hu d if(xx[I]%2){odd++;av e1+=xx[I];yy[odd-1]=x x[I];} else{even++;ave2+=xx [I];} ave1/=odd; ave2/=even; for(I=0;I<odd;I++) totfc+=(yy[I]-ave1) *(yy[I]-ave1)/odd; }

81
{int =0;

I,thou,hun,ten,data,n for(I=0;I<300;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (thou+hun==ten+data) {cnt++;pjz1+=a[I];} else {n++;pjz2+=a[I];} } pjz1/=cnt;pjz2/=n; }

77
{int

`````void jsVal()

79
*n) *n=0;

````void

countValue(int *a,int {int I; hu d for(I=1;I<=1000;I++) if(I%7==0&&I%11){*a= I;*n=*n+1;a++;} else if(I%7&&I%11==0) {*a=I;*n=*n+1;a++;} }

I,thou,hun,ten,data,j; for(I=0;I<MAX;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if ((thou+ten==hun+data) &&a[I]%2!=1) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

82

````void jsValue()

84

````void

{int I; for (I=0;I<300;I++) if (isP(a[I])) {pjz1+=a[I];cnt++;}

CountRs(void) {int I,count,j; char *pf; for(I=0;I<10;I++) yy[I]=0; for(I=0;I<100;I++) {pf=xx[I];count=0; while (*pf) if(*pf=='1'){count+ +;pf++;} else pf++;

80`
{int =0;

```void

else pjz2+=a[I]; pjz1=pjz1/cnt; pjz2=pjz2/(300-cnt); }

jsValue() I,thou,hun,ten,data,n for(I=0;I<300;I++) {thou=a[I]/1000; hu n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (data-thou-hun-ten>0) {cnt++;pjz1+=a[I];} else {n++;pjz2+=a[I];} d

83

````int

if (count<=5) {pf=xx[I]; j=0; while (*pf) if (*pf=='1') {yy[j]+=1;j++;pf++;} else if (*pf=='0') {pf++;j++;} }

78
{int

ReadDat(void) {FILE *fp; int I,j; if((fp=fopen(""IN.DA T"",""r""))==NULL) return 1; for(I=0;I<100;I++) {for(j=0;j<10;j++)

````void jsVal()

I,thou,hun,ten,data,j; for(I=0;I<MAX;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; d hu

} } }

{data=b[I];b[I]=b [j];b[j]=data;}

jsVal() {int I,thou,hun,ten,data,j; for(I=0;I<MAX;I++) {thou=a[I]/1000; hu d

} pj=(float)(j*100/k)/ 100; 或者: cnt1=0;cnt2=0;pj=0.0; for(i=0;i<N;i++) if(xx[i]%2) cnt1++; else { cnt2++; pj+=xx[i]; } pj/=cnt2;

85
{int

````void jsVal()

87
{int ta;

````void jsValue()

n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if ((thou+data==hun+ten) &&a[I]%2==1) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I];b[I]=b [j];b[j]=data;} }

I,thou,hun,ten,data,j; for(I=0;I<300;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (data-thou-hun-ten>=0 &&a[I]%2!=1) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]>b[j]) {data=b[I];b[I]=b [j];b[j]=data;} } d hu

I,n=0,thou,hun,ten,da for(I=0;I<300;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; if (thou+data==hun+ten) {cnt++;pjz1+=a[I];} else {n++;pjz2+=a[I];} } pjz1/=cnt; } pjz2/=n; d hu

92
0]; +)

````

max=xx[

for(I=1,k=0;I<N;I+ {if (xx[I]>max) max=xx[I]; if (xx[I]%3==0||xx[I]%7= =0) {j+=xx[I];k++;} } for(I=0,cnt=0;I<N; I++) if (xx[I]==max) cnt++; pj=(float)(j*100/k )/100;

90

````jsValue(int

a[10][9]) ```void jsVal()

86
{int

88

{int value,I,j,k,num; ````void for(I=0;I<10;I++) {value=a[I][0]; for(j=0;j<9;j++) if (a[I][j]<value) {num=a[I][j]; for(k=j;k>0;k--) {num=a[I][j]; for(k=j;k>0;k--) a[I][k]=a[I][k-1]; a[I][0]=num; }} } }

ConvertCharA(void) {int I,j,k,strl; char ch; for(I=0;I<maxline;I hu d cd ]) {ch=xx[I][j]; xx[I][j]=xx[I][k]; xx[I][k]=ch;} } } ++) {strl=strlen(xx[I]); for(j=0;j<strl-1;j++) for(k=j+1;k<strl;k++) if(xx[I][j]>xx[I][k

I,thou,hun,ten,data,j; int ab,cd; for(I=0;I<200;I++) {thou=a[I]/1000; n=a[I]%1000/100; ten=a[I]%100/10; ata=a[I]%10; ab=10*thou+ten; =10*data+hun; if((ab-cd)>0&&(ab%2 !=1&&ab%5==0)&&cd%2== 1&&ab!=0&&cd!=0) {b[cnt]=a[I];cnt++;} } for(I=0;I<cnt-1;I++) for(j=I+1;j<cnt;j++) if(b[I]<b[j])

93

````void

Compute(void) {int I; for(I=0;I<1000;I++) {if(xx[I]%2) odd++; }

91

````for(I=0,j=0,

else

{even++;

cnt1=0,cnt2=0;I<N;I++) { if (xx[I]%2) cnt1++; else cnt2++; ````void if (I%2==0) {j+=xx[I];k++;}

aver=aver+xx[I];}} aver/=even; for(I=0;I<1000;I++) totfc+=(xx[I]-aver) *(xx[I]-aver)/MAX;

89`

}

94`
+)

} ```for(I=0,j=0

96`

{pf++;continue;} ```void *pf=*pf*11%256; pf++; } } } }

}

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) {if((*pf>='a'&&*pf <='z')||*pf*11%256<=3 2) {pf++;continue;} *pf=*pf*11%256; pf++;} } }

,cnt1=0,cnt2=0;I<N;I+ { if (xx[I]%2) cnt1++; else cnt2++; if (I%2) {j+=xx[I];k++;} } pj=(float)(j*100/k)/ 100; 或者: cnt1=0;cnt2=0;pj=0.0; k=0; for(i=0;i<N;i++) if(xx[i]%2) cnt1++; else cnt2++; for(i=1;i<N;i=i+2) { k++; pj+=xx[i]; pj/=k; }

99
PRO

`````void

SortDat() {int I,j; xy; for(I=0;I<99;I++) for(j=I+1;j<100;j++) if(sell[I].je>sell[ j].je) {xy=sell[I];se ll [I]=sell[j];sell[j]=x y;} else if(sell[I].je==sell[j ].je) if(strcmp(sell[I].d m,sell[j].dm)>0) {xy=sell[I];sell[I ]=sell[j];sell[j]=xy;} }

97

````void

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) {if((*pf>='0'&&*pf <='9')||*pf*11%256<=3 2) {pf++;continue;} *pf=*pf*11%256; pf++; } } }

95

````void

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ +) {pf=xx[I]; while(*pf!=0) {if((*pf*11%256>=' A'&&*pf*11%256<='Z')| |*pf*11%256<=32) {pf++;continue;} *pf=*pf*11%256; pf++; } }

100

`````void

CharConvA(void) ````void {int I,j,strl; char ch; for(I=0;I<maxline;I+ +) {strl=strlen(xx[I]); ch=xx[I][strl-1]; for(j=strl-1;j>0;j {pf=xx[I]; while(*pf!=0) {if(((*pf*17%256)% --) {xx[I][j]>>=4; xx[I][j]+=xx[I][j-1];} xx[I][0]+=ch;

98

encryptChar() {int I; char *pf; for(I=0;I<maxline;I+ +)

2!=0)||*pf*17%256<=32)


相关文章:
三级网络南开100题
2010年最新三级网络南开10... 33页 免费 2010年三级网络南开100题(... 40页...2、每种题目,只用一种解题方法,兰色部分为解题答案,此种方法本人觉得容易理解,...
2013年3月计算机三级网络技术上机部分(南开100题题...
2013年3月计算机三级网络技术上机部分(南开100题题库)最新!!_IT认证_资格考试/认证_教育专区。2013年3月计算机三级网络技术上机部分(南开100题题库)最新!! ~ ...
南开100题下载 09年4月三级网络技术 南开上机100题...
三级网络技术上机南开100题... 57页 免费 2010年版...答案: 答案: void fun (int *s, int t, int ...(4)若 x0-x1 的绝对值小于 0.000001,则执行...
计算机三级网络最新南开100题(1)
计算机三级网络最新南开100题(1)_IT/计算机_专业...答案: void StrOL(void) {int I,j,k,strl,l;...(4)若 X0-X1 绝对值小 0.000001,执行步骤(5)...
计算机三级网络最新南开100题(2)
计算机三级网络最新南开100题(2)_IT/计算机_专业...---void StrCharJL(void) /*标准答案,有问题!!...2010年计算机三级网络南... 54页 2下载券 最新...
全国计算机等级考试三级上机南开100题(后附答案)
2010年三级网络技术南开... 36页 1财富值 计算机...全国计算机等级考试三级上机南开100题答案word版可打印...(4)若 X0-X1 的绝对值小于 0.000001,执行步骤...
最新三级上级南开100题(精华)
goodgaolei贡献于2010-10-22 0.0分 (0人评价)暂无...南开三级100题答案分析 28页 1财富值 三级网络上机...(4)若 X0-X1 的绝对值小于 0.000001, (100 ...
计算机三级网络南开100题(1)
09 年计算机三级网络南开 100 题【1】2009-03-26...答案: void StrOR(void) {int I,j,k,index,...取消回复 ?2010 Baidu 百度空间 | 百度首页 | ...
2010年二级C上机题库南开100题(有答案 无解析)
2010年二级C上机题库南开100题(答案 无解析) - 你好,计算机二级考试上机考试的题目出于这 100 道题,改变的只是某些数据。题型是不会改变的。建议考试过 程中...
最新南开100题三级网络技术
最新南开100题三级网络技术 - } 1 请编写一个函数 jsValue(int m,int k,int xx[]),该函 void readDat() 数的功能是: 将大于整数 m 且紧靠 m...
更多相关标签: