Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

Ò»¸ö¼òµ¥µÄcÑ­»·¿ØÖÆÌâ

Ò»¸öÊýÈç¹ûºÃµÈÓÚËüµÄÒò×ÓÖ®ºÍ£¬Õâ¸öÊý¾Í³ÉΪ"ÍêÊý",ÀýÈç6µÄÒò×ÓΪ1£¬2£¬3¶ø6=1+2+3,¶ø6=1+2+3,Òò´Ë6ÊÇ¡°ÍêÊý".±à³ÌÐòÕÒ³ö1000Ö®ÄÚµÄËùÓÐÍêÊý£¬²¢°´ÏÂÃæ¸ñʽÊä³öÆäÒò×Ó£º6 its factors are 1,2,3
ÎҵijÌÐòÈçÏ ¿É½á¹û´íÁË Ï£Íû´óϺ°ï¸ÄÒ»ÏÂ
#include <stdio.h>
#include <conio.h>
void judge(int s)
{
int i,a[20],k = 0,sum = 0;
for(i = 1;i < s;i++)
  if(s % i == 0 && i != s)
  a[k++] = i;
  for(i = 0;i < k;i++)
  sum = sum + a[k];
  if(sum == s)
  {
  printf("%d",s);
  printf("its factors are ");
  for(i = 0;i < k;i++)
  printf("%d,",a[i]);
  printf("\n");
  }
}
void main()
{
int i;
clrscr();
for(i = 0;i < 1000;i++)
judge(i);
getch();
}


C/C++ code:
sum = sum + a[i];


Äã´æ´¢Êý¾ÝµÄÊý×é²»¹»´ó£¬»á³öÏÖÔ½½ç´íÎó¡£
¸Ä³É£ºint a[200],ÕâÑù³ÌÐò¾Í²»»á³öÏÖ´íÎóÁË¡£

ͬÒâÂ¥ÉϵÄ˵·¨£¬¶¨Òå³Éa¡¾20¡¿¾Í»á³öÏÖÔ½½ç´íÎó£¬ÁíÍâsum=sum+a¡¾i¡¿Ó¦¸ÃÊÇÄãÊèºöÁ˰ɡ£¡£¡£

kºÃÏñÐèÒª¹éÁ㣬¶øÇÒºÃÏñȱÉÙ{}À¨ºÅ£¬³ÌÐòÁ÷³Ì²»ÊÇÄãµÄ±¾Òâ·½Ïò¡­¡­

ÒýÓÃ
ͬÒâÂ¥ÉϵÄ˵·¨£¬¶¨Òå³Éa¡


Ïà¹ØÎÊ´ð£º

pro*c ÀïÔõô½«select µÄ·µ»ØÄÚÈݸ³Öµ¸ø±äÁ¿ÄÇ£¿

pro*c ÀïÔõô½«select µÄ·µ»ØÄÚÈݸ³Öµ¸ø±äÁ¿ÄÇ£¿


EXEC SQL BEGIN DECLARE SECTION;
  char CALLNO[30];
EXEC SQL END DECLARE SECTION;

 
  EXEC SQL SELECT CALLNO ......

pro*c ÀïÔõô½«select µÄ·µ»ØÄÚÈݸ³Öµ¸ø±äÁ¿

pro*c ÀïÔõô½«select µÄ·µ»ØÄÚÈݸ³Öµ¸ø±äÁ¿

EXEC SQL BEGIN DECLARE SECTION;
      char CALLNO[30];
  EXEC SQL END DECLARE SECTION;

 
  EXEC SQL S ......

c»ù´¡

#include <string.h>
#include <stdio.h>

void main()
{
int i;
char buf[]="abcde";
strncpy(buf,"abc",3);
for(i=0;i <5;i++)
printf(&q ......

°Ù˼²»µÃÆä½âµÄC³ÌÐòÎÊÌ⣬¸ßÊÖÇë½ø£¡

ÎÊÌâÃèÊö£º
ÓÐÒ»¼òµ¥µÄC³ÌÐò£¬ÈçÏ£º
void foo ( ) {
int i ;
p r i n t f ( "%d " , i ++);
}
int main ( ){ int j ;
for ( j = 0 ; j < 1 0 ; ++j ) foo ( ) ;
}

º¯ ......

Çë½Ìc¸ßÊÖ£¬defineµÄÎÊÌâ

¸÷λ´óÏÀ£¬Ð¡µÜÓÐÒ»¸öÎÊÌâÇë½Ì£¬ÈçÏÂ
Õâ¸ö #define stack_push ÊÇÒ»¸öº¯Êý£¬µ÷ÓÃÊÇÕâÑùµÄ

int len;
stack_t *stack;
const char *curpos;
int seglen;
const char *next_slash;
int i;
......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ