三级网络技术上机题库缩印版(6)
发布时间:2021-06-06
发布时间:2021-06-06
} if(xx[i]%3==0 } fclose(fp); ||xx[i]%7==0) } return 0; { 69) void encryptChar() } j+=xx[i]; { void Compute(void) k++; int i,j; { } int str; int i; } char ch; int tt[MAX]; for(i=0,cnt=0;i<N;i++) for(i=0;i<maxline;i++) for(i=0;i<1000;i++) if(xx[i]==max) { if(xx[i]%2!=0) cnt++; str=strlen(xx[i]); { pj=(float)(j*100/k)/100; for(j=0;j<str;j++) odd++; ave1tt[odd+=-1]xx[i]=xx[i]; ; } else { xx[i]; even++; ave1/ = odd ave2+=;} for(i =ave2/0;i<odd=even;;i - totfc+=(tt[i]++-) } ave1)/odd; ave1)*(tt[i]61){ int ReadDat(void) FILE *fp; int i,j; if((fp=fopen("IN.DAT","r"))==NU LL) return 1; for(i=0;i<100;i++) { for(j=0;j<10;j++) fscanf(fp,"%d,",&xx[i*10+j]); fscanf(fp,"\n"); } if(feof(fp)) break; fclose(fp); return 0;} void Compute(void) { int i; for(i=0;i<1000;i++) { if(xx[i]%2!=0) odd++; else even++; aver+=xx[i]; } aver/=MAX; for(i=0;i<1000;i++) totfc+=(xx[i]-aver)*(xx[i]-aver )/MAX;} 62){ void Compute(void) int i,tt[MAX]; for(i=0;i<1000;i++) if(xx[i]%2!=0) { odd++; ave1+=xx[i]; } else { even++; ave2+=xx[i]; tt[even-1]=xx[i]; } ave1/=odd; ave2/=even; for(i=0;i<even;i++) totfc+=(tt[i]-ave2)*(tt[i]-ave2 )/even;} 63) {void main() int i,k,cnt,xx[N],max; float pj; FILE *fw; long j=0; system("CLS"); fw=fopen("out.dat","w"); read_dat(xx); max=xx[0]; for(i=1,k=0;i<N;i++) { if(xx[i]>max) max=xx[i]; printf("\n\nmax=%d,cnt=%d,pj=%6.2f\n",max,cnt,pj); fprintf(fw,"%d\n%d\n%6.2f\n",max,cnt,pj); fclose(fw);} 64)*n) void countValue(int *a,int { int i; *n=0 ; for(i=1;i<=1000;i++) i%11!=0)||(i%7!=0 && i%11==0)) if((i%7==0&& { *n=*n+1; *a=i; } a++; } 65){ double countValue(int n) int i; double sum=0.0; for(i=1;i<n;i++) if(i%3==0 && i%7==0) ); sum+=i; sum=sqrt((double)sum66) return sum;} { void encryChar() int i,j; int str; char ch; for(i=0;i<maxline;i++) { str=strlen(xx[i]); *11%256; for(j=0;j<str;j++) { ch=xx[i][j] (ch>='A' && ch<='Z')) if(ch<=32|| continue; else } xx[i][j]=ch; } } 67) void encryChar() { int i,j; int str; +) char ch; for(i=0;i<maxline;i+ { str=strlen(xx[i]); for(j=0;j<str;j++) ch=xx[i][j]*13%256; { (ch%2==0)) if((ch<=32)|| continue; else } xx[i][j]=ch; } } 68) void encryChar() { int i,j; int str; for(i=0;i<maxline;i++) char ch; { str=strlen(xx[i]); for(j=0;j<str;j++) ch=xx[i][j]*11%256; { if((xx[i][j]>='0'&& xx[i][j]<='9') || ch<=32) continue; else } xx[i][j]=ch; { ch=xx[i][j]*11%256; ch<=32) if(xx[i][j]%2==0|| continue; else xx[i][j]=ch; } } }
70)void encryptChar() { int i,j; int str; char ch; for(i=0;i<maxline;i++) { str=strlen(xx[i]);
for(j=0;j<str;j++) { ch=xx[i][j]*11%256; && ch<='9') ) if(ch<=32 || (ch>='0' continue; else xx[i][j]=ch; } } } 71)void encryptChar(){ int i,j; int str; char ch; for(i=0;i<maxline;i++) { str=strlen(xx[i]); for(j=0;j<str;j++) { || ch<=32) if ch=xx[i][j]*11%256; ((ch>='a' && ch<='z') else continue; xx[i][j]=ch; } } } 72){ void encryChar() int i,j; int str; char ch; for(i=0;i<maxline;i++) { str=strlen(xx[i]); for(j=0;j<str;j++) { ch=xx[i][j]*11%256; if(ch<=32 || ch%2!=0) continue; xx[i][j]=ch; } }} 73) { void encryChar() int i,j; int str; char ch; for(i=0;i<maxline;i++) { str=strlen(xx[i]); for(j=0;j<str;j++) { if((xx[i][j]>= ch=xx[i][j]*11%256; xx[i][j]<='Z')|| ch<=32) 'A'&& else continue; xx[i][j]=ch; } } } 74){ void encryptChar() int str;
int i,j; 6
上一篇:湖南省发展独立学院问题探讨