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

C¸ßÊÖ°ï°ïæ~

ÎÒÊÇÏëÓÃmalloc½¨Á¢5¸ö¿Õ¼ä È»ºóÿ¸ö¿Õ¼äÀï½øÈ¥Ò»¸öÖµ ÔõôŪ°¡~ °ÝÍÐÁË




#include<stdio.h>
int main()
{
 int i;
 int *pN;

 pN = (int*)malloc(5*sizeof(int));
 
  printf("input numbers: ");
 for(i=0;i<5;i++)
 {


  scanf("%d",pN);
 
 }
printf("%d",pN);
free(pN);



scanf("%d",&pN[i]);//ÏñÊý×éÒ»ÑùÓÃ

C/C++ code:
#include<stdio.h>
int main()
{
int i;
int *pN;

pN = (int*)malloc(5*sizeof(int));

printf("input numbers: ");
for(i=0;i<5;i++)
{
int temp=0;
scanf("%d",&temp);
pN[i]=temp;
}
printf("%d",pN);
free(pN);

}


#include<stdio.h>
int main()
{
 int i;
 int *pN;

 pN = (int*)malloc(5*sizeof(int));
 
  printf("input numbers: ");
 for(i=0;i<5;i++)
 {


  scanf("%d",pN+i);
 
 }
 for(i=0;i<5;i++)
 {


  printf("%d ",*(pN+i));
 
 }

free(pN);

}

scanf("


Ïà¹ØÎÊ´ð£º

c,c++Á¬½Ómysql ÕÒ²»µ½Í·²¿Îļþ£¨ÐÂÊÖ£©

±àÒëÆ÷£ºC-Free4
mysql µ¥¶À°²×°µÄ£¬ÏÖÔÚΪapache+php+mysql¿ÉÒÔʹÓá£
×î½üÔÚÁ·Ï°c£¬c++£»ÏëÓÃc£¬c++Á¬½ÓÏÂÎÒµÄmysql£¬ºÃ¶àµØ·½¶à˵mysql.hÕÒ²»µ½¡£¶øÇÒÎÒmysqlûÓÐËùνµÄincludeÎļþ¼Ð°¡¡£
Íü¸ßÊÖÖ¸µãÒ»¶ ......

¸ÕѧC£¬ÓÃCʵÏÖ±àÂë - C/C++ / CÓïÑÔ

#include"stdio.h"
#include"stdlib.h"
void ContrTwo(char i)
{
char str1[8];
itoa(i,str1,2);
printf("%s",str1);
}
unsigned char leftRot(char str,int i);
unsign ......

C/C++ÀïÆÁshift+f10¼üÒªÔõôд£¡ - C/C++ / C++ ÓïÑÔ

SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html ......

Çó½Ìc/c++ÓïÑÔÏà¹ØÎÊÌâ - C/C++ / CÓïÑÔ

ÓÐÒ»10*10¾ØÕ󣬳ýÈ¥µÚÒ»¸öµã£¨0£¬0£©ºÍ×îºóÒ»µã£¨9£¬9£©£¬»¹Óа˸öµãΪ1£¬ÆäËû¶¼Îª0£¬ÒªÇóÓöþάÊý×é±íʾ¡£°Ë¸öµãÊÇËæ»úÉú³ÉµÄ£¬±àдÏà¹Ø³ÌÐò±íʾ¾ØÕóËùÓпÉÄÜÇé¿ö¡£
ÕæÐÄÇó½Ì¸÷λ¸ßÊÖ£¬°¥£¡±¾ÈËÌ«²ËÁË£¡ºÇºÇ£¡
......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ