C ÖÐÈçºÎÐÞ¸ÄÎļþµÄij¸ö×Ö·û£¿
±ÈÈçÎļþÀïÃæµÚÎåÐеÄÄÚÈÝΪ£º
abcdef=2
ÈçºÎ½«2ÐÞ¸ÄΪÆäËûµÄ×Ö·û£¬ÀýÈçÐÞ¸ÄΪ1
Òª½«ËùÓеĶÁ³öÀ´ÐÞ¸ÄÍêÔÙд»ØÈ¥
Óиü¼ò±ãµãµÄ·½·¨Âð£¿
ÎÒÄܹ»ÕÒµ½ÐèÒªÐ޸ĵÄ×Ö·ûµÄλÖ㬵«ÊDz»ÄÜÐÞ¸ÄËü
ÏȶÁÔÙ¸ÄÔÙд
±ÈÈçÎÒÓÃfseekÒÆµ½ÄǸöλÖÃÁË fputc²åÈë1ºó 2ûÓÐÈ¥µô°¡ Ö»ÊǺóÒÆÒ»¸öλÖöøÒÑ Ôõô°ì
f=fopen("...","rb+");
fseek
fwrite
fclose
Ïà¹ØÎÊ´ð£º
#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 ......
·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ
ѧϰ£¬¿´¿´
¼ÌÐø¶¥Å¶
ѧϰÁË¡£
go o ......
°ï°ï棬лл~
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 ......
¸øÒÑ֪ͼÏñÌí¼Ó¸ß˹ÔëÉù£¬ÇëÎʸß˹ÔëÉùÊÇÔõôʵÏֵģ¿¾ùÖµ·½²î·Ö±ðΪu£¬v¡£
½²Ò»ÏÂ˼·ҲÐа¡¡£¡£¡£¡£¡£¡£
csdn ¸ßÊÖÔÆ¼¯µÄµØ·½¡£¡£¡£¡£¡£¡£
http://zhidao.baidu.com/question/71224083.html
2Â¥¸øµÄÊÇÒ»¸ ......
ÔÚ¸ùĿ¼/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Öж¨ÒåµÄ·½·¨ ......