浙江大学C语言上机题及答案1(8)

long factorsum(int number) {

int a,b=0;

for(a=1;a

50008

#include \int main( ) {

int ri,repeat; int i, m, n;

int is(int number);

scanf(\for(ri=1;ri<=repeat;ri++){ scanf(\for(i=m;i<=n;i++) {if(i==is(i)) printf(\printf(\} }

int is(int number) {

int a=0;

while(number) {

a=a+(number)*(number)*(number); number=number/10; }

return a; }

50009

#include int main( ) {

int ri, repeat;

long in, res;

long reverse(long number);

scanf(\for(ri=1; ri<=repeat; ri++) {

scanf(\res=reverse(in); printf(\} }

long reverse(long number) {

int a[10],b=0,c=0,d,e=0; if(number<0)

{number=-number,c=1;} while(number) {

b=b+1;

a[b]=number; number=number/10; }

for(d=1;d<=b;d++) e=e*10+a[d]; if(c==1) e=-e; return e; }

50010

#include \int main( ) {

int ri,repeat;

int i,n;

void dectobin(int n);

scanf(\for(ri=1;ri<=repeat;ri++){ scanf(\dectobin(n); printf(\}

}

void dectobin(int n) {

int a[100],b=0,c,d=0; while(n) { b=b+1; a[b]=n%2; n=n/2;

}

for(c=b;c>=1;c--) printf(\}

60001

#include int main( ) {

int ri, repeat; int i, n, sum=0; float aver; int a[10];

scanf(\for(ri=1; ri<=repeat; ri++){ scanf(\for(i=0; i

60002

#include int main( ) {

int ri, repeat;

int i, index, n,max; int a[10];

scanf(\for(ri=1; ri<=repeat; ri++){ scanf(\scanf(\max=a[0],index=0; for(i=1; i

if(max

max=a[i],index=i;}

printf(\} }

60003

#include int main( ) {

int ri, repeat; int i, n, temp; int a[10];

scanf(\for(ri=1; ri<=repeat; ri++){ scanf(\for(i=0; i=0; i--) printf(\printf(\} }

60004

#include int main( )

{

int ri, repeat;

int i, index, n, r,s,ind; int a[10];

scanf(\for(ri=1; ri<=repeat; ri++){ scanf(\scanf(\

index=0,ind=0; for(i=1; i

if(a[index]>a[i]) index=i;}

r=a[0],a[0]=a[index],a[index]=r; for(i=1; i

{if(a[ind]

s=a[n-1],a[n-1]=a[ind],a[ind]=s; for(i=0; i

60005

#include int main( ) {

int ri, repeat;

int i, index, k, n, temp,r; int a[10];

scanf(\for(ri=1; ri<=repeat; ri++){ scanf(\for(i=0; i

{if(a[r]>a[r-1])

temp=a[r],a[r]=a[r-1],a[r-1]=temp;} }

for(i=0; i

60011

#include \int main( ) { int ri,repeat;