Ծţ11833
ԣC
Ծgl1
Ծܷ֣100
ͣ6


һ   10 20֣


1 2.0֣  :1531
 char w,int x,float y,double z;ʽw*x+z-yĽΪ1.
𰸣

=======(1)=======
double
==================
˫


2 2.0֣  :310
a=3,b=2,c=1;ʱ,ִ³κ c=1.



if(a>b)  a=b; 

if(b>c) b=c;

else c=b;

c=a;
𰸣

=======(1)=======
2


3 2.0֣  :322
Ľǡ1,int a=-1;printf("%x",a);
𰸣

=======(1)=======
ffff


4 2.0֣  :653
int x;  x=-3+4*5-6,  xֵΪ1.
𰸣

=======(1)=======
11


5 2.0֣  :1134
ж:char s[ ]="china";

Turbo CϵͳΪs١1ֽڵڴ浥Ԫ.
𰸣

=======(1)=======
6


6 2.0֣  :1543
Cеá1رļ.
𰸣

=======(1)=======
fclose
==================
fclose()


7 2.0֣  :1285
ͱaֵ.

int a; scanf("%d",1);
𰸣

=======(1)=======
&a


8 2.0֣  :1437
CԴļĺ׺.C֮ɺ׺Ϊ.OBJġ1ļɺ׺.EXEĿִļ
𰸣

=======(1)=======
Ŀ


9 2.0֣  :1183
a,bΪ,ʽ



(a=5,b=2,a>b?a++:b++,a+b)



ֵǡ1.
𰸣

=======(1)=======
8


10 2.0֣  :681
֪ a=10,b=15,c=1,d=2,e=0,ʽ(c==b)>eֵΪ1.
𰸣

=======(1)=======
0



ж   10 10֣


1 1.0֣  :1576
CעͲϢ
𰸣N

2 1.0֣  :24
CֻԪضһ顣
𰸣Y

3 1.0֣  :1569
int a=2,b=2;ifa==3b=1;ִкbֵ1
𰸣N

4 1.0֣  :21
scanf("%7.2f",&a);һϷscanf
𰸣N

5 1.0֣  :1574
switch䲻if档
𰸣N

6 1.0֣  :5
ж䣺
int a[3][3]={{3,5},{8,9},{12,35}},i,sum=0;
for(i=0;i<3;i++) sum+=a[i][2-i];sum=21.
𰸣Y

7 1.0֣  :1109
ַеַͬʱַܽСıȽ
𰸣N

8 1.0֣  :31
ͬռڴ泤ȵĳԱĳȡ
𰸣Y

9 1.0֣  :26
int a[3][4]={{1},{5},{9}}; ǽеһ
ԪظֵԪֵΪ0
𰸣Y

10 1.0֣  :14
fopen("file","r+");򿪵ļ"file"Խ޸ġ
𰸣Y


ѡ   15 30֣


1 2.0֣  :639
ȷ鲢ȷֵǣ
A:int N=5,b[N][N];
B:int a[1][2]={{1},{3}};
C:int c[2][]={{1,2},{3,4}};
D:int d[3][2]={{1,2},{34}};

𰸣D

2 2.0֣  :608
ѡУϷCԹؼǣ
A:VAR
B:cher
C:integer
D:default

𰸣D

3 2.0֣  :4558
й C Ե (      ) 


A:ӢĸСд
B:ͬ͵ıԳͬһʽ

C:ڸֵʽиֵߵͿԲͬ
D:ĳЩڲͬĳϿвͬĺ

𰸣A

4 2.0֣  :528
voidͺʱΪ
A:Զ庯е
B:ѭ
C:ifĳɷ
D:ʽ

𰸣D

5 2.0֣  :3138
int a=2,ִʽa-=a+=a*a,aֵ
A:-8
B:-4
C:-2
D:0

𰸣D

6 2.0֣  :4552
±ʶУΪϷCûʶǣ
A:yu
B:7u
C:=9
D:a+3

𰸣A

7 2.0֣  :3553
ѡкϷûʶ______
A:long
B:_2Test
C:3Dmax
D:A.dat

𰸣B

8 2.0֣  :111
CУintռ2ֽڣunsignedռ
A:1ֽ
B:2ֽ
C:4ֽ
D:8ֽ

𰸣B

9 2.0֣  :145
䶨sizeof(x)sizeof(y)sizeof(a)sizeof(b)
΢ϵֱֵΪ
char  x=65;
float  y=7.3;  
int  a=100; 
double  b=4.5;
A:2,2,2,4
B:1,2,2,4
C:1,4,2,8
D:2,4,2,8

𰸣C

10 2.0֣  :572
ʽ18/4*sqrt(4.0)/8ֵΪ
A:int
B:float
C:double
D:ȷ

𰸣C

11 2.0֣  :3154
int a=2,b=3,c=0,ȷ
A:a>b!=ca>(b!=c)ִ˳һ
B:!a!=(b!=c)ʽֵΪ1
C:a||(b=c)ִкbֵΪ0
D:a&&b>cĽΪ

𰸣B

12 2.0֣  :3560
tΪintͣѭ֮ǰtֵΪ0
while( t=1 )
{ }
ȷ______

A:ѭƱʽֵΪ0
B:ѭƱʽֵΪ1
C:ѭƱʽϷ
D:˵

𰸣B

13 2.0֣  :93
Уȼߵǣ
A:?:
B:++
C:&&
D:,

𰸣B

14 2.0֣  :199
int a[][]={{1,2},{3,4}};  *(a+1),*(*a+1)ĺֱΪ
A:Ƿ,2
B:&a[1][0],2
C:&a[0][1],3
D:a[0][0],4

𰸣B

15 2.0֣  :144
aΪͱֵΪ12ִa+=a-=a*aaֵǣ
A:552
B:144
C:264
D:-264

𰸣D


ġ   2 20֣


1 10.0֣  :479
/*-------------------------------------------------------
ա
---------------------------------------------------------

:ʮСΧһȦǹʦָһС 10 飬ڶ
     С 2 飬С 8 飬ĸС 22 飬
     С16 飬С 4飬߸С 10 飬ڰ˸С
     6 飬ھŸС 14 飬ʮС20 顣ȻеС
     ͬʱԼеǷһߵСǿΪ
     ʦҪһ顣ʾεеǵĿ
     һÿ˸жٿǣ

 -------------------------------------------------------*/
#include <stdio.h>
main()
{ 
  int i,count=0,a[11]={0,10,2,8,22,16,4,10,6,14,20} ;
  /***********SPACE***********/
  while(?)                                 
  { 
    for(i=1 ; i<=10 ; i++)
    a[i-1]=a[i-1]/2+a[i]/2 ;
    a[10]=a[10]/2+a[0] ;
    for(i=1 ; i<=10 ; i++)
      /***********SPACE***********/
      if(?) a[i]++ ;                        
    for(i=1 ; i<10 ; i++)
      /***********SPACE***********/
      if(a[i]!=a[i+1]) ?;                
    if(i==10) 
      break ;
    else 
    {
      a[0]=0 ;
      count++ ;
    } 
  } 
  printf("count=%d number=%d\n",count,a[1]) ;
}
𰸣

=======(1)=======
1

=======(2)=======
a[i]%2 == 1

=======(3)=======
break


2 10.0֣  :163
/*-------------------------------------------------------
ա
---------------------------------------------------------

Ŀ³Ĺǣöַڸвûֵʾ
      ҽдʵķŻ䣬ʹʵ书ܡ
      5ΪҵλΪ6
      10Ϊ10δҵ

-------------------------------------------------------*/
#include "stdio.h"
#define N 10
main()
{ 
int a[ ]={0,1,2,3,4,5,6,7,8,9},k;
int low=0,high=N-1,mid,find=0;
printf("ҵֵ\n");
scanf("%d",&k);
while (low<=high)
{
/***********SPACE***********/
mid=?;
if(a[mid]==k)
{
printf("ҵλΪ%d\n",mid+1);find=1;
}
if(a[mid]<k)
/***********SPACE***********/
?;
else
/***********SPACE***********/
?;
}
if(!find) printf("%dδҵ\n",k);
}

𰸣

=======(1)=======
( low + high )/2

=======(2)=======
low= mid + 1

=======(3)=======
high=mid-1



塢Ĵ   1 10֣


1 10.0֣  :361
/*------------------------------------------------------    
Ĵ
--------------------------------------------------------

ܣѡ񷨶еnԪذС˳

------------------------------------------------------*/

#include <stdio.h>
#define N 20 

void fun(int a[], int n)
{
  int i, j, t, p;
  for (j = 0 ;j < n-1 ;j++) 
  {
    /**********FOUND**********/
    p = j
    for (i = j;i < n; i++)
    /**********FOUND**********/
      if(a[i] >a[p])
        /**********FOUND**********/
        p=j;
    t = a[p] ; 
    a[p] = a[j] ; 
    a[j] = t;
  }
}

main()
{
  int a[N]={9,6,8,3,-1},i, m = 5;
  printf("ǰ:") ;
  for(i = 0;i < m;i++) 
    printf("%d ",a[i]); 
  printf("\n");
  fun(a,m);
  printf(":") ;
  for(i = 0;i < m;i++) 
    printf("%d ",a[i]); 
  printf("\n");
}
𰸣

=======(1)=======
p = j;

=======(2)=======
if(a[i] < a[p])
==================
if(a[p] > a[i])

=======(3)=======
p = i;



   1 10֣


1 10.0֣  :411
/*------------------------------------------------
ơ
--------------------------------------------------

ܣ xʽ㲢 y ֵ

           -1      x<0
      y=    0      x=0
            1      x>0

------------------------------------------------*/

#include<stdio.h>
void  wwjt(); 

int fun(int n)
{
 
  /**********Program**********/





  /**********  End  **********/
  
}
void main ()
{
    int  x,y;
    printf("enter x:");
    scanf("%d",&x);
    y=fun(x);
    printf("x=%d,y=%d\n",x,y);
    wwjt();
}

void wwjt()
{
  FILE *IN,*OUT;
  int i;
  int iIN;
  long int iOUT;
  IN=fopen("in.dat","r");
  if(IN==NULL)
  {
    printf("Please Verify The Currernt Dir..it May Be Changed");
  }
  OUT=fopen("out.dat","w");
  if(OUT==NULL)
  {
    printf("Please Verify The Current Dir.. it May Be Changed");
  }
  for(i=0;i<5;i++)
  {        
    fscanf(IN,"%d",&iIN);
    iOUT=fun(iIN);
    fprintf(OUT,"%ld\n",iOUT);
  }
  fclose(IN);
  fclose(OUT);
}
𰸣    int m;
    if(n<0)
      m=-1;
    else 
      if(n==0) m=0;
    else m=1;
return m;

   int m;
   if(n>=0)
      if(n>0)  
         m=1;
      else m=0;
   else m=-1;
return m;






