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

¿´¿´c×¢ÊÍ \\

ͻȻ·¢ÏÖÕâÑùдעÊͳÌÐòÊdzö´íµÄ
C/C++ code:

#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("hello");// \
system("pause");
}



//Àï²»ÄܳöÏÖ\¡£¡£¡£²»ÖªµÀʲôԭÒò
¿ÉÒÔÕâÑùŶ¡£¡£
C/C++ code:

#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("hello");/* \ */
system("pause");
}



/\/ÕâÑùµ±È»²»ÐÐ

д c ¾Í²»ÒªÓà // À²

ÄÇÊÇ c++ µÄ×¢ÊÍ·ûºÅ

²¹³äÏ¡£¡£¡£
ÎÒÎʵÄÊÇ // \»áÒýÆð³ÌÐò³ö´íµÄÔ­Òò

¡®\¡¯µÄÒâ˼ÊÇÁíÆäÒ»ÐУ¬ÆðÁ¬½Ó×÷ÓÃ


ÒýÓÃ
ͻȻ·¢ÏÖÕâÑùдעÊͳÌÐòÊdzö´íµÄ

C/C++ code

#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("hello");// \
system("pause");
}



//Àï²»ÄܳöÏÖ\¡£¡£¡£²»ÖªµÀʲôԭÒò
¿ÉÒÔÕâÑùŶ¡£¡£

C/C++ code

#includ¡­¡­


¿ÉÄÜÊÇÄãµÄ±àÒëÆ÷ÓÐÎÊÌâ°É£¡ÎÒ¸Õ¸ÕÓÃVC++6.0ÊÔ¹ýÁË£¬³ÌÐòÖС°printf("hello");// \ ¡±Ã»ÓдíÎó....

û´íÎ󣬵« system("pause");ûִÐÐ



Ïà¹ØÎÊ´ð£º

CµÄѧϰ;¾¶ - C/C++ / ÐÂÊÖÀÖÔ°

ÎÒֻѧ¹ýÇ廪À¶·âÃæµÄCÓïÑÔ»ù´¡£¬Ïë¸üÉîÈëµÄѧϰ£¬¸Ã¿´Ê²Ã´ÊéºÃ£¿
C Primer Plus
C³ÌÐòÉè¼ÆÓïÑÔ(µÚ2°æÐ°æ)
CÓïÑÔ³ÌÐòÉè¼Æ_ÏÖ´ú·½·¨
CÓïÑԲο¼ÊÖ²áµÚÎå°æ
CÓïÑÔ´óÈ«
CºÍÖ¸Õë
CÏÝÚåÓëȱÏÝ
Cר¼Ò±à³Ì

......

C/C++/MFCȺ - VC/MFC / ·Ç¼¼ÊõÀà

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

°ïæ¿´¿´Õ⼸¸ö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 ......

c¾²Ì¬±àÒëÁíÒ»¸öÎļþ¼ÐµÄ¿âº¯Êý - C/C++ / CÓïÑÔ

ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º
gcc -c log.c
ar crv liblog.a log.o
±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......

c#Éú³ÉxmlÎļþ - .NET¼¼Êõ / C#

˼·£ºÒªÓÃc#Éú³ÉÒ»¸ö²¥·Å»úµÄ²¥·ÅÁбíµÄxml£¬ÀýÈ磺
<daty datys='2010-04-05' datye='2010-05-01' > //ÕâÊDz¥·ÅµÄÈÕÆÚ¶Î
  <time times='01:12:00' timee='02:30:00'> ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ