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

¡¾Çë½Ì¡¿¹ØÓÚCÔ´ÎļþµÄ×éÖ¯½á¹¹


´ó¼ÒºÃ£¬×î½üÔÚдһ¸öC³ÌÐòʱ£¬Óöµ½ÁËÖØ¸´¶¨ÒåµÄÎÊÌâ¡£Çó¸ßÊÖ¡­¡­
˳±ãÎÊÎÊC³ÌÐò¿ª·¢µÄ×éÖ¯½á¹¹¡­¡­

³ÌÐòÖУ¬³ÌÐò¸ù¾Ýchar buff[]ÖеÄ×Ö·ûµÄÀàÐÍ£¨ÈçÓ¢ÎÄ×Öĸ£¬Êý×Ö£¬±êµãetc£©£¬ÀûÓú¯Êý×ªÒÆ±íÑ¡Ôñ²»Í¬µÄ´¦Àíº¯Êý¡£ÕâЩº¯Êý¶¼²»ËãС£¬»ù±¾½á¹¹Ò»Ñù£¬µ«´¦ÀíÄÚÈݺܲ»Ïàͬ£¬Òò´ËÎÞ·¨ºÏ²¢ÎªÒ»¸öÎļþ¡£ÔÚÕâЩ´¦Àíº¯ÊýÖУ¬ÓкܶàÃüÃûÏàͬµÄ±êʶ·û£¬ÕæµÄÓкܶ࣬¶øÇÒÓõ½Á˺ܶàÏàͬµÄ½á¹¹£¬±ÈÈçstruct£¬µ«structÖеÄÔªËØÏî²¢²»Ïàͬ¡£

ÎÒʹÓÃVC++¿ª·¢£¬½«ÕâЩ²»Í¬µÄº¯Êý·âװΪ.libÎļþ£¬ÔÚÖ÷³ÌÐòÖÐ#pragma comment£¬ÀýÈ磺#pragma comment( lib, "SingelChProcess.lib" )¡£µ±ÎÒ#pragmaÁËÁ½¸öÒÔ²»Í¬µÄº¯Êý·â×°µÄlibºó£¬¾Í³öÏÖÁËÖØ¸´¶¨ÒåµÄÎÊÌâ¡­¡­±êʶ·ûÌ«¶à£¬²»¿ÉÄÜÈ«¸Ä¹ý¡­¡­

ÎÒ¸ÃÔõô°ì£¿

»òÕß˵£¬µ±ÎҵijÌÐòºÜ´óʱ£¬ÎÒ¸ÃÔõÑù×éÖ¯Ô´Îļþ£¿ÎÒÏÖÔÚÊÇʹÓÃLib½«ËûÃÇ·â×°ÆðÀ´£¬ÓеÄʱºòʹÓÃ.objµÄ·½Ê½·â×°¡£ÎÒºÜÏëÖªµÀ£¬ÕæÕýÔÚ¿ª·¢Ò»¸öCÈí¼þʱ£¬ÊÇÔõÑù×éÖ¯ÄÇЩ¸öCÔ´ÎļþµÄ£¿

ÎÒÔÚ¡¶CÏÖ´ú·½·¨¡·Öп´µ½½«²»Í¬µÄº¯Êý·Ö¸îΪ.cºÍÓëÖ®ÏàÅäµÄ.h£¬ÔÚÒªÓõ½¸Ãº¯ÊýµÄ³ÌÐòÖÐ#include£¬µ«ÎÒÔõôÊÔ¶¼²»ÕýÈ·¡­¡­Ìáʾ˵£ºÎ´¶¨ÒåµÄÍⲿº¯Êý¡­¡­

Î񼆼̮æ´óÐͳÌÐòµÄÔ´Îļþ½á¹¹µ½µ×ÊÇÔõô×éÖ¯µÄ£¿

ÎÒ»¹Ã»ÓÐʵ¼Ê¿ª·¢¹ýºÜ´óµÄ³ÌÐò£¬Ò²Ã»ÓÐʵս¾­Ñé¡­¡­

±àÒëÆ÷Ò»°ã»á°Ñ Ìí¼Óµ½¹¤³ÌµÄ .h Óë.cpp ¶ÔÓ¦ÆðÀ´ Éú³ÉÒ»¸ö¶ÔÓ¦Ãû³ÆµÄ objÎļþ
ºÜ¶àobjÎļþ ×îºóÁ´½Ó ¾Í³É exe ÁË

µ±Äã×öºÜ´óµÄÏîĿʱ ºÜ¶àÄ£¿é£¬ Ôõô×éÖ¯
Ö»ºÃ ·Ö²¼ÔÚ ²»Í¬µÄ .hÓë.cpp ÖÐÀ²

¡¾Ê¹ÓÃʱ Ö»ÐèÒª#include"OOXX.h"¡¿ ±àÒëÆ÷¾ÍÖªµÀÄãÒªÓà ¶ÔÓ¦µÄOOXX.cppÄ£¿éÀ²

ÄãÖ»ÐèÒª¹Ø×¢ .h ¾ÍÄÜÃ÷°× º¯ÊýÓë±äÁ¿ ÎÞÐèÖªµÀʵ


Ïà¹ØÎÊ´ð£º

ѧϰÌÖÂÛ C/C++ QQȺ - C/C++ / ·Ç¼¼ÊõÇø

QQȺ 29152388
ÓÑÇéUP

°ï¶¥

up

°ïup

up Ö§³Ö£¡

up jf

...ÄѵÀÓзÖ..?

up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£

Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ

¼ÓÁË¡£

¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......

¸Õѧ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 ......

VFPÈçºÎµ÷ÓÃCº¯Êý - ÆäËûÊý¾Ý¿â¿ª·¢ / VFP

ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿

ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£

Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......

°ïæ¿´¿´Õ⼸¸ö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#Éú³É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ºÅ