cµÄÒ»¸öÖ¸ÕëµØÖ·ÎÊÌâ
#include <stdio.h>
int main()
{
unsigned char *p1;
unsigned long *p2;
p1=(unsigned char *)0x801000;
p2=(unsigned long *)0x810000;
printf("%d\n",p2+5);
return 0;
}
Êä³öÊÇ8454164£¬¼´Ox810014
ÎÒ¾ÍÏ벻ͨÁË£¬Ôõô»áÊÇ14µÄ£¬´óϺ°ïæ¡£
×Ô¼ºUPÏ£¬´óϺ¿ìÀ´°¡£¡£¡£¡£¡
×î½üÓйØunsignedµÄÎÊÌâͦ¶àµÄ
¸ÕºÃÎÒ²»»á
ѧϰÁË
ÕýºÃ,ûÓÐʲô²»¶ÔµÄ
0X810014 = 0X810000 + 0X05 * 4;
¶ÔÓÚÏÖÔÚ32λµÄ»úÆ÷À´Ëµ,Ò»¸öÖ¸ÕëÊÇËĸö×Ö½Ú³¤¶È.
0X14==20
0x ÕâÑùµÄÊÇ 16½øÖƵÄ
longËĸö×Ö½Ú
Ôΰ¡£¬5*4 = 20,20ת»»³É16½øÖƸպÃ0x14£¬ÎÒ¿¿£¬ÎÒÍüÁËת»»ÁË£¬3Q
ºÍÇ©ÃûºÜÒ»ÖÂ~~~~
Ïà¹ØÎÊ´ð£º
ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿
ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£
Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......
ÈçÌ⣬C/C++ÖеÄexeclÔõôµ÷ÓÃдºÃµÄjava³ÌÐò£¬
execl("/opt/java1.5/bin/java","MyClass",NULL);
ÕâÑùµÄ²»ÐÐŶ¡£
²»»á.
ÔËÐÐjava³ÌÐò
ÕÒ¹¤¾ß²é¿´Ò»ÏÂÄǸö³ÌÐòµÄÃüÁîÐÐ
ËÑË÷Ï£ºjni ......
·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ
ѧϰ£¬¿´¿´
¼ÌÐø¶¥Å¶
ѧϰÁË¡£
go o ......
¸÷λ´óÏÀ£º
ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......
°ï°ï棬лл~
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 ......